On the Distribution of Self-Numbers

From MaRDI portal





Denote by \(f(n)\) the sum of the digits of the natural number \(n\) in the scale \(g\). A number \(m\) is called a self-number if it cannot be written in the form \(n+f(n)\). It has been proved [\textit{B. S. Recamán}, Solution to problem E 2408, Am. Math. Mon. 81, 403 (1974)] that there are infinitely many self-numbers (in any scale \(g)\). The author now shows an asymptotic formula for the number \(A(x)\) of self-numbers less than or equal to \(x\): \[ A(x)=L(g)x+O(\log xf([x]))\] with a positive constant \(L(g)\). He computes \(L(g)\) for \(g=2,4\) and \(10\) to three decimals.











This page was built for publication: On the Distribution of Self-Numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3963078)