MathCastle
Number TheoryHardFermat, Euler and Wilson

Fermat, Euler and Wilson · Hard problem

Find the smallest positive integer aa such that a2027≡3(mod11)a^{2027} \equiv 3 \pmod{11}.