What is the remainder when 3 4 5 is divided by 125?
You may choose to refer to Euler's Theorem .
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.
There were numerous ways to approach this question. Paramit chanced upon 2 7 ≡ 3 ( m o d 1 2 5 ) . How can you use this fact to shorten the solution slightly (though, this is already pretty short).
Interestingly, though a large number of people got this correct, there were only 3 solutions that were submitted.
Solution 1: We use the fact that 3 ≡ 1 2 8 ≡ 2 7 ( m o d 1 2 5 ) . Also, ϕ ( 1 2 5 ) = 5 4 × 1 2 5 = 1 0 0 , so by Euler's Theorem, 2 1 0 0 ≡ 1 ( m o d 1 2 5 ) . Hence, 3 4 5 ≡ ( 2 7 ) 4 5 ≡ 2 3 1 5 ≡ 2 1 5 ≡ 2 7 × 2 7 × 2 = 3 × 3 × 2 ≡ 1 8 ( m o d 1 2 5 ) .
Solution 2: We have 3 5 ≡ 2 4 3 ≡ − 7 ( m o d 1 2 5 ) , and 7 4 ≡ 2 4 0 1 ≡ 2 6 ( m o d 1 2 5 ) . So 3 4 5 ≡ 3 5 × 9 ≡ ( − 7 ) 9 ≡ − 7 9 ≡ − 2 6 × 2 6 × 7 ≡ 1 8 ( m o d 1 2 5 ) .
sir if in this question they will ask find the last three digits of 3^45 then how can we do..plz reply @Calvin Lin
\(3^45\)=\(3^40 \times 3^5\) \(3^5 \equiv 118 \pmod{125}\) \(3^10 \equiv 49 \pmod{125}\) ----------\(\frac {118 \times 118}{125}\) \(3^20 \equiv 26 \pmod{125}\) ----------\(\frac {49 \times 49}{125}\) \(3^40 \equiv 51 \pmod{125}\) ----------\(\frac {26 \times 26}{125}\) \(3^45 \equiv 18 \pmod{125}\) ----------\(\frac {51 \times 118}{125}\)
Hence answer is remainder of \(\frac {51 \times 118}{125}\), which is equal to 18.
3^4=1+5k, k=16 raise both sides to power 11 to get 3^44=1+(11)(5k)+other terms using binomial thm. other than 1st two terms contain 125, so 3^44=881mod(125). multiply by 3 and reduce mod 125
3^3=25+2,
Using Binomial expansion, 3^{45}=(3^3)^{15}=(2+25)^15=2^15+15.2^{14}.25+...(mod 125)≡2^{15},
Now 2^7≡3(mod 125) , 2^15=2.(2^7)^2≡2.3^2
I have a strange way to answer this one:
We know ϕ ( 1 2 5 ) = 1 0 0 , and 4 5 = ( 1 0 0 / 2 ) − 5 , so 3 4 5 = 3 1 0 0 / 2 − 5 ≡
If 3 is a primitive root: ( − 1 ) ( 3 − 1 ) 5 ,
Else: ( 3 − 1 ) 5 .
Since ( 1 2 5 + 1 ) = 3 ( 4 2 ) we get:
( 4 2 ) 5 = ( ( 2 ) ( 3 ) ( 7 ) ) 5 = ( 3 2 ) ( 2 4 3 ) ( 1 6 8 0 7 ) ≡ ( 3 2 ) ( − 7 ) ( 5 7 ) ≡ − 1 8 . Therefore, we get 18 if 3 is primitive, or 107 otherwise.
Edit: You can find 3 to be primitive as 3 2 + 4 n ≡ 4 m o d 5 , and 3 4 n ≡ 1 m o d 5 . Since 3 5 0 = 3 2 + 4 ( 1 2 ) ≡ 4 m o d 5 , it is primitive. So the answer is simply 18.
Problem Loading...
Note Loading...
Set Loading...
3 4 5 = ( 3 5 ) 9 ≡ − ( 7 3 ) 3 ≡ 2 1 5 ≡ 3 2 × 2 ≡ ( − 7 ) 9 ≡ 3 2 3 ≡ ( 2 7 ) 2 × 2 ≡ 1 8 ( m o d 1 2 5 ) ( m o d 1 2 5 ) ( m o d 1 2 5 ) ( m o d 1 2 5 )
Hence, the required remainder is: 18.