Question

Prove that if a | c and b | c and gcd(a,b) = 1 then ab | c

Answer 1

probably bezout for this one
that is assert that since gcd(a,b)=1 there are integers x and y with
\(ax+by=1\) that should work for you