For this exercise you can use Wolfram Alpha
What is the smallest natural number such that the last 7 digits of are equal to the last 7 digits of ?
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.
Note that 7 2 ≡ 1 ( m o d 1 6 ) , which means that 7 2 n ≡ 1 ( m o d 2 n + 3 ) for all integers n ≥ 1 . Similarly 7 4 ≡ 1 ( m o d 2 5 ) , and hence 7 4 × 5 n ≡ 1 ( m o d 5 n + 2 ) for all n ≥ 0 . We certainly deduce that 7 1 0 n ≡ 1 ( m o d 1 0 n + 2 ) for all n ≥ 2 . We also note that 7 2 0 ≡ 1 ( m o d 1 0 0 0 ) .
Letting ( n ) 7 denote that level n tetration of 7 , we see that ( 2 ) 7 = 7 7 ≡ 3 ( m o d 2 0 ) , and hence ( 3 ) 7 ≡ 7 3 ≡ 3 4 3 ( m o d 1 0 0 0 ) . Thus ( 3 ) 7 ( 4 ) 7 ( 5 ) 7 ( 6 ) 7 ≡ ≡ ≡ ≡ 4 3 ( m o d 1 0 2 ) 3 4 3 ( m o d 1 0 3 ) 2 3 4 3 ( m o d 1 0 4 ) 7 2 3 4 3 ( m o d 1 0 5 ) ⇒ ⇒ ⇒ ⇒ ( 4 ) 7 ( 5 ) 7 ( 6 ) 7 ( 7 ) 7 ≡ ≡ ≡ ≡ 7 4 3 ≡ 2 3 4 3 ( m o d 1 0 4 ) 7 3 4 3 ≡ 7 2 3 4 3 ( m o d 1 0 5 ) 7 2 3 4 3 ≡ 1 7 2 3 4 3 ( m o d 1 0 6 ) 7 7 2 3 4 3 ( m o d 1 0 7 ) While we have used the fact that 7 1 0 5 ≡ 1 ( m o d 1 0 7 ) , the results in the first paragraph show that 7 5 0 0 0 0 ≡ 1 ( m o d 1 0 7 ) , and hence ( 7 ) 7 ≡ 7 2 2 3 4 3 ( m o d 1 0 7 ) In fact 5 0 0 0 0 is the order of 7 modulo 1 0 7 , and so the desired answer is 2 2 3 4 3 .