Which condition ensures that ax≡b(modn)ax \equiv b \pmod nax≡b(modn) has exactly one solution modulo nnn?
gcd(a,n)=1\gcd(a, n) = 1gcd(a,n)=1
aaa is prime
nnn is prime
bbb is a multiple of aaa