On solving the Diophantine equation on a vector computer
Authors:
D. R. HeathBrown, W. M. Lioen and H. J. J. te Riele
Journal:
Math. Comp. 61 (1993), 235244
MSC:
Primary 11Y50; Secondary 11D25
MathSciNet review:
1202610
Fulltext PDF Free Access
Abstract 
References 
Similar Articles 
Additional Information
Abstract: Recently, the first author has proposed a new algorithm for solving the Diophantine equation , where k is a given nonzero integer. In this paper we present the detailed versions of this algorithm for some values of k given below, and we describe how we have optimized and run the algorithm on a Cyber 205 vector computer. A vectorized version of the Euclidean algorithm was written, which is capable of solving the equations , at vector speed. Moreover, the basic doubleprecision arithmetic operations were vectorized. The following cases were implemented and run: , and 42. For a range was searched which includes the cube ; this considerably extends an earlier search in the cube . No solutions were found apart from the known ones (1, 1, 1) and . For , which probably is, with , the case which has attracted most attention in the literature, no solution was found. It is the smallest case for which no solution is known and for which one has not been able to find a proof that no solution exists. For a parametric form solution is known, but we also found one which does not belong to this parametric form, viz., . For , several new large solutions were found in addition to several known ones; this case served as a (partial) check of the correctness of our program. Finally, for we found the first solution: . Hence, this case can be dropped from the list of values of k for which no solution is known (yet).
 [1]
J.
W. S. Cassels, The rational solutions of the diophantine equation
𝑌²=𝑋³𝐷, Acta Math.
82 (1950), 243–273. MR 0035782
(12,11a)
 [2]
V.
L. Gardiner, R.
B. Lazarus, and P.
R. Stein, Solutions of the diophantine equation
𝑥³+𝑦³=𝑧³𝑑, Math. Comp. 18 (1964), 408–413. MR 0175843
(31 #119), http://dx.doi.org/10.1090/S00255718196401758439
 [3]
D.
R. HeathBrown, Searching for solutions of
𝑥³+𝑦³+𝑧³=𝑘,
Séminaire de Théorie des Nombres, Paris, 1989–90,
Progr. Math., vol. 102, Birkhäuser Boston, Boston, MA, 1992,
pp. 71–76. MR 1476729
(98f:11025), http://dx.doi.org/10.1007/9781475742695_6
 [4]
Donald
E. Knuth, The art of computer programming. Vol. 2, 2nd ed.,
AddisonWesley Publishing Co., Reading, Mass., 1981. Seminumerical
algorithms; AddisonWesley Series in Computer Science and Information
Processing. MR
633878 (83i:68003)
 [5]
D.
H. Lehmer, On the Diophantine equation
𝑥³+𝑦³+𝑧³=1, J. London Math.
Soc. 31 (1956), 275–280. MR 0078397
(17,1187c)
 [6]
J.
C. P. Miller and M.
F. C. Woollett, Solutions of the Diophantine equation
𝑥³+𝑦³+𝑧³=𝑘, J. London
Math. Soc. 30 (1955), 101–110. MR 0067916
(16,797e)
 [7]
L.
J. Mordell, On an infinity of integer solutions of
𝑎𝑥³+𝑎𝑦³+𝑏𝑧³=𝑏𝑐³,
J. London Math. Soc. 30 (1955), 111–113. MR 0067917
(16,798a)
 [8]
Manny
Scarowsky and Abraham
Boyarsky, A note on the Diophantine equation
𝑥ⁿ+𝑦ⁿ+𝑧ⁿ=3, Math. Comp. 42 (1984), no. 165, 235–237. MR 726000
(85c:11029), http://dx.doi.org/10.1090/S00255718198407260009
 [9]
J. J. F. M. Schlichting, Double precision BLAS, Algorithms and Applications on Vector and Parallel Computers (H. J. J. te Riele, Th. J. Dekker, and H. A. van der Vorst, eds.), NorthHolland, Amsterdam, 1987, pp. 229249.
 [1]
 J. W. S. Cassels, The rational solutions of the Diophantine equation , Acta Math. 82 (1950), 243273. MR 0035782 (12:11a)
 [2]
 V. L. Gardiner, R. B. Lazarus, and P. R. Stein, Solutions of the Diophantine equation , Math. Comp. 18 (1964), 408413. MR 0175843 (31:119)
 [3]
 D. R. HeathBrown, Searching for solutions of , Sém. Théorie des Nombres, Paris 19891990 (D. Sinnou, ed.), Birkhäuser, Boston, 1992, pp. 7176. MR 1476729 (98f:11025)
 [4]
 Donald E. Knuth, The art of computer programming, Vol. 2, Seminumerical algorithms, AddisonWesley, Reading, MA, 1981. MR 633878 (83i:68003)
 [5]
 D. H. Lehmer, On the Diophantine equation , J. London Math. Soc. 31 (1956), 275280. MR 0078397 (17:1187c)
 [6]
 J. C. P. Miller and M. F. C. Woollett, Solutions of the Diophantine equation , J. London Math. Soc. 30 (1955), 101110. MR 0067916 (16:797e)
 [7]
 L. J. Mordell, On an infinity of integer solutions of , J. London Math. Soc. 30 (1955), 111113. MR 0067917 (16:798a)
 [8]
 M. Scarowsky and A. Boyarsky, A note on the Diophantine equation , Math. Comp. 42 (1984), 235237. MR 726000 (85c:11029)
 [9]
 J. J. F. M. Schlichting, Double precision BLAS, Algorithms and Applications on Vector and Parallel Computers (H. J. J. te Riele, Th. J. Dekker, and H. A. van der Vorst, eds.), NorthHolland, Amsterdam, 1987, pp. 229249.
Similar Articles
Retrieve articles in Mathematics of Computation
with MSC:
11Y50,
11D25
Retrieve articles in all journals
with MSC:
11Y50,
11D25
Additional Information
DOI:
http://dx.doi.org/10.1090/S00255718199312026105
PII:
S 00255718(1993)12026105
Keywords:
Cubic Diophantine equation,
vector computer,
Euclidean algorithm
Article copyright:
© Copyright 1993
American Mathematical Society
