Ponder This Challenge - February 2026 - Blot-avoiding backgammon strategy
- Ponder This
This riddle was suggested by our previous puzzlemaster, Oded Margalit. Thanks Oded!
We are entering the 26th year of Ponder This and this is the 307th riddle. Both 26 and 307 are not palindromes, but their squares 676 and 94249 are.
Your goal: Find a number that is not a palindrome, such that is a palindrome and
A Bonus "*" will be given for finding that number, such that in addition to the previous constraints, we also have
An open question that we are pondering about: Does there exist an that is not a palindrome but is, such that all the digits of (in base 10) are odd?
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
October 2023 Solution:
When engineering the problem we did not consider negative numbers and forgot to explicitly forbid them, making solutions such as -12866669 possible. We accepted those solutions since they are nice tricks (which doesn't help with the bonus part).
Here is a brief description of one method of solving the problem, given by Karl Mahlburg:
Regular version:
n = 100000000000000100009999999999999990000000000000010001000000000000001
* version:
n = 10^{2*s3} + 1 + 10^{s3+s2} + 10^{s3-s2} + 10^{s3+s1} + 10^{s3-s1} - 10^s3,
where [s1, s2, s3] = [415, 3819, 4234]
(A 8469-digit number!)
The regular version is a similar construction as the * version, just with S = [15, 19, 34]. The next smallest case that satisfies the problem is [24, 43, 67].
I found this construction in some of the links from the OEIS page for palindromic squares
Most relevantly, the Asymmetric (A) family from here
This shows that any S = [s1, s2, s1 + s2] will give an asymmetric integer w/ palindromic square, and a brief search starts returning examples that satisfy the congruence mod 1201.
The congruence mod 3565 = 5*23*31 is not much harder, since mod 5 is satisfied automatically, and 23 and 31 are small primes, so Chinese Remainder Theorem works out pretty easily (note my * version is a lift of the regular solution, since 10 has order 200 mod 1201).