Ponder This Challenge - February 2026 - Blot-avoiding backgammon strategy
- Ponder This
Ponder This Challenge:
Define a program to be a list of commands, each command of the form Variable_1 <=- Variable_2 Operation constant or Variable_1 <=- Variable_2 Operation Variable_3 where operation can be either addition, multiplication or modulo.
Here is an example of a program which computes the function f(x) = 1+x+x^2+x^4 (modulo 2233393)
a=x*47518 b=a*a c=x+1 d=c+b e=b*b f=e+d g=f mod 2233393
Find another program which computes the same function which uses a multiplying two variables at most twice and its last two commands are: a multiplication of two variables and a modulo computation.
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 intended solution was to factor 1+x+x^2+x^4 to (x^2+ax+b)(x^2+cx+d) modulo 2233393. Note that 2233393 = 19*41*47*61, so we can factor modulo each one of the four primes and combine the resulting coefficients using the Chinese remainder theorem. A possible answer is y=x*x a=638773*x a=y+a a=1613501+a b=1594620*x b=y+b b=b+1831287 z=a*b z=z mod 2233393
As for the bonus question - it's the June 2012 question from the UYHIP web site. Visit the site on July to learn about their solution.