On searching for solutions of the Diophantine equation

Author:
Kenji Koyama

Journal:
Math. Comp. **69** (2000), 1735-1742

MSC (1991):
Primary 11D25

Published electronically:
February 21, 2000

MathSciNet review:
1680899

Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

We propose an efficient search algorithm to solve the equation for a fixed value of . By parametrizing , this algorithm obtains and (if they exist) by solving a quadratic equation derived from divisors of . Thanks to the use of several efficient number-theoretic sieves, the new algorithm is much faster on average than previous straightforward algorithms. We performed a computer search for six values of below 1000 for which no solution had previously been found. We found three new integer solutions for and 931 in the range of .

**1.**J. H. E. Cohn, private communication (1995).**2.**V. A. Dem′janenko,*Sums of four cubes*, Izv. Vysš. Učebn. Zaved. Matematika**1966**(1966), no. 5 (54), 64–69 (Russian). MR**0202663****3.**Richard K. Guy,*Unsolved problems in number theory*, Unsolved Problems in Intuitive Mathematics, vol. 1, Springer-Verlag, New York-Berlin, 1981. Problem Books in Mathematics. MR**656313****4.**Richard K. Guy,*Unsolved problems in number theory*, 2nd ed., Problem Books in Mathematics, Springer-Verlag, New York, 1994. Unsolved Problems in Intuitive Mathematics, I. MR**1299330****5.**D. R. Heath-Brown, W. M. Lioen, and H. J. J. te Riele,*On solving the Diophantine equation 𝑥³+𝑦³+𝑧³=𝑘 on a vector computer*, Math. Comp.**61**(1993), no. 203, 235–244. MR**1202610**, 10.1090/S0025-5718-1993-1202610-5**6.**K. Koyama,*Tables of solutions of the Diophantine equation*, Math. Comp.**62**(1994), 941-942.**7.**Kenji Koyama, Yukio Tsuruoka, and Hiroshi Sekigawa,*On searching for solutions of the Diophantine equation 𝑥³+𝑦³+𝑧³=𝑛*, Math. Comp.**66**(1997), no. 218, 841–851. MR**1401942**, 10.1090/S0025-5718-97-00830-2**8.**R. F. Lukes, private communication (1995).**9.**L. J. Mordell,*Diophantine equations*, Pure and Applied Mathematics, Vol. 30, Academic Press, London-New York, 1969. MR**0249355****10.**Hiroshi Sekigawa and Kenji Koyama,*Nonexistence conditions of a solution for the congruence 𝑥^{𝑘}₁+\cdots+𝑥^{𝑘}_{𝑠}≡𝑁\pmod{𝑝ⁿ}*, Math. Comp.**68**(1999), no. 227, 1283–1297. MR**1627821**, 10.1090/S0025-5718-99-01067-4

Retrieve articles in *Mathematics of Computation*
with MSC (1991):
11D25

Retrieve articles in all journals with MSC (1991): 11D25

Additional Information

**Kenji Koyama**

Affiliation:
NTT Communication Science Laboratories, 2-4 Hikaridai, Seika-cho, Soraku-gun, Kyoto 619-02 Japan

Email:
koyama@cslab.kecl.ntt.co.jp

DOI:
http://dx.doi.org/10.1090/S0025-5718-00-01202-3

Keywords:
Diophantine equation,
cubic,
number-theoretic sieves,
search algorithm,
computer search

Received by editor(s):
October 7, 1996

Received by editor(s) in revised form:
January 18, 1999

Published electronically:
February 21, 2000

Article copyright:
© Copyright 2000
American Mathematical Society