maths.free › Number Theory › Fermat's little theorem and Euler's theorem

Fermat's little theorem and Euler's theorem

aᵖ⁻¹ ≡ 1 (mod p), the totient, and fast modular arithmetic.

For prime p and a not divisible by p, aᵖ⁻¹ ≡ 1 (mod p); Euler generalises to a^φ(n) ≡ 1 (mod n). These collapse huge exponents: 2¹⁰⁰ mod 13 reduces via 2¹² ≡ 1. Picture it: the powers of 2 mod 13 cycling around a 12-hour clock. Think it: this is Lagrange's theorem in the group (ℤ/n)*.

Fungerat exempel · 2^100 mod 13

Number-Theory · Modular-Arithmetic

2^100 mod 13

2,\ 100,\ 13

Steg för steg

  1. 2^{100} \bmod 13

    Never compute the huge power. Reduce after every multiplication (repeated squaring).

  2. 2 \equiv 2 \pmod{13}

    Reduce the base first.

  3. 100 = 1100100_2

    Write the exponent in binary: 7 squarings at most.

  4. 2^2 \equiv 4 \pmod{13}

    Square the running power.

  5. 4^2 \equiv 3 \pmod{13}

    Square the running power.

  6. r \leftarrow r \cdot 3 \equiv 3 \pmod{13}

    This bit is 1: multiply the result by the current power.

  7. 3^2 \equiv 9 \pmod{13}

    Square the running power.

  8. 9^2 \equiv 3 \pmod{13}

    Square the running power.

  9. 3^2 \equiv 9 \pmod{13}

    Square the running power.

  10. r \leftarrow r \cdot 9 \equiv 1 \pmod{13}

    This bit is 1: multiply the result by the current power.

  11. 9^2 \equiv 3 \pmod{13}

    Square the running power.

  12. r \leftarrow r \cdot 3 \equiv 3 \pmod{13}

    This bit is 1: multiply the result by the current power.

  13. 2^{100} \equiv 3 \pmod{13}

    Done.

Avslöja svaret
2^{100} \bmod 13 = 3

Nu är det din tur. Välj ett problem, skriv eller rita ditt eget. Varje steg, en bild, svaret dolt tills du frågar.

Fortsätt jobba.

Ett gratis konto lägger till anteckningar om varje lektion, en förteckning över vad du har avslutat, dina lösta problem på ett ställe, och en handledare du kan fråga om denna sida. Matematiken i sig är öppen för alla, inloggad eller inte.

Registrera dig Inloggning

Symboler som används här

Knacka på alla symboler för den fullständiga definitionen, en bild, och vad varje bokstav i den betyder.

Hur man: Fermat's little theorem and Euler's theorem

  1. Reduce the base mod n.
  2. Reduce the exponent mod p − 1 (prime) or mod φ(n) (general): Fermat/Euler.
  3. Finish with repeated squaring on what remains.

Frågor folk frågar

Why are primes so important?

Every integer factors into primes in exactly one way, so primes are the atoms of multiplication. Cryptography relies on that factoring being easy to state and hard to do.

How do I tell whether a big number is prime?

Trial division up to the square root works for small numbers. For large ones, probabilistic tests (Miller-Rabin) give an answer that is wrong with negligible probability, and deterministic tests (AKS) exist but are slower.

Mer information Number Theory

Prime factorisationPrime numbersGCD and LCMModular arithmeticDivisorsSequencesNumber basesDiophantine equationsRSA: cryptography from number theory