Optional Problems

It is a standard result about primes (known as Euclid’s Lemma) that if p is prime, then whenever p divides a product ab, p divides at least one of a, b. Prove the converse, that any natural number having this property (for any pair a, b) must be prime.