Prove that if d is a common divisor of a and b, then d = gcd(a, b) if and only if gcd(a/d, b/d) = 1.
[Hint: Use Theorem 2.7.]
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.