Ponder This Challenge - February 2026 - Blot-avoiding backgammon strategy
- Ponder This
This puzzle was suggested by Karl Heinz Hofmann - thanks!
We are looking for a natural number X satisfying the following properties of its decimal representation:
All the digits appear at least once, but do not appear at all.
X can be written as a front part A and back part B, such that if X were a string, it could be written as A concatenated with B, such that
B is the product of the digits of X.
X is a multiple of B.
B is a perfect square.
For example, has the property that its digit product is so it can be split into and such that properties 2.1 and 2.3 are satisfied. However, none of the other properties are satisfied in this case since is missing the digits and is not a multiple of .
Your goal: Find the least number X satisfying the above properties.
A bonus "*" will be given for finding the least number X satisfying the above properties except property 2.3 which is replaced by a new property: 2.3 The digit product of A is a perfect cube.
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
October 2024 Solution:
The numerical solutions are
X = 1817198712146313216, A = 1817198712, B = 146313216
X = 8419411123272236924928, A = 84194111232, B = 72236924928
The solution is based on a search, which can be optimized in various ways. We give the method described by Alex Izvalov (thanks, Alex!):
We'll use several tactics to reduce the field of search.- As the number should contain all the digits at least once, and is the product of digits of , then If is a perfect square, then it should be in the form: , where are natural numbers
Then we can proceed in 2 directions: either search for as a multiple of and loop through and then check the digits, or construct as a number of gradually increasing length which product of numbers should be equal to , and then check if it's a multiple of .
I found the first, more straightforward way, easier to use when searching for the candidates for the minimal X, and the second way to prove that the results are indeed minimal.