Ponder This Challenge - February 2026 - Blot-avoiding backgammon strategy
- Ponder This
This problem was suggested by Latchezar Christov - thanks Latchezar!
Let be the sequence of natural numbers for which three properties are true:
Please note that because of property #1, there will only be n numbers in the sequence, for any given n.
The first such sequences are:
Your Goal: Please find the initial term of the sequence
A Bonus "*" will be given for finding the initial term of the sequence
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
March 2024 Solution:
The solution for is 115192665.
The solution for is 117778830159.
The case is difficult to obtain, usually requiring low-level optimizations. Here is one approach for example, as described by Asaf Zimmerman:
I implemented a straightforward check, using a sieve for primality check.
To be able to run the 2024 case (i.e. to hundreds of billions) I used the following optimizations:
This was enough to reduce the run time to around 1hr using python+numpy covering numbers to 300,000,000,000