Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

how to prove or disprove the following :-

$$\gcd (kn,km) = k\gcd(n,m).$$



share|cite|improve this question
It should probably be added that $m$, $n$, and $k$ are positive. If you already have and can use the Unique Factorization Theorem (aka the Fundamental Theorem of Arithmetic), then it comes down to comparing exponents of the primes. If this comes before Unique Factorization, more detailed work is involved. – André Nicolas Jan 16 '12 at 0:21
What is your definition of $\operatorname{gcd}$? The first one is certainly true—can you try to prove it? – Dylan Moreland Jan 16 '12 at 0:22
@Dylan I have it on good authority that his definition of gcd is taking the minimum exponent of every prime ;). – aelguindy Jan 16 '12 at 9:04

HINT $\rm\ \ d\ |\ (kn,km)/k \iff dk\ |\ (kn,km) \iff dk\ |\ kn,km \iff d\ |\ n,m \iff d\ |\ (n,m)$

Dually $\rm\ \ \ \ [kn,km]/k\ |\ d \iff [kn,km]\ |\ kd \iff kn,km\ |\ kd \iff n,m\ |\ d \iff [n,m]\ |\ d $

THEOREM $\rm\;\; (a,b)\ =\ ab/[a,b] \;\;$ if $\;\rm\ [a,b] \;$ exists.

Proof $\rm\ \ d\ |\ a,b \;\iff\; a,b\ |\ ab/d \;\iff\; [a,b]\ |\ ab/d \;\iff\; d\ |\ ab/[a,b]\ \ $ QED

These proofs use the universal definitions of GCD and LCM.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.