Extending Waring’s conjecture to $471,600,000$
HTML articles powered by AMS MathViewer
- by Jeffrey M. Kubina and Marvin C. Wunderlich PDF
- Math. Comp. 55 (1990), 815-820 Request permission
Abstract:
Two computer techniques are described that the authors used to confirm Waring’s Conjecture to 471,600,000, thus extending R. M. Stemmler’s result of 200,000 computed in 1964. M. C. Wunderlich increased the result to 175,600,000 in August 1988, and in the following October, J. M. Kubina, using a method suggested by Jean-Marc Deshouillers, raised it to 471,600,000.References
-
Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman, The design of computer algorithms, Addison-Wesley, Reading, Mass., 1974.
- Francine Delmer and Jean-Marc Deshouillers, On the computation of $g(k)$ in Waring’s problem, Math. Comp. 54 (1990), no. 190, 885–893. MR 1011440, DOI 10.1090/S0025-5718-1990-1011440-6
- Donald E. Knuth, The art of computer programming. Vol. 2, 2nd ed., Addison-Wesley Series in Computer Science and Information Processing, Addison-Wesley Publishing Co., Reading, Mass., 1981. Seminumerical algorithms. MR 633878
- Charles Small, Waring’s problem, Math. Mag. 50 (1977), no. 1, 12–16. MR 432573, DOI 10.2307/2689743
- Rosemarie M. Stemmler, The ideal Waring theorem for exponents $401-200,000$, Math. Comp. 18 (1964), 144–146. MR 159803, DOI 10.1090/S0025-5718-1964-0159803-X
Additional Information
- © Copyright 1990 American Mathematical Society
- Journal: Math. Comp. 55 (1990), 815-820
- MSC: Primary 11P05; Secondary 11Y35, 68-04
- DOI: https://doi.org/10.1090/S0025-5718-1990-1035936-6
- MathSciNet review: 1035936