2 3 1 7 × 3 5 2 5 × 4 3 1 × 7 7 9 3 × 8 3 1 3 2 × 1 9 1 7
Find the unit 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.
To me, the easier way (both in terms of solving and explaining) is to use chinese remainder theorem and consider ( m o d 5 ) , ( m o d 2 ) .
Log in to reply
What is Chinese reminder Theorem ??
Log in to reply
You can click on the link and read up the community wiki.
Problem Loading...
Note Loading...
Set Loading...
Let P = 2 3 1 7 × 3 5 2 5 × 4 3 1 × 7 7 9 3 × 8 3 1 3 2 × 1 9 1 7 = A × B × C × D × E × F .
Since 3, 7, 19 are 10 are coprime integers, for factors B , D and F of P , we can use Euler's theorem and Euler's totient function ϕ ( 1 0 ) = 1 0 × 2 1 × 5 4 = 4 as follows:
B D F ≡ 3 5 2 5 ≡ 3 5 2 5 mod 4 ≡ 3 ( 4 + 1 ) 2 5 mod 4 ≡ 3 (mod 10) ≡ 7 7 9 3 ≡ 7 7 9 3 mod 4 ≡ 7 ( 8 − 1 ) 9 3 mod 4 ≡ 7 − 1 mod 4 ≡ 7 3 ≡ 3 (mod 10) ≡ 1 9 1 7 ≡ ( 2 0 − 1 ) 1 7 ≡ − 1 ≡ 9 (mod 10)
As 2, 4 and 8 are not coprime integers with 10, we cannot use Euler's theorem, but the fact that 2 n mod 10 = ⎩ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎧ 6 2 4 8 if n mod 4 = 0 if n mod 4 = 1 if n mod 4 = 2 if n mod 4 = 3
A C E ≡ 2 3 1 7 ≡ 2 3 1 7 mod 4 ≡ 2 ( 4 − 1 ) 1 7 mod 4 ≡ 2 − 1 mod 4 ≡ 2 3 ≡ 8 (mod 10) ≡ 4 3 1 ≡ 2 2 × 3 1 mod 4 ≡ 2 2 ≡ 4 (mod 10) ≡ 8 3 1 3 2 ≡ 2 3 × 3 1 3 2 mod 4 ≡ 2 3 × ( 3 2 − 1 ) 3 2 mod 4 ≡ 2 3 ≡ 8 (mod 10)
Therefore, we have:
P ≡ A × B × C × D × E × F (mod 10) ≡ 8 × 3 × 4 × 3 × 8 × 9 (mod 10) ≡ ( − 2 ) × 4 × ( − 2 ) × 9 × 9 (mod 10) ≡ ( − 2 ) × 4 × ( − 2 ) × ( − 1 ) × ( − 1 ) (mod 10) ≡ 1 6 ≡ 6 (mod 10)