Expressing an integer as a sum of cubes of polynomials. (English) Zbl 07852285
In this paper, the author proves that there exist infinitely many integers which can be expressed as a sum of four cubes of polynomials with integer coefficients. Also, the author gives several identities that express the integers \(1\) and \(2\) as a sum of four cubes of polynomials and shows that every integer can be expressed as a sum of five cubes of polynomials with integer coefficients.
Reviewer: Hayder Hashim (Kufa)
MSC:
| 11D85 | Representation problems |
| 11D25 | Cubic and quartic Diophantine equations |
| 11C08 | Polynomials in number theory |
Keywords:
sums of integersReferences:
| [1] | M. Beck, E. Pine, W. Tarrant and K. Y. Jensen, New integer representations as the sum of three cubes, Math. Comp. 76 (2007), 1683-1690. · Zbl 1152.11014 |
| [2] | A. R. Booker, Cracking the problem with 33, Res. Number Theory 5 (2019), Paper No. 26. · Zbl 1472.11093 |
| [3] | A. R. Booker and A. V. Sutherland, On a question of Mordell, preprint, arXiv:2007.01209. |
| [4] | S. G. Huisman, Newer sums of three cubes, preprint, arXiv:1604.07746. |
| [5] | K. Mahler, Note on hypothesis K of Hardy and Littlewood, J. Lond. Math. Soc. 11 (1936), 136-138. · Zbl 0013.39101 |
| [6] | L. J. Mordell, On sums of three cubes, J. Lond. Math. Soc. 17 (1942), 139-144. · JFM 68.0067.03 |
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.
