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

Abstract

For each integer b ≥ 3 and every x ≥ 1, let Nb,0(x) be the set of positive integers n ≤ x which are divisible by the product of their nonzero base b digits. We prove bounds of the form xb,0 + o(1) < \#Nb,0(x) < xηb,0 + o(1), as x +∞, where b,0 and ηb,0 are constants in ]0,1[ depending only on b. In particular, we show that x0.526 < \#N10,0(x) < x0.787, for all sufficiently large x. This improves the bounds x0.495 < \#N10,0(x) < x0.901, which were proved by De Koninck and Luca.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…