Find sum of all value(s) of such that if the first digit in decimal representation of is removed , the remaining digits can be represented as some power of two.
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.
We get 2 n − d ⋅ 1 0 k = 2 m where d is the first decimal digit of 2 n , and k + 1 is the number of digits of 2 n . Rearranging, we get 2 m ( 2 n − m − 1 ) = d ⋅ 1 0 k So we can divide through by the 2 m on both sides to get 2 n − m − 1 = d ′ ⋅ 5 k where d ′ is odd (since the left side is odd, dividing through by 2 m must strip out all the factors of 2 on the right side).
Now the key observation is that 2 m has only one fewer digit than 2 n , so 2 n − m ≤ 1 0 0 , so 1 ≤ n − m ≤ 6 . Stepping through the cases gives n − m = 4 , k = 1 , d ′ = 3 as the only solution, so 2 n has two digits, and so the only solutions are 2 n = 3 2 , 6 4 . The answer is 5 + 6 = 1 1 .