If x = 2 2 0 + 3 3 0 + 4 4 0 + 5 5 0 + 6 6 0 , find x mod 7 .
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.
Since 2, 3, 4, 5, and 6 are coprime to 7, we can apply Euler's theorem . We note that Euler's totient function ϕ ( 7 ) = 6 . Then, we have:
x ≡ ( 2 2 0 + 3 3 0 + 4 4 0 + 5 5 0 + 6 6 0 ) (mod 7) ≡ ( 2 3 × 6 + 2 + 3 5 × 6 + 4 6 × 6 + 4 + 5 8 × 6 + 2 + 6 1 0 × 6 ) (mod 7) ≡ ( ( 2 ϕ ( 7 ) ) 3 2 2 + ( 3 ϕ ( 7 ) ) 5 + ( 4 ϕ ( 7 ) ) 6 4 4 + ( 5 ϕ ( 7 ) ) 8 5 2 + ( 6 ϕ ( 7 ) ) 1 0 ) (mod 7) ≡ ( 1 ⋅ 2 2 + 1 + 1 ⋅ 4 4 + 1 ⋅ 5 2 + 1 ) (mod 7) ≡ ( 2 2 + 1 + 4 4 + 5 2 + 1 ) (mod 7) ≡ ( 4 + 1 + 2 6 + 2 + 2 5 + 1 ) (mod 7) ≡ ( 4 + 1 + 4 + 4 + 1 ) (mod 7) ≡ 1 4 (mod 7) ≡ 0 (mod 7)
Sir i have separately calculated the remainder and then added like @Guillermo Templado has done .I can't understand what have you done , please can you explain it to me ?? Thank you
Log in to reply
He has done essentially what I done. Euler's theorem is essentially Fermat's little theorem when the module(in this case 7) is a prime number. He's just also applied elemental propierties of congruences like me, and Euler's theorem... Check also Euler's totient function please and I think in 10 minutes you'll understand it. I don't either want to be upset, sorry.
Log in to reply
I am sorry if someone was upset. I just wanted to show that the solution can be presented in one go.
Thank you . I will see it :).
I have added a line to explain it. For example 2 2 0 ≡ 2 3 × 6 + 2 ≡ ( 2 ϕ ( 7 ) ) 3 2 2 ≡ 1 3 2 2 ≡ 2 2 ≡ 4 (mod 7) .
Problem Loading...
Note Loading...
Set Loading...
Applying Fermat's little theorem : 2 6 ≡ 1 mod 7 ⇒ 2 2 0 = ( 2 6 ) 3 ⋅ 2 2 ≡ 4 mod 7 3 6 ≡ 1 mod 7 ⇒ 3 3 0 = ( 3 6 ) 5 ≡ 1 mod 7 4 6 ≡ 1 mod 7 ⇒ 4 4 0 = ( 4 6 ) 6 ⋅ 4 4 ≡ 4 mod 7 5 6 ≡ 1 mod 7 ⇒ 5 5 0 = ( 5 6 ) 8 ⋅ 5 2 ≡ 4 mod 7 6 6 ≡ 1 mod 7 ⇒ 6 6 0 = ( 6 6 ) 1 0 ≡ 1 mod 7 . Therefore, 2 2 0 + 3 3 0 + 4 4 0 + 5 5 0 + 6 6 0 ≡ 4 + 1 + 4 + 4 + 1 = 1 4 ≡ 0 mod 7