Papers
Topics
Authors
Recent
Search
2000 character limit reached

On numbers divisible by the product of their nonzero base $b$ digits

Published 14 Sep 2018 in math.NT | (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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.