Let P(x) be a nonconstant polynomial, where all the coefficients are nonnegative integers. Prove that there exist infinitely many positive integers n such that P(n) is composite.
By the prime number theorem, the nth prime is like n*log n. This is not a polynomial, so there must be an n such that p(n) is composite.
Can you elaborate please...
+133 
