Prove if $n$ is an integer, $n \geq 2$, then either $n$ is prime or else can be factored into a product of primes.
I don't quite understand (at all) how to connect this to the fundamental theorem of arithmetic, so ANY help would be appreciated!
Sign up using Google
Sign up using Facebook
Sign up using Stack Exchange
2 years ago