0
$\begingroup$

Prove: If $c \ge ab$ and $a|c$ and $b|c$ then $ab|c$.

If $a|c$ and $b|c$ then there are integers $p$ and $q$ such that

$ap=c$ and $bq=c$


All of my work has boiled down to substitutions, a lot of them. My intuition has been pointing towards the inequality, but I'm not sure how to implement it.

I've attempted manipulating a diophantine equation, but I'm not sure if I have enough prior results available to use anything like ax+cy=1.

I've found this question which was somewhat similar.

  • 0
    Ok, without that condition it's false. And yes, $(a,b)$ is another way to write $\gcd(a,b)$, both are pretty standard.2011-11-01

1 Answers 1

4

The statement you want to prove is false in general.

Take $c=330$, $a=6$, $b=15$. Then $a|c$, $b|c$, $ab = 90\leq c$, but $ab=90$ does not divide $c=330$.

Essentially, the problem is that if $\gcd(a,b)\gt 1$, then you could have prime factors show up to "too large" a power in $ab$; you can ensure $ab\leq c$ easily enough by adding large prime factors that don't involve $a$ and $b$. Above, I took $a=2\times 3$, $b=3\times 5$, and then started with $2\times 3\times 5$, and then multiplied by $11$ to ensure it was large enough.

  • 0
    Even with $a=6$, $b=15$, one could take $c=120$.2011-11-01