2 4 6 8 1 0 1 2 . . . . 1 0 0 + 1 What's the last digit 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.
same way and simple way ....
If we work modulo 5 (and modulo ϕ ( 5 ) = 4 in the exponent), the given number n is n ≡ 2 0 + 1 = 2 ( m o d 5 ) . Since n is odd, we have n ≡ 7 ( m o d 1 0 ) .
Great approach. Note that we could not apply Euler's theorem to ϕ ( 1 0 ) = 4 directly.
2^4=16. 16^n will always end with 6 so 6+1=7
Problem Loading...
Note Loading...
Set Loading...
Last digit of 2 follows a recurring cycle . Since any power of 4 is divisible by 4, last digit of
2 4 n
will always be 6 for integral n .
Hence the answer is 6 + 1 = 7