Definition of prime number. Prove that If $p$ is a prime and $p ~|~ ab$, then $p ~|~ a$ or $p ~|~ b$.
Definition: An integer $p > 1$ is called a prime number, or simply a prime, if its only positive divisors are $1$ and $p$. An integer greater than $1$ that is not a prime is termed composite. Example: We can observe that $2, 3, 5, 7$ etc. are prime numbers whereas $4, 6, 8, 9, 10$ etc. are composite numbers. Theorem: If $p$ is a prime and $p ~|~ ab$, then $p ~|~ a$ or $p ~|~ b$. Proof: If $p ~|~ a$, then we are done. So suppose that $p \nmid a$. Therefore $gcd(p,a) = 1$. Hence by Euclid Lemma , $p ~|~ b$..