Ponder This Challenge - February 2026 - Blot-avoiding backgammon strategy
- Ponder This
Ponder This Challenge:
Let b = (2^3^4^5) / (e^n), otherwise stated as "two to the power of (three to the power of (4 to the power of 5)) over e to the nth power", where n is an integer such that
1 < b < e.
Find b, with an accuracy of 10 decimal digits.
Update (9/11): There is a rather elegant way to solve this problem. We've added a star to solvers who found it.
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
ln(2^3^4^5)=3^1024 * ln(2)
We need to compute the fraction part of 3^1024 * ln(2).
The Taylor series of ln(x) around 1 converges slowly, so to compute ln(2) one can compute ln(1/2) = -ln(2), which converges much faster; but to earn a star we use the following relation:
ln(2) = ln(4/3)-ln(2/3)
which gives us the series
ln(2) = 2*sum_{i_0}^\infty 3^{-2i-1}\over(2i+1}
3^1024 has 489 digits, so we need to compute ln(2) with ~500 digits accuracy, but using the above formula we can see that ~550 terms would suffice, since the contribution of the rest to 3^1024 ln(2) is much smaller than 10^-10. So we get that the fractional part is: 0.4261674320657868...
The answer is the exponent of the above: 1.53137715531...