1 7 1 7 1 7 1 7 1 7
Determine the last two digits of the number above.
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.
Checking for the last two digits of the 1 7 n , for n ∈ [ 0 , 9 9 ] , shows that they repeat in a cycle of 2 0 . And by induction, the pattern is true for all n .
It can be seen that 1 7 n ≡ 1 7 n mod 20 ( m o d 1 0 0 ) according to the table below:
We note that 1 7 1 7 ≡ 7 7 ( m o d 1 0 0 ) and since 7 7 ≡ 1 7 ( m o d 2 0 )
⇒ 1 7 1 7 1 7 1 7 1 7 ≡ 1 7 1 7 1 7 7 7 ( m o d 1 0 0 ) ≡ 1 7 1 7 7 7 ( m o d 1 0 0 ) ≡ 1 7 7 7 ( m o d 1 0 0 )
≡ 7 7 ( m o d 1 0 0 )
Your solution has been marked wrong. Note that you should be careful with your position of m o d 1 0 0 . You should be working from the bottom to the top: with gcd ( a , c ) = 1 , a a a . . . m o d c = a a a . . . m o d ϕ ( c ) m o d c .
It should be 1 7 1 7 1 7 1 7 1 7 ( m o d 1 0 0 ) ≡ 1 7 1 7 1 7 1 7 1 7 m o d 2 0 ( m o d 1 0 0 ) ≡ …
Problem Loading...
Note Loading...
Set Loading...
By Euler's theorem we need to determine the value of each exponent below:
1 7 1 7 1 7 1 7 1 7 1 7 1 7 1 7 1 7 1 7 1 7 1 7 1 7 1 7 ≡ 1 7 1 ≡ 1 7 1 ≡ 1 7 1 7 ≡ ( 1 6 + 1 ) 1 7 ≡ 1 ( m o d 1 6 ) ≡ 1 7 ( m o d 4 0 ) ≡ ( 2 1 ) 4 × 1 7 ≡ 8 1 × 1 7 ≡ 7 7 ( m o d 1 0 0 ) ≡ 1 ( m o d 8 )
NOTE:
8 = ϕ ( 1 6 ) = 1 6 × ( 1 − 2 1 )
1 6 = ϕ ( 4 0 ) = 4 0 × ( 1 − 2 1 ) × ( 1 − 5 1 )
4 0 = ϕ ( 1 0 0 ) = 1 0 0 × ( 1 − 2 1 ) × ( 1 − 5 1 )