On the distribution of self-numbers
HTML articles powered by AMS MathViewer
- by U. Zannier
- Proc. Amer. Math. Soc. 85 (1982), 10-14
- DOI: https://doi.org/10.1090/S0002-9939-1982-0647887-4
- PDF | Request permission
Abstract:
Self-numbers are those integers which cannot be expressed as $a + f(a)$, where $f(a)$ denotes the sum of the digits of $a$ in a given scale. Here I prove that the number of self-numbers less than or equal to a large number $x$ equals $Lx + O({\log ^2}x)$, where $L$ is a strictly positive constant.References
- M. Gardner, Mathematical games, Sci. Amer. 232 (1975), 113-114.
B. S. Recaman, Solution to problem E 2408, Amer. Math. Monthly 81 (1974), 407.
- Kenneth B. Stolarsky, The sum of a digitaddition series, Proc. Amer. Math. Soc. 59 (1976), no. 1, 1–5. MR 409340, DOI 10.1090/S0002-9939-1976-0409340-X
Bibliographic Information
- © Copyright 1982 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 85 (1982), 10-14
- MSC: Primary 10A30
- DOI: https://doi.org/10.1090/S0002-9939-1982-0647887-4
- MathSciNet review: 647887