On the digital representation of integers with bounded prime factors
classification
🧮 math.NT
keywords
primefactorsrepresentationbaseintegernumbersbelongbounded
read the original abstract
Let $b \ge 2$ be an integer. Not much is known on the representation in base $b$ of prime numbers or of numbers whose prime factors belong to a given, finite set. Among other results, we establish that any sufficiently large integer which is not a multiple of $b$ and has only small (in a suitable sense) prime factors has at least four nonzero digits in its representation in base $b$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.