About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
October 2014
<<September October November>>
We are giving Alan Murray's solution (thanks, Alan):
Observe the following congruences:
2^(n+4*5^9) = 2^n mod 10^10 for n>=10
3^(n+8*5^8) = 3^n mod 4*5^9 for n>=0
4^(n+2*5^7) = 4^n mod 8*5^8 for n>=2
5^n = 5^7 mod 2*5^7 for n>=7
Now let n=6^(7^(8^9)), which is >=7.
So then 4^(5^n) = 390624 mod 8*5^8
And 3^(4^(5^n)) = 5765981 mod 4*5^9
And 2^(3^(4^(5^n))) = 8170340352 mod 10^10
If you have any problems you think we might enjoy, please send them in. All replies should be sent to: ponder@il.ibm.com