# modular arith quetion

Printable View

• January 17th 2008, 11:22 AM
yellow4321
modular arith quetion
.
.
• January 17th 2008, 12:17 PM
Soroban
Hello, yellow4321!

Here's a rather primitive method . . .

Quote:

Calculate: . $5^{72} \pmod{73}$

We have: . $5^9 \;=\;1,953,125 \;\equiv\;10\pmod{73}$

Then: . $(5^9)^8 \;\equiv\;10^8 \pmod{73}$

. . and we find that: . $10^8 \;\equiv\;1\pmod{73}$

Therefore: . $5^{72} \;\equiv\;1\pmod{73}$

• January 17th 2008, 05:33 PM
badgerigar
I learnt fermat's little theorem in the form $a^{p-1} \equiv 1 \pmod {p}$ if p is prime. This applies quite easily to your problem with p = 73
• January 17th 2008, 05:58 PM
yellow4321
..