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.