Erdős Problem #406 — Powers of two with restricted ternary digits
For each integer , let and be the unique ternary digits of , so that
Is the set
finite? Equivalently, are there only finitely many powers of whose base- expansion omits the digit ? The known exponents are , giving , , and , respectively. Erdős Problem #406
Background
Erdős posed a stronger exact-examples conjecture: that the only exponents giving a power of expressible as a sum of distinct integral powers of are . That conjecture is distinct from the question here: proving that there are finitely many such exponents would not by itself show that the three known examples are the only ones. Narkiewicz records that the question was motivated by Gupta’s numerical check, which found no other examples through exponent . Narkiewicz (1980) Stoll, CIRM slides (2019)
A later computation reported that every for contains all three ternary digits. Such a finite range cannot decide either the finiteness question or the exact-examples conjecture, since it leaves larger exponents unexamined. Erdős Problem #406
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.