Signed sums of polynomial values
HTML articles powered by AMS MathViewer
- by Hong Bing Yu
- Proc. Amer. Math. Soc. 130 (2002), 1623-1627
- DOI: https://doi.org/10.1090/S0002-9939-01-06461-9
- Published electronically: November 15, 2001
- PDF | Request permission
Abstract:
We give a generalization of Bleicher’s result on signed sums of $k$th powers. Let $f(x)$ be an integral-valued polynomial of degree $k$ satisfying the necessary condition that there exists no integer $d>1$ dividing the values $f(x)$ for all integers $x$. Then, for every positive integer $n$ and every integer $l$, there are infinitely many integers $m\ge l$ and choices of $\varepsilon _{i}=\pm 1$ such that \[ n=\sum _{i=l}^{m}\varepsilon _{i}f(i).\]References
- Michael N. Bleicher, On Prielipp’s problem on signed sums of $k$th powers, J. Number Theory 56 (1996), no. 1, 36–51. MR 1370195, DOI 10.1006/jnth.1996.0004
- R. L. Graham, Complete sequences of polynomial values, Duke Math. J. 31 (1964), 275–285. MR 162759, DOI 10.1215/S0012-7094-64-03126-6
- L. K. Hua, An easier Waring-Kamke problem, J. London Math. Soc. 11(1936), 4–5.
- D. E. Knuth and José Heber Nieto, Solution to Problem E3303, Amer. Math. Monthly. 97(1990), 348–349.
- Melvyn B. Nathanson, Elementary methods in number theory, Graduate Texts in Mathematics, vol. 195, Springer-Verlag, New York, 2000. MR 1732941
Bibliographic Information
- Hong Bing Yu
- Affiliation: Department of Mathematics, University of Science and Technology of China, Hefei 230026, Anhui, People’s Republic of China
- Email: yuhb@ustc.edu.cn
- Received by editor(s): January 10, 2001
- Published electronically: November 15, 2001
- Additional Notes: The author was supported by the National Natural Science Foundation of China
- Communicated by: David E. Rohrlich
- © Copyright 2001 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 130 (2002), 1623-1627
- MSC (2000): Primary 11A67, 11P05
- DOI: https://doi.org/10.1090/S0002-9939-01-06461-9
- MathSciNet review: 1887008