13 Mar
2016
13 Mar
'16
8:55 a.m.
x^x == k (mod n) is solvable for all k iff gcd(n, phi(n)) = 1.