Using integers a, b and c...
I am trying to prove that if a and b are relativly prime (their gcd is 1), and if a divides c, and b divides c, then ab must divide c.
I started tooling with linear combinations and multipules but I couldn't seem to get the result (that some integer multipule of ab is equal to c)
Thanks! Sorry about my brutal spelling.
Well I'm still a little unclear on which theorems we can or can't make use of (if theorem A is used to prove theorem B, it wouldn't make sense to use B to prove A), but possibly another way is to use
And the fact that every multiple of ab is divisible by lcm(a,b). Probably would have to hit the books and see a proper development from axioms to give the best response, but maybe you have all you need by now.