Proof with prime numbers

Given that p doesn't divide n for all primes p is less than equal to the cube root of n, show that n> is either a prime or the product of two primes.

I was given a hint and I was told to assume to the contrary that n contains at least 3 prime factors.

Quote:

---

Originally Posted by MichaelG

Given that p doesn't divide n for all primes p is less than equal to the cube root of n, show that n> is either a prime or the product of two primes.

I was given a hint and I was told to assume to the contrary that n contains at least 3 prime factors.

---

suppose where and are primes. then contradiction!