If a ≡ b mod(n) where a, b, n ∈ \(\mathbb Z\) and n > 0. If gcd(a, n) = d, then gcd(b, n) is

1
a
2
nd
3
d
4
na

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Quick Navigation