Given two natural numbers a and b , the following definitions hold:
Compute n = 1 ∑ 9 ( n ↑ ↑ ↑ ( n + 1 ) m o d 1 0 ) .
The following are some examples of these tetration function:
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.
Nice problem. You can also prove that n ^^^ (n+1) \equiv n^(n^3) \mod 10 .
Problem Loading...
Note Loading...
Set Loading...
Let p ( m , n ) = m n m o d 1 0
It is clear that for all n > 0 , p ( 1 , n ) = 1 , p ( 5 , n ) = 5 , p ( 6 , n ) = 6
Further, for m = 2 , 4 , 8 , we have m 2 m o d 4 = 0 and thus m ↑ ↑ ↑ ( n + 1 ) = m p where p would be a multiple of 4 (because m is a even number).
Thus, for even m, m ↑ ↑ ↑ ( m + 1 ) would be of the form m 4 n
p ( 2 , 4 n ) = 6 , p ( 4 , 4 n ) = 6 , p ( 8 , 4 n ) = 6
For m = 3 , 7 , let
m ↑ ↑ ↑ ( m + 1 ) = m m q
Now, m q m o d 4 = ( m m o d 4 ) q = ( − 1 ) q = ( − 1 ) (because q would be an odd number for m = 3 , 7 and 3 m o d 4 = 7 m o d 4 = − 1 m o d 4 = 3 .
Hence, 3 ↑ ↑ ↑ 4 m o d 1 0 = 3 3 m o d 1 0 = 7 and 7 ↑ ↑ ↑ 8 m o d 1 0 = 7 3 m o d 1 0 = 3
Finally, it can be seen that any odd power of 9 would end in 9 , hence 9 ↑ ↑ ↑ 1 0 m o d 1 0 = 9
Hence, the required result is
1 + 6 + 7 + 6 + 5 + 6 + 3 + 6 + 9 = 4 9