3 2 3 2 3 2 m o d 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.
7 3 2 3 2 3 2
7 ( 2 8 + 4 ) 3 2 3 2
7 4 3 2 3 2
7 4 3 2 × 3 2 × 3 2 × ⋯ × 3 2 ( 3 2 t i m e s )
7 2 3 2 × 3 2 × 3 2 × ⋯ × 3 2 ( 3 1 t i m e s )
7 4 3 2 × 3 2 × 3 2 × ⋯ × 3 2 ( 3 0 t i m e s )
7 2 3 2 × 3 2 × 3 2 × ⋯ × 3 2 ( 2 9 t i m e s )
Finally, we get 7 4 , gives remainder = 4
Hmmm, I don't think your solution made any sense. The usual approach is by Mr Chew Seong, or by Carmichael's lambda function , or even euler's theorem , or by order of an element .
Log in to reply
Yes, we can do by any of the method you mentioned. But this is the basic approach for anyone who does not know any of the above. Although, it cannot be applied everywhere yet we can solve many questions. Otherwise Euler is a better option.
Log in to reply
No. I'm saying that your solution made no sense in the first place!
Log in to reply
@Pi Han Goh – okay, where does it not make sense? which line? I hope i can help to make it a little sensible.
Log in to reply
@Abhay Tiwari – Your fourth line onwards
Log in to reply
@Pi Han Goh – 7 4 3 2 × 3 2 × 3 2 × ⋯ × 3 2 ( 3 2 t i m e s ) , can also be written as 7 ( 4 3 2 ) 3 2 × 3 2 × 3 2 × ⋯ × 3 2 ( 3 1 t i m e s ) .
now take only 7 4 3 2
7 1 6 1 6 , which gives 7 2 1 6 .
7 ( 2 4 = 1 6 ) 4 , which will again result in 7 1 6
which finally yields 7 2 .
Now, we have 7 2 3 2 × 3 2 × 3 2 × ⋯ × 3 2 ( 3 1 t i m e s ) . Again performing the same steps we will get 7 4 at last. And we will see that this keeps on repeating.
Log in to reply
@Abhay Tiwari – Your phrasing is unusual, but your solution is essentially the same as "order of an element".
Try to use more "equal signs" and "congruence signs" when needed.
Log in to reply
@Pi Han Goh – okay, I will try to elaborate more from now onward.
Problem Loading...
Note Loading...
Set Loading...
Since 32 and 7 are coprime integers, we can apply Euler's theorem .
3 2 3 2 3 2 ≡ 3 2 3 2 3 2 mod 6 (mod 7) ϕ ( 7 ) = 6 ≡ 3 2 ( 3 0 + 2 ) 3 2 mod 6 (mod 7) ≡ 3 2 2 3 2 mod 6 (mod 7) We note that 2 n ≡ { 2 (mod 6) 4 (mod 6) if n is odd if n is even ≡ 3 2 4 (mod 7) ≡ 2 2 0 (mod 7) ≡ 2 2 0 (mod 6) (mod 7) ≡ 2 2 (mod 7) ≡ 4 (mod 7)