Waring’s problem for finite intervals
HTML articles powered by AMS MathViewer
- by Melvyn B. Nathanson PDF
- Proc. Amer. Math. Soc. 96 (1986), 15-17 Request permission
Abstract:
Let $f(n,k,s)$ denote the cardinality of the smallest set $A$ of nonnegative $k$-th powers such that every integer in $[0,n]$ is a sum of $s$ elements of $A$, and let $\beta (k,s) = {\text {lim su}}{{\text {p}}_{n \to \infty }}\log f(n,k,s)/\log n$. Clearly, $\beta (k,s) \geqslant 1/s$. In this paper it is proved that $f(n,k,s){\text { < }}c{n^{1/(s - g(k) + k)}}$ for all $n \geqslant {n_1}(k,s)$, where $g(k)$ is defined as in Waring’s problem, and $\beta (k,s) \sim 1/s$ as $s \to \infty$.References
- J. W. S. Cassels, Über Basen der natürlichen Zahlenreihe, Abh. Math. Sem. Univ. Hamburg 21 (1957), 247–257 (German). MR 88514, DOI 10.1007/BF02941936
- S. L. G. Choi, Paul Erdős, and Melvyn B. Nathanson, Lagrange’s theorem with $N^{1/3}$ squares, Proc. Amer. Math. Soc. 79 (1980), no. 2, 203–205. MR 565338, DOI 10.1090/S0002-9939-1980-0565338-3
- J. Gani and V. K. Rohatgi (eds.), Contributions to probability, Academic Press, Inc. [Harcourt Brace Jovanovich, Publishers], New York-London, 1981. A collection of papers dedicated to Eugene Lukacs. MR 618672
- Melvyn B. Nathanson, Waring’s problem for sets of density zero, Analytic number theory (Philadelphia, Pa., 1980) Lecture Notes in Math., vol. 899, Springer, Berlin-New York, 1981, pp. 301–310. MR 654535 D. Raikov, Über die Basen der natürlichen Zahlenreihe, Mat. Sb. N.S. 2 (44) (1937), 595-597.
- Alfred Stöhr, Eine Basis $h$-ter Ordnung für die Menge aller natürlichen Zahlen, Math. Z. 42 (1937), no. 1, 739–743 (German). MR 1545705, DOI 10.1007/BF01160108
- Joachim Zöllner, Über eine Vermutung von Choi, Erdős und Nathanson, Acta Arith. 45 (1985), no. 3, 211–213 (German). MR 808021, DOI 10.4064/aa-45-3-211-213
Additional Information
- © Copyright 1986 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 96 (1986), 15-17
- MSC: Primary 11P05
- DOI: https://doi.org/10.1090/S0002-9939-1986-0813800-3
- MathSciNet review: 813800