Primeshard
0:00.0

A 'Carmichael Number' is a composite number nn that satisfies an11(modn)a^{n-1} \equiv 1 \pmod n for all integers aa with gcd(a,n)=1\gcd(a, n) = 1. Which of the following is the smallest Carmichael number?