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

## Question:

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

View this answer#### Ask a question

Our experts can answer your tough homework and study questions.

Ask a question Ask a question#### Search Answers

#### Learn more about this topic:

Get access to this video and our entire Q&A library

Greatest Common Divisor: Definition & Formula

from General Studies Math: Help & Review

Chapter 1 / Lesson 6
22K

#### Related to this Question

What is the gcf of 48 and 72?

What is the greatest common factor of 12 and...

Prove the following for positive integers, a, b, c...

The expression m%n yields the remainder of m upon...

How do you determine the GCF of 12 and 25?

What number is a factor of every number?

What is the linear combination of the...

What is the greatest common factor of 72 and...

What is the GCF of 35 and 63?

What is the GCF of 14 and 42?

What is the GCF of 45 and 20?

What is the GCF of 16 and 72?

#### Explore our homework questions and answers library

Browse
by subject