Modular Arithmetichard
0:00.0

Which property must a modulus nn satisfy for the congruence axb(modn)ax \equiv b \pmod{n} to have exactly gcd(a,n)\gcd(a, n) distinct solutions modulo nn?