.

Printable View

- Feb 7th 2013, 02:23 PMdave52proof if gcd(a,b)=1 and a|c b|c then ab|c
.

- Feb 7th 2013, 02:35 PMHallsofIvyRe: proof if gcd(a,b)=1 and a|c b|c then ab|c
That follows pretty quickly from the

**definition**of "greatest common dominator", doesn't it? If gcd(a, b)= 1, then a and b have no common factors. You might try, for one thing, consider the prime factorization of c. - Feb 7th 2013, 09:10 PMearthboyRe: proof if gcd(a,b)=1 and a|c b|c then ab|c