On searching for solutions of the Diophantine equation $x^3 + y^3 +2z^3 = n$
HTML articles powered by AMS MathViewer
- by Kenji Koyama;
- Math. Comp. 69 (2000), 1735-1742
- DOI: https://doi.org/10.1090/S0025-5718-00-01202-3
- Published electronically: February 21, 2000
- PDF | Request permission
Abstract:
We propose an efficient search algorithm to solve the equation $x^3+y^3+ 2z^3=n$ for a fixed value of $n>0$. By parametrizing $|z|$, this algorithm obtains $|x|$ and $|y|$ (if they exist) by solving a quadratic equation derived from divisors of $2|z|^3 \pm n$. 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 $n$ below 1000 for which no solution had previously been found. We found three new integer solutions for $n=183, \ 491$ and 931 in the range of $|z| \le 5 \cdot 10^7$.References
- J. H. E. Cohn, private communication (1995).
- V. A. Dem′janenko, Sums of four cubes, Izv. Vysš. Učebn. Zaved. Matematika 1966 (1966), no. 5(54), 64–69 (Russian). MR 202663
- Richard K. Guy, Unsolved problems in number theory, Problem Books in Mathematics, Springer-Verlag, New York-Berlin, 1981. Unsolved Problems in Intuitive Mathematics, 1. MR 656313
- 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, DOI 10.1007/978-1-4899-3585-4
- D. R. Heath-Brown, W. M. Lioen, and H. J. J. te Riele, On solving the Diophantine equation $x^3+y^3+z^3=k$ on a vector computer, Math. Comp. 61 (1993), no. 203, 235–244. MR 1202610, DOI 10.1090/S0025-5718-1993-1202610-5
- K. Koyama, Tables of solutions of the Diophantine equation $x^3+y^3+ z^3=n$, Math. Comp. 62 (1994), 941-942.
- Kenji Koyama, Yukio Tsuruoka, and Hiroshi Sekigawa, On searching for solutions of the Diophantine equation $x^3+y^3+z^3=n$, Math. Comp. 66 (1997), no. 218, 841–851. MR 1401942, DOI 10.1090/S0025-5718-97-00830-2
- R. F. Lukes, private communication (1995).
- L. J. Mordell, Diophantine equations, Pure and Applied Mathematics, Vol. 30, Academic Press, London-New York, 1969. MR 249355
- Hiroshi Sekigawa and Kenji Koyama, Nonexistence conditions of a solution for the congruence $x^k_1+\cdots +x^k_s\equiv N\pmod {p^n}$, Math. Comp. 68 (1999), no. 227, 1283–1297. MR 1627821, DOI 10.1090/S0025-5718-99-01067-4
Bibliographic 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
- Received by editor(s): October 7, 1996
- Received by editor(s) in revised form: January 18, 1999
- Published electronically: February 21, 2000
- © Copyright 2000 American Mathematical Society
- Journal: Math. Comp. 69 (2000), 1735-1742
- MSC (1991): Primary 11D25
- DOI: https://doi.org/10.1090/S0025-5718-00-01202-3
- MathSciNet review: 1680899