Re:Powers of 2 with all even digits
by LegionMammal978 on Thursday March 20, 2025 @10:04AM
(#43423653)
In this case, it doesn't even help to downsize the problem. Erdős once asked the same question, but with powers of 2, base 3, and the set {0,1}. (If you want to, you can disguise that version as something more natural-looking like "Which powers of 2 can be expressed as the sum of distinct powers of 3?") But we're still nowhere close to solving it.
Re:Powers of 2 with all even digits
by intalentive on Thursday March 20, 2025 @11:31AM
(#43424699)
You can generalize it if you want. Given powers of p in base b, what is the largest n=p^i such that each digit is divisible by k. Here we have: if p=2, b=10, k=2, then n=2048 and i=11. Why? Maybe there is a deeper reason that applies to all values of p, b, k.
Nothing about this question feels natural. I've noticed that random facts often don't have simple proofs.