- Home >
- Mathematics >
- Prove that for all integers a, b, m, if gcd(a, b) = 1, a|m and b|m, then ab|m
Prove that for all integers a, b, m, if gcd(a, b) = 1, a|m and b|m, then ab|m
Question Description
I know this much that since a|m and b|m, there exist j, k such that aj = m = bk. Thus, aj = bk. Don't really know where to go from there though
This question has not been answered.
Create a free account to get help with this and any other question!
Similar Content
Blink
by Malcolm Gladwell
Tess of the DUrbervilles
by Thomas Hardy
Homo Deus
by Yuval Noah Harari
The Age Of Light
by Whitney Scharer
Hidden Figures
by Margot Lee Shetterly
The Adventures of Huckleberry Finn
by Mark Twain
The Subtle Art of Not Giving a F*ck
by Mark Manson
Good Kids Bad City
by Kyle Swenson
Studypool values your privacy. Only questions posted as Public are visible on our website.
Brown University
1271 Tutors
California Institute of Technology
2131 Tutors
Carnegie Mellon University
982 Tutors
Columbia University
1256 Tutors
Dartmouth University
2113 Tutors
Emory University
2279 Tutors
Harvard University
599 Tutors
Massachusetts Institute of Technology
2319 Tutors
New York University
1645 Tutors
Notre Dam University
1911 Tutors
Oklahoma University
2122 Tutors
Pennsylvania State University
932 Tutors
Princeton University
1211 Tutors
Stanford University
983 Tutors
University of California
1282 Tutors
Oxford University
123 Tutors
Yale University
2325 Tutors