What is the remainder?
As expressed above, this problem can be worked in Wolfram/Alpha as 2^2^2^2 mod (2^2^2+3)
All the numbers are sufficiently small that pencil and paper are sufficient.
Clarification: Δrchish Ray caught a typographical error. It turns out that the answer is the same for both and . Therefore, I will leave this problem in Brilliant. I apologize to those that worked the harder version with a five-high tower of twos. Also as a matter of fact, Wolfram/Alpha can handle both versions, four and five high towers.
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.
( 6 5 5 3 6 m o d 1 9 ) ⇒ 5