Ponder This Challenge - February 2026 - Blot-avoiding backgammon strategy
- Ponder This
Ponder This Challenge:
Definitions:
In the plane, call a point a "lattice point" if both its coordinates are integers, so that (2,-3) is a lattice point but (1,3.5) is not. A "circle" is the curve, not the 2-dimensional figure enclosed in that curve; it is described by giving its radius and the coordinates of its center.
Problem:
Part 1:
Describe a circle in the plane which passes through exactly seven lattice points.
Part 2:
Find such a circle with minimum radius.
Part 3:
Find (up to symmetries) all such circles with radius less than 50.
Unfortunately we won't be able to respond to answers to parts 2 and 3 this time.
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
Solution:
Schinzel's theorem guarantees that this problem can be solved for any given number of lattice points.
The smallest such circle has center (5/22,9/22) and radius sqrt(276250)/22.
Vladimir Sedach and Hajo Luers each submitted a list of 65 circles with radius less than 50, each passing through exactly seven lattice points.
If you have any problems you think we might enjoy, please send them in. All replies should be sent to: ponder@il.ibm.com