Section 3.1 - 3.2

The Euclidean Algorithm is pretty intuitive ad its cool how relatively simple and powerful it is. I'd like to see a better proof of the theorem that every positive integer is a product of primes. The proof in the book seems too trivial to be complete, but maybe I'm just paranoid about it.