What is the remainder?
The modulus is .
There exists another, equivalent Wolfram Mathematica 12 expression that works.
Hint: since no one else has solved the problem, use the PowerMod function and divide the power tower in half. That is the other, equivalent Wolfram Mathematica 12 expression that works.
A number theoretic approach may work.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The equivalent Wolfram Mathematica 12 expression is PowerMod[2^2^2^2^2, 2^2^2^2^2, 2^2^6 + 3] or ( ( 2 2 2 2 2 ) 2 2 2 2 2 m o d ( 2 2 6 + 3 ) ) ⇒ 2 0 4 7 2 9 1 3 1 1 3 5 8 9 6 3 6 7 1 It executes in a small number of milliseconds on my computer.
The PowerMod function uses the Mod function on intermediate values as needed to expedite the computation while working to the final answer. This function is used in cryptographic number theory.
lo g 1 0 ( 2 2 2 2 2 lo g 1 0 ( 2 2 2 2 2 ) ) ≈ 1 9 7 3 2 . 5 9 6 8 8 5 5 3 7 6 .