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

If we have integers $h$, $i$, $j$, and $k$, would it be true to say that $\gcd(h,i)\gcd(j,k)|\gcd(hi,jk)$? If so, how can we prove it?

share|cite|improve this question
Maybe you want $\gcd(h,j)\gcd(i,k)|\gcd(hi,jk)$? – Ross Millikan Oct 14 '11 at 2:56
up vote 3 down vote accepted

No, consider $h=i=2$ and $j=k=3$, then $$\gcd(h,i)\gcd(j,k)=\gcd(2,2)\gcd(3,3)=2\cdot 3=6\nmid 1=\gcd(4,9).$$

share|cite|improve this answer

By distributivity $\rm\ (h,i)\:(j,k) = (hj,hk,ij,ik)\ $ which divides $\rm\ hj, ik\ $ so also $\rm\:(hj,ik)\:.\:$ Presumably that's what was intended.

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.