Prove that if d = gcd(m,n), then gcd(m/d,n/d)=1


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 to unlock this answer! Create your account

View this answer

Learn more about this topic:

Greatest Common Divisor: Definition & Formula

from General Studies Math: Help & Review

Chapter 1 / Lesson 6

Related to this Question

Explore our homework questions and answers library