1. The problem statement, all variables and given/known data Assume that n > 1 is an integer such that p does not divide n for all primes ≤ n1/3. Show that n is either a prime or the product of two primes. (Hint: assume to the contrary that n contains at least three prime factors. Try to derive a contradiction.) 2. Relevant equations Divisibility, etc. 3. The attempt at a solution Assume that there exists three primes such that n = p1p2p3. I suspect that you need to somehow show that there is a prime less than the cubic root that does divide n, but I'm not sure how to show it.