MathCastle
Number TheoryEasyFermat, Euler and Wilson

Fermat, Euler and Wilson · Easy problem

Knowing that 12!≡−1(mod13)12! \equiv -1 \pmod{13} (Wilson's Theorem), find the remainder when 11!11! is divided by 1313.