Ponder This Challenge - February 2026 - Blot-avoiding backgammon strategy
- Ponder This
Ponder This Challenge:
Thanks to Adir Pridor for the following challenge:
A gardener plants a tree on every integer lattice point, except the origin, inside a circle with a radius of 9801. The trees are cylindrical in shape and all grow together at the same rate.
As the trees grow, more and more points outside the circle of trees stop having a direct line of sight with the origin. What will be the trees' radius when the origin first loses its line of sight with all the points outside the circle? Please give your answer as a decimal number with an accuracy of 13 digits (13 significant digits).
Here is a sketch of a forest of radius 5 and a light beam entering the origin (center of the forest).
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
The problem was originally proposed almost a century ago (see Polya, G., "Zahlentheoretisches und wahrscheinlichkeitstheoretisches uber die sichtweite im walde," Arch. Math. Phys., 27 (1918): 135-142).
The answer is 1/sqrt(d), where d is the smallest integer satisfying d=a^2+b^2, where a is co-prime to b, and d>=R^2.
Clearly, d<=R^2+1 by choosing a=R and b=1; and d can be R^2 if and only if all the prime factors of R are 1 modulo 4.
In our case, R=9801=3^4*11^2, so the critical radius is 1/sqrt(R^2+1) which is 0.000102030404529629...