Prove that if d = gcd(m,n), then gcd(m/d,n/d)=1
Greatest Common Divisor:
The greatest common divisor is one of the important topic in mathematics especially for algebra. It is called gcd as abbreviation. For two or more integers, gcd is the greatest integer that divides all the integer. For example gcd (12 , 48) = 12.
Answer and Explanation:
See full answer below.
Become a member and unlock all Study Answers
Try it risk-free for 30 daysTry it risk-free
Ask a question
Our experts can answer your tough homework and study questions.Ask a question Ask a question
Learn more about this topic:
from General Studies Math: Help & ReviewChapter 1 / Lesson 6