Numerical investigation of Waring's problem for cubes
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
Numerical results on Waring's problem for cubes are given. In particular strong evidence is presented indicating the truth of the conjectureG(3)=4, i.e. that every sufficiently large number can be written as the sum of at most 4 positive cubes.
- Jing-jun Chen,Waring's problem for g(5), Sci. Sinica, 13 (1964), 1547–1568.
- H. Davenport,On Waring's problem for cubes, Acta Math. 71 (1939), 123–143.
- L. E. Dickson,Simpler proofs of Waring's theorem on cubes with various generalizations, Trans. Amer. Math. Soc., 30 (1928), 1–18.
- W. J. Ellison,Waring's problem, Amer. Math. Monthly, 78 (1971), 10–36.
- R. L. Graham,Complete sequences of polynomial values, Duke Math. J. 31 (1964), 275–285.
- Hardy-Wright,The Theory of Numbers, Oxford University Press (1960).
- A. E. Western,Computations concerning numbers representable by four or five cubes, J. London Math. Soc. 1 (1926), 244–250.
- Numerical investigation of Waring's problem for cubes
BIT Numerical Mathematics
Volume 21, Issue 1 , pp 118-122
- Cover Date
- Print ISSN
- Online ISSN
- Kluwer Academic Publishers
- Additional Links
- Industry Sectors