Hi all,

a, b are coprime integers such that a|m and b|m, for some integer m. Prove, using Euclid’s lemma, that ab|m.

Printable View

- November 5th 2009, 05:05 AMsirellwoodCoprime Proof
Hi all,

a, b are coprime integers such that a|m and b|m, for some integer m. Prove, using Euclid’s lemma, that ab|m. - November 6th 2009, 05:58 AMcourteous

This probably doesn't suffice, you'd might want to wait for a reply from one of the forum's masters.(Wink) (Waiting for their admonishment.)

Meanwhile, is there a [tex] tag keyboard shortcut? - November 6th 2009, 06:05 AMMedia_Man
Consider: , so for some . Since , . Since are coprime, , nor do they share any factors whatsoever, therefore , and for some . Now , so . QED

Courteous: Consider yourself trivially admonished. - November 6th 2009, 08:47 AMDrexel28