Ponder This Challenge - February 2026 - Blot-avoiding backgammon strategy
- Ponder This
Ponder This Challenge:
The puzzlemaster misstated the December puzzle the first time around. Let's try again.
Consider the integer N=2^1999 (2 raised to the 1999 power). Is there a positive integer multiple of N whose decimal representation does not contain the digit 0? How would you construct such an integer or prove that it doesn't exist?
We will post the names of those who submit a correct, original solution! If you don't want your name posted then please include such a statement in your submission!
We invite visitors to our website to submit an elegant solution. Send your submission to the ponder@il.ibm.com.
If you have any problems you think we might enjoy, please send them in. All replies should be sent to: ponder@il.ibm.com
Yes. Work from right to left. Start with N, and notice that its rightmost digit is not zero. Find the rightmost zero; say it's in the Kth position. Then add (10^K)*N (that is, N shifted over K positions) to change that digit without affecting any to the right of it.
Now find the next zero, and again add (10^J)*N for some appropriate J. With each iteration, the rightmost zero moves further to the left. Continue until the rightmost zero is at least 1999 places to the left (or there are none). Now our integer is (10^1999)*A + B, where B has no zeros.
Subtracting off (10^1999)*A = (2^1999)*(5^1999)*A, we are left with B, which is a multiple of (2^1999) with no zeros in its decimal representation.