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.
Follow Math Help Forum on Facebook and Google+
This probably doesn't suffice, you'd might want to wait for a reply from one of the forum's masters. (Waiting for their admonishment.) Meanwhile, is there a [tex] tag keyboard shortcut?
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.
Originally Posted by sirellwood 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. Alternatively Problem: Suppose . Furthermore suppose that and . Prove that . Proof: Since we know such that . Therefore for the same we'd have that . Since it is clear that similarly since is it clear that . Therefore
View Tag Cloud