Given that for all primes , show that n > 1 is either a prime or the product of two primes.
[Hint: Assume to the contrary that n contains at least three prime factors.]
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.