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.
I have edited the problem, can you please edit your solution?
We just have to consider the powers of last digits of each term. If we work out the last digits of the power of last digit of the base of a term, we will find recurrence.
[The pattern for last digit depends on the power and last digit of base because the last digit comes from the multiplication of the base and the previous power. And among the digits of the base only the last digit is responsible for the last digit of product.]
If we work out for powers of 8 we see 8 , 4 , 2 , 6 , 8 , 4 , 2 , . . . . and so on as the last digits for power 1 , 2 , 3 , . . . . e t c . It repeats after 4 terms. Now we can write 2 0 5 = 4 ∗ 5 1 + 1 . So last digit of 1 8 2 0 5 is equal to the last digit of 8 1 which is 8 .
Similarly for the 2 n d term, last digit of powers of 2 also repeats after 4 terms. Now, 3 9 4 = 4 ∗ 9 8 + 2 . So last digit of 4 2 3 9 4 is equal to the last digit of 2 2 which is 4 .
So, the last digit is 8 − 4 = 4 .
I have edited the problem, can you please edit your solution?
Problem Loading...
Note Loading...
Set Loading...
Let the given number be N . Then
N ≡ 1 8 2 0 5 − 4 2 9 4 ( m o d 1 0 ) ≡ 8 2 0 5 − 2 9 4 ( m o d 1 0 ) ≡ ( 1 0 − 2 ) 2 0 5 − 2 9 4 ( m o d 1 0 ) ≡ − 2 2 0 5 − 2 9 4 ( m o d 1 0 ) ≡ − 2 × 2 4 × 5 1 − 2 2 × 2 4 × 2 3 ( m o d 1 0 ) ≡ − 2 × 1 6 5 1 − 2 2 × 1 6 2 3 ( m o d 1 0 ) ≡ − 2 × 6 5 1 − 2 2 × 6 2 3 ( m o d 1 0 ) ≡ − 2 × 6 − 4 × 6 ( m o d 1 0 ) ≡ − 1 2 − 2 4 ≡ − 6 ≡ 4 ( m o d 1 0 ) Note that any positive power of 6 always ends with 6.