On numbers divisible by the product of their nonzero base $b$ digits (1809.05463v1)
Abstract: For each integer $b \geq 3$ and every $x \geq 1$, let $\mathcal{N}{b,0}(x)$ be the set of positive integers $n \leq x$ which are divisible by the product of their nonzero base $b$ digits. We prove bounds of the form $x{\rho{b,0} + o(1)} < #\mathcal{N}{b,0}(x) < x{\eta{b,0} + o(1)}$, as $x \to +\infty$, where $\rho_{b,0}$ and $\eta_{b,0}$ are constants in ${]0,1[}$ depending only on $b$. In particular, we show that $x{0.526} < #\mathcal{N}{10,0}(x) < x{0.787}$, for all sufficiently large $x$. This improves the bounds $x{0.495} < #\mathcal{N}{10,0}(x) < x{0.901}$, which were proved by De Koninck and Luca.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.