The remainder of 3¹⁰⁰ divided by 7 (Fermat's little theorem)
Need a hint?
Fermat: for a prime p not dividing a, leaves remainder 1.
leaves remainder 4 when divided by 7.
How to work it out
Since 7 is prime and does not divide 3, Fermat's little theorem gives . Check: .
Divide the exponent by 6: . So
(1)
LaTeX source of the formulas on this page
\[ 4 \]
\[ 3^{100}=(3^6)^{16}\cdot3^4\equiv1\cdot81\equiv4\pmod 7 \]Questions
What is the answer to: The remainder of 3¹⁰⁰ divided by 7 (Fermat's little theorem)?
leaves remainder 4 when divided by 7.
What is the key idea?
Fermat's little theorem lets you reduce the exponent modulo p − 1.
Is there a hint?
Fermat: for a prime p not dividing a, leaves remainder 1.