5^3 = -1 mod 126
5^501 = (5^3)^167 or (-1)^167 mod 126
= -1 mod 126
so reminder = 126-1 or 125
2006-12-11 16:02:58
·
answer #1
·
answered by arpita 5
·
0⤊
0⤋
We can write 5^501 = 5^3 * 5^498 = 5^3 * (5^6)^83 = 125 * (15625)^83.
Notice that, for any n, 15625n = 15624n + n = (126)(124)n + n. This means that 15625n differs from n by a multiple of 126. Thus, if we divide 15625n by 126, we get the same remainder as if we were to divide n by 126.
Thus, if we divide 125 * (15625)^83 by 126, we get the same remainder as if we divided 125 * (15625)^82 by 126; which is the same remainder as if we divided 125 * (15625)^81; and so on down, until we get the same remainder as if we divided 125 by 126.
Therefore, the remainder when dividing 5^501 by 126 is 125.
(If you know group theory: Work out 5^501 within Z/126Z, the cyclic group of order 126. The argument is easier.)
2006-12-10 17:52:56
·
answer #2
·
answered by Anonymous
·
0⤊
0⤋
Using Euler's theorem, a^(Euler-phi(n)) is congruent to 1 mod n. Since 126 = 2 x 3^2 x 7, Euler-phi(126) = (126)(1/2)(2/3)(6/7) = 36. Then 5^36 is congruent to 1 mod 126.
Since 501 = 33 + (13)(36), 5^501 is congruent to 5^33 is congruent to 125^11 is congruent to (-1)^11 is congruent to -1 is congruent to 125 mod 126.
2006-12-10 18:16:15
·
answer #3
·
answered by bictor717 3
·
0⤊
0⤋
5^3 = -1 mod 126
5^501 = (5^3)^167 or (-1)^167 mod 126
= -1 mod 126
so reminder = 126-1 or 125
2006-12-10 17:52:27
·
answer #4
·
answered by Mein Hoon Na 7
·
1⤊
0⤋
125
2006-12-10 18:04:03
·
answer #5
·
answered by I don't think so 5
·
0⤊
0⤋
125 is the remainder. And I'm not even typing out all the digits from my calculator for the quotient. ;)
2006-12-10 17:47:15
·
answer #6
·
answered by Anonymous
·
1⤊
0⤋
reminder or remainder? ang labo non a. make yourself understood please.
2006-12-10 17:50:44
·
answer #7
·
answered by tj 1
·
0⤊
0⤋
what math is that?
2006-12-10 17:44:36
·
answer #8
·
answered by Roxana 2
·
0⤊
0⤋
sorry don't know
2006-12-10 18:05:05
·
answer #9
·
answered by Blueberry 4
·
0⤊
1⤋