← Back to the programme
    OlympiadHardNumber Theory10–12

    Fermat's Little Theorem

    Pequeno Teorema de Fermat

    Find the remainder when 21002^{100} is divided by 101.

    101 is prime. Use Fermat's Little Theorem: ap−1≡1(modp)a^{p-1} \equiv 1 \pmod{p}.

    Solution

    Step 1 of 3

    1. 1.101 is prime and gcd⁡(2,101)=1\gcd(2, 101) = 1.