Just wondering, are we able to assume: (or is this the definition)
a = b (mod m)
means
a = km + b
where k is an integer?
It's for this question where I have to prove that:
if a = b (mod m) then gcd(a, m) = gcd(b, m).
Simple, but I've been skipping maths lectures ;)