arXiv:math/0512006math.DS
Ternary expansions of powers of 2
Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.
Abstract
Paul Erdos asked how frequently the ternary expansion of 2^n omits the digit 2. He conjectured this happens only for finitely many values of n. We generalize this question to consider iterates of two discrete dynamical systems. The first is over the real numbers, and considers the integer part of lambda 2^n for a real input lambda. The second is over the 3-adic integers, and considers the sequence lambda 2^n for a 3-adic integer input lambda. We show that the number of input values that have infinitely many iterates omitting the digit 2 in their ternary expansion is small in a suitable sense. For each nonzero input we give an asymptotic upper bound on the number of the first k iterates that omit the digit 2, as k goes to infinity. We also study auxiliary problems concerning the Hausdorff dimension of intersections of multiplicative translates of 3-adic Cantor sets.
Nope, it's not that easy in this case. E.g., Erdős conjectured in 1979 that every power of 2 greater than 256 has a digit '2' in its ternary expansion [0]. This makes sense heuristically, but no methods since then have come close to proving it. Digits of numbers are a wild…
LegionMammal978View on HNParent context