/-
Copyright 2026 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/modulepublicimportFormalConjecturesUtil
Smallest power with base>1 and exponent $n$ without digit 0
For statistical reasons it is conjectured that the sequence is finite.
Also it is conjectured that $a(40)$ does not exist (i.e. the sequence is empty for $n=40$).
A helper predicate: $b^n$ is a power with base $>1$ whose decimal representation
does not contain the digit 0.
We assume $n$ is the exponent, $n \ge 1$.
The primary defining sequence a.
a n is the smallest power with base $>1$ and exponent $n$ whose decimal representation
doesn't contain the digit 0.
$$a(n) = (\min { b \in \mathbb{N} \mid b > 1,
\text{decimal representation of } b^n \text{ contains no digit } 0 })^n$$
If no such base exists, sInf of an empty set of naturals returns 0, so a n = 0.
For statistical reasons it is conjectured that the sequence is finite.
Finite means here that for some $n$, no power $b^n$ with base $b > 1$ has a zeroless decimal
representation, which in our definition results in $a(n) = 0$.
This holds for $n = 2500$
(source).
Take any integer $b > 1$ and let $N = b^{2500}$. Since $b \ge 2$, we have
$N \ge 2^{2500} > 10^5$, so $N$ has at least six decimal digits. We split into four cases
depending on the divisibility of $b$ by $2$ and $5$:
If $10 \mid b$: Then $10 \mid N$, so the units digit of $N$ is $0$.
If $b$ is odd and $5 \nmid b$: Since $b$ is odd and the Carmichael function satisfies
$\lambda(16) = 4 \mid 2500$, we have $N \equiv 1 \pmod{16}$. Since $5 \nmid b$ and
$\varphi(5^5) = 2500$, Euler's totient theorem gives $N \equiv 1 \pmod{3125}$. By the Chinese
Remainder Theorem, $N \equiv 1 \pmod{50000}$ (as $16 \cdot 3125 = 50000$), so the tens digit
of $N$ is $0$.
If $b$ is odd and $5 \mid b$: As above, $N \equiv 1 \pmod{16}$. Since $5 \mid b$ and
$2500 \ge 4$, we also have $5^4 = 625 \mid N$, so $N \equiv 0 \pmod{625}$. Since
$16 \cdot 625 = 10^4$ and $625 \equiv 1 \pmod{16}$, the Chinese Remainder Theorem gives
$N \equiv 625 \pmod{10^4}$. Because $N > 10^4$, the last four digits of $N$ are $0625$, so its
thousands digit is $0$.
If $b$ is even and $5 \nmid b$: Since $2 \mid b$ and $2500 \ge 5$, we have
$2^5 = 32 \mid N$, so $N \equiv 0 \pmod{32}$. Since $5 \nmid b$, Euler's theorem again gives
$N \equiv 1 \pmod{3125}$. Because $32 \cdot 3125 = 10^5$ and
$9376 = 293 \cdot 32 = 3 \cdot 3125 + 1$, the Chinese Remainder Theorem gives
$N \equiv 9376 \pmod{10^5}$. Since $N > 10^5$, the last five digits of $N$ are $09376$, so its
ten-thousands digit is $0$.
In every case, the decimal representation of $N$ contains the digit $0$, so $a(2500) = 0$.
This claim is rooted in the finiteness conjecture. The most direct mathematical expression
of the open problem concerning $a(40)$ is the negation of the existence of a valid base.