Loading [MathJax]/jax/output/SVG/jax.js
 
+0  
 
-3
812
2
avatar+288 

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.

 

For this question can someone also explain what a composite polynomial is?

 

----------Thanks! laugh

 Mar 19, 2020

Best Answer 

 #1
avatar+23254 
+3

A composite polynominal p(x) can be decomposed into two or more polynomials; that is, there are

polynomials u(x) and v(x) for which p(x)  =  u( v(x) ).

 Mar 19, 2020
 #1
avatar+23254 
+3
Best Answer

A composite polynominal p(x) can be decomposed into two or more polynomials; that is, there are

polynomials u(x) and v(x) for which p(x)  =  u( v(x) ).

geno3141 Mar 19, 2020
 #2
avatar+288 
-1

Thanks for the definition, but can you prove it too?

madyl  Mar 19, 2020

1 Online Users

avatar