I'm trying to prove this statement but I don't know where to start.
The problem says, Let $a$,$b$, and $c$ be positive integers. Suppose that, for any $b$ and $c$, whenever $a\mid bc$, either $a\mid b$ or $a\mid c$. Show that $a=1$ or $a$ is prime.


Assume $a \neq 1$, we show its a prime. Suppose to the contrary that its not a prime, then $a = m\cdot n$, where we can assume that $m$ is a prime. Thus $a \mid m$, or $a\mid n$. If $a \mid m \Rightarrow a = m$ and is a prime. If not, $a \mid n$, and since $n \mid a \Rightarrow a = n \Rightarrow m = 1$, contradiction it being a prime (factor) of $a$.

  • $\begingroup$ did you read the condition in the problem? $a = m\cdot n$ means $a \mid m\cdot n$, and by the condition this means $a \mid m$ or $a \mid n$ $\endgroup$ – DeepSea Oct 12 '15 at 7:00
  • $\begingroup$ Oh, I'm sorry. It wasn't clear you were taking the condition into account. It sounded like you were just claiming it. Actually, once I realise you are taking the condition into account, your answer is clearer than mine. My apologies. $\endgroup$ – fleablood Oct 12 '15 at 7:03
  • $\begingroup$ If a|m, how do we know that a=m and that it is prime? $\endgroup$ – Pdkelx Oct 12 '15 at 7:12
  • $\begingroup$ Since $m$ is a prime, and if $a \neq 1$ and $a \mid m$, then $a = m$, and $a$ is a prime since $m$ is. $\endgroup$ – DeepSea Oct 12 '15 at 7:14
  • $\begingroup$ I apologize if this is redundant but how can we assume m is prime? $\endgroup$ – Pdkelx Oct 12 '15 at 7:21

Show that if $a$ is composite then it is possible to find a $b$ and $c$ such that $a|bc$ but $a$ divides neither $b$ nor $c$.

In fact. Let $c$ and $b$ be factors of $a$...

If $a = m*n$ (neither $m$ nor $n$ equal to 1 or to $a$) then $a|mn$ but neither $a|m$ nor $a|n$. So the condition is not true.

So if the condition is true, it has to be that $a$ is either prime or $a = 1$.


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.