Proof Using Fundamental Thm of Arithmetic

• November 16th 2009, 09:15 AM
absvalue
Proof Using Fundamental Thm of Arithmetic
I'm asked to prove this lemma using the fundamental theorem of arithmetic:

Suppose $a,b,p \in \mathbb{Z}$ and $p$ is prime. If $p|ab$ then $p|a$ or $p|b$.

I understand how to prove this using normal methods. (Contradiction seems straightforward.) However, I've read the definition of the fundamental theorem of arithmetic on wikipedia, and am stuck on how to use it to prove the statement.
• November 16th 2009, 10:13 AM
clic-clac
Quote:

Yep you can do that with the fundamental theorem of arithmetic. Assume $p$ does not appear in the decomposition of $a,b.$ Then...