Ponder This Challenge - February 2026 - Blot-avoiding backgammon strategy
- Ponder This
Ponder This Challenge:
This months challenge is based on an idea from Anees Shaikh.
For each natural number there is a lamp.
At the beginning (Midnight between Saturday and Sunday), all the lamps are off.
1/2 of a second later came a little dwarf who switched their state (i.e., turned them all on).
1/4 of a second later, another dwarf comes and toggles the lamp switch for every second number. Now all the even lamps are off again and all the odd ones stay on.
1/8 of a second later comes yet another dwarf and toggles the lamp of every third number: the number 3, which was on, gets turned off, the number 6 which was off is now on, etc.
1/16 of a second later, another dwarf toggles every fourth number, and so on (after 1/2^n of a second the dwarf toggles all the numbers that are divisible by n).
Meanwhile, a red dragon is learning to count:
It counts "one" and drops a flammable egg near lamp #1.
It counts "one, two" and leaves another egg near lamp #3.
It counts "one, two, three" and places an egg near lamp #6.
It counts "one, two, three, four" and lays an egg near lamp #10; and so on.
The red dragon walks at a constant pace of one lamp per second.
Suddenly, he lays an egg too close to one of the lamps, which was on at the time, and therefore hot, and it immediately explodes.
The explosion ruined the lamp's number sign, but the last three digits are still visible: "576".
When did the explosion occur? What day of the week, hour, minutes, and seconds?
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
In the first part of the challenge, the dwarfs leave the scene after a second and leave a lamp on if and only if its number has an odd number of divisors.
Divisors usually comes in pairs: d and n/d. Only perfect squares can have an odd number of divisors.
The dragon goes over all the triangle numbers, i.e., numbers that are the sum of consecutive integers from 1 to m.
Our challenge was to find an integer n that satisfies
n = 576+1000*l = k*k = m*(m+1)/2
for some integers l, k, and m. These numbers satisfy ( http://en.wikipedia.org/wiki/Square_triangular_number) a recursion formula
n_{k+1} = 34*n_k - n_{k-1} + 2 with the initial value of n_1=1 and n_0=0.
Since we are interested in n modulo (7*24*60*60), we can compute the full cycle, using the recursion above, and get three possible solutions:
Thu 12:09:36; Mon 21:09:36; and Mon 00:09:36.
Sec Zehl (01/19/2012 08:53 AM EDT)