Sextuples of integers whose sums in pairs are squares. (English) Zbl 1369.11024
Summary: This paper is concerned with the diophantine problem of finding six integers such that the sum of any two of them is a perfect square. Till now, only one numerical example of such a sextuple has been published. In this paper, we obtain infinitely many examples of sextuples of integers such that the sum of any two of them is a perfect square. These examples include sextuples which have three or four or five distinct integers as well as sextuples in which all the integers are distinct.
MSC:
| 11D09 | Quadratic and bilinear Diophantine equations |
Online Encyclopedia of Integer Sequences:
Regular triangle in which the n-th row lists the least n-tuple of positive integers in which the sum of any two members is a square.References:
| [1] | DOI: 10.4171/LEM/59-3-7 · Zbl 1320.11025 · doi:10.4171/LEM/59-3-7 |
| [2] | Dickson L. E., History of Theory of Numbers 2 (1992) |
| [3] | DOI: 10.1007/978-0-387-26677-0 · doi:10.1007/978-0-387-26677-0 |
| [4] | Lagrange J., Sém. Delange-Pisot-Poitou. Théor. Nombres 12 pp 1– (1971) |
| [5] | Lagrange J., Acta Arith. 40 pp 91– (1981) |
| [6] | DOI: 10.2307/3617620 · Zbl 0379.10013 · doi:10.2307/3617620 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
