Ponder This Challenge - February 2026 - Blot-avoiding backgammon strategy
- Ponder This
Ponder This Challenge:
We define flip(n) as writing the integer n in seven-segment font and flipping it (rotating it 180 degrees). For example, flip(168)=891.
The flip operation is only defined for digits that have a numerical meaning when flipped. For example, the digit "4" becomes the letter "h", which is not a digit, so the flip operation is not defined for numbers like 4 or 141.
If flip(n) is well-defined, we call n a flippable number.
Find an integer n > 0 for which all of the following three conditions hold:
A. n is flippable and flip(n) = n.
B. n*n is flippable.
C. n is divisible by 2011.
For example,
(192555261) satisfies conditions A and C but not B, since n*n starts with the unflippable digit 3.
For extra credit, send us another integer that satisfies conditions A, B, and the new condition C': n divided by 2011 leaves a remainder of 100.
Correct solutions to the extra credit challenge will earn solvers a star next to their names.
Update: February 4th: Note that flipping "2" gets a "2", not "5".
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
You can solve this challenge in several ways. By exhaustive search (checking all the possibilities), you can obtain the smallest answers: 5000261920005 for conditions A,B,and C, and 10962025901110652029601 for conditions A,B,and C'.
A simpler solution is to examine numbers of the form 10^n+1 (100...001), which fulfill conditions A and B, and choose n such that condition C is fulfilled too. The first such solution is 10^335+1.
10^n+1 will never fulfill condition C', so other patterns must be found. A possible solution is 5005*(10^303+1).