State the converse of Fermat's Little Theorem and its validity.
If a^(n-1)≡1(mod n) for all a coprime to n, then n is prime — TRUE
If a^(n-1)≡1(mod n) for some a, then n is prime — FALSE (Carmichael numbers)
If a^(n-1)≡1(mod n) for all a coprime to n, then n is prime — FALSE (Carmichael numbers exist)
The converse is always true