1
$\begingroup$

If $a\mid c$ and $b\mid c$, must $ab$ divide $c$? Justify your answer.

$a\mid c$, $c=ak$ for some integer $k$

$b\mid c$, $c=bu$ for some integer $u$

From here I wanted to try to check if there were counter examples I could use,

$c\ne(ab)w$ for some integer $w$

From here I got stuck because there is nothing I can plug into that equation so I know that I am probably missing something.

$\endgroup$
  • 3
    $\begingroup$ $2,4,4 \qquad{}$ $\endgroup$ – user223391 Jan 29 '17 at 21:10
  • $\begingroup$ $4\mid 12$ and $6\mid12$ but $4\times6\nmid12. \qquad$ $\endgroup$ – Michael Hardy Jan 29 '17 at 21:37
  • 1
    $\begingroup$ Fun fact: If $a\mid c$ and $b\mid c$ for coprime $a$ and $b$, then $ab\mid c$. $\endgroup$ – ryanblack Jan 29 '17 at 21:40
5
$\begingroup$

This is not true.

Take for instance $a=b=2$ and $c=2$.

Then $a\mid c $ and $b\mid c$, but

$$ab=4\nmid 2=c.$$

$\endgroup$
3
$\begingroup$

$4\mid 12$ and $6\mid12$ but $4\times6\nmid12. \qquad$

The proposition is true when $\gcd(a,b)=1.$

$\endgroup$
  • 2
    $\begingroup$ Womp. This was the example I was going to use. $+1$! $\endgroup$ – Cameron Williams Jan 29 '17 at 21:41
2
$\begingroup$

No it must not, you can give a simple counter-example like $3\mid 9$ and $9\mid 9$ but obviously $$ab=9\cdot3=27 \nmid9$$ Hope it helps you out!

$\endgroup$
  • $\begingroup$ $a = 3, b = 5, c=5, gcd(a,b) = 1$ but the $ab \not \mid c$ $\endgroup$ – Rezwan Arefin Jan 29 '17 at 21:25
  • $\begingroup$ True that, ill change this up in a second, I was thinking of an extension to Euclid's Lemma $\endgroup$ – Carlos Seda Jan 29 '17 at 21:29

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

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