Question: Let a and b be integers which are not both zero, and let d= gcd(a, b). Prove that gcd (a/d,b/d)= 1.
Let a and b be integers which are not both zero, and let d= gcd(a, b). Prove that gcd (a/d,b/d)= 1.
Step by Step Solution
3.41 Rating (154 Votes )
There are 3 Steps involved in it
Let d gcd a b Also let k gcd ad bd Then there exists some nonze... View full answer
Get step-by-step solutions from verified subject matter experts
