Prove: If a is congruent to b (mod n), then mcd(a,n) = mcd (b,n)

[zhazzu]

I have to give a proof of:

If a is congruent to b (mod n), then mcd(a,n) = mcd (b,n)

 

[Deleted member 4993]

I have to give a proof of:

If a is congruent to b (mod n), then mcd(a,n) = mcd (b,n)

What is the definition of "mcd" in modular arithmetic?

 

[stapel]

What is the definition of "mcd" in modular arithmetic?

I think it's something like "maximum common divisor", being the same as "greatest common divisor". So it's the largest integer which divides each of the inputs.