Hey, I have been staring at this problem for a couple of hours now and have no clue how to solve it. Thus, any help would be greatly appreciated. Suppose b, m and n are positive integers. If m == n (mod b), prove that gcd(b,m) = gcd(b,n).
