Ponder This Challenge - February 2026 - Blot-avoiding backgammon strategy
- Ponder This
Ponder This Challenge:
When you roll three octahedron (eight sided) dice with the sides numbered 1, 4, 16, 64, 256, 1024, 4096, 16384, there are 120 different sums which can be produced. The maximal value, in this example, is 16384.
Find the eight positive integers that could number a octahedral die and minimize the maximum value of the eight faces, while still resulting in 120 possible sums when three of the dice are rolled.
Update 7/5: Many of you gave a solution of 219, which is not optimal; hint: don't be greedy.
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
We are sorry to disappoint those of you who expected to see an elegant solution, but we don't know of one for this version of the Golomb ruler problem.
If you find one - please send it to us and we'll publish it.
There are many ways to solve this month's challenge - mostly just using computerized calculations to search for possible solutions.
The only (up to a symmetrical) solution is 1, 3, 6, 35, 75, 108, 121, 130.
Many of you solved a greedy version of the problem (see sequence A096772 in The On-Line Encyclopedia of Integer Sequences) and got the wrong solution: 1, 2, 5, 14, 33, 72, 125, 219.
Some of you solved the more general problems for sets of nine and ten integers:
1, 2, 18, 27, 128, 139, 186, 205, 209
1, 7, 11, 35, 112, 131, 235, 268, 299, 310
John Tromp also submitted his solution to the OEIS as sequence A227358. Thank you, John, for sharing your results and for holding the publication till the end of the month.