For a, b, n Z+ and n > 1, prove that a = b (mod n)

Question:

For a, b, n ∈ Z+ and n > 1, prove that a = b (mod n) => gcd(a, n) = ged(b, n).
Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Question Posted: