The last digit of the value of the number 2 0 0 3 2 0 0 2 + 2 0 0 1 2 0 0 2 is -
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.
2003^2002 + 2001^2002≡? mod 10 I) (2003,10) = 1 => φ(10)=4 2003^4≡1 mod 10 => 2003^2000≡1 mod 10=> 2003^2002≡9 mod 10
II) (2001,10)=1=> φ(10)=4 2001^4≡1 mod 10 => 2001^2000≡1 mod 10=> 2001^2002≡1 mod 10
∴ 2003^2002 + 2001^2002≡ 9 +1=10 ≡ 0 mod 10
Logically in 2003 the last digit is 3 Powers of 3 gives many numbers(as last digit) let's make it 9 As it is last digit don't matter about others so 3 raised to 2002 =9 raised to 1001 In odd Powers of 9 last digit is 9 and even Powers gives 1. And in 2001 last digit is 1 so there any power will have last digit 1 So 9+1=10 so last digit =0
2 0 0 3 2 0 0 2 = 1 0 B + 3 2 0 0 0 × 9 = 1 0 B + ( 8 0 + 1 ) 5 0 0 × 9 = 1 0 A + 9 2 0 0 1 2 0 0 2 = ( 2 0 0 0 + 1 ) 2 0 0 2 = 1 0 C + 1 ⇒ 3 2 0 0 2 + 2 0 0 1 2 0 0 2 = 1 0 D ⇒ R = 0
Problem Loading...
Note Loading...
Set Loading...
Look this pattern:
2 0 0 3 1 unit digit is 3
2 0 0 3 2 unit digit is 9
2 0 0 3 3 unit digit is 7
2 0 0 3 4 unit digit is 1
After 4 powers the sequence repeats. 2 0 0 3 5 unit digit is 3
2 0 0 3 6 unit digit is 9
...
The remainder left when 2002 is divided by 4 is 2. 2 0 0 3 2 0 0 2 the unit digit is 9 according to the pattern.
The unit digit of 2001 is 1. 1 times 1 is 1. Logically 2 0 0 1 2 0 0 2 the unit digit is 1.
9 + 1 = 1 0 the unit digit of 2 0 0 3 2 0 0 2 + 2 0 0 1 2 0 0 2 is 0.