The following powers of 2 consist of all even digits:
2 3 2 6 2 1 1 = = = 2 1 2 2 2 1 + 2 2 1 + 2 + 3 2 2 + 3 + 6 = = = = = 2 4 8 6 4 2 0 4 8
Does 2 3 + 6 + 1 1 contain all even digits?
Generalization proofs are more than welcome here.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
There has been a discussion about 2 0 4 8 known for having the even digits. The fact that there is no obvious generalization relies very deep on the multiplication. However, this isn't enough to cover the proof. Even some articles explore some parts of powers of 2 via high-level engineering methods.
Here is the discussion from Stack Exchange I am referring to.
Problem Loading...
Note Loading...
Set Loading...
[This isn't a generalization proof.]
2 3 + 6 + 1 1 = 2 2 0 = 1 0 4 8 5 7 6
I'm not sure what 2 n will contain only even digits,but we can look for 2 n − 1 which contains digits 0 , 1 , 2 , 3 , 4 only. ( I guess there are no more after 2048)
View OEIS