Which of the following conditions ensures that ax≡b(modn)ax \equiv b \pmod{n}ax≡b(modn) has exactly d=gcd(a,n)d = \gcd(a, n)d=gcd(a,n) solutions?
ddd divides bbb
ddd does not divide bbb
aaa is prime
nnn is prime