cmi-entrance 2010 Q2

cmi-entrance · India · ugmath 4 marks Proof Proof Involving Combinatorial or Number-Theoretic Structure
A polynomial $f ( x )$ has integer coefficients such that $f ( 0 )$ and $f ( 1 )$ are both odd numbers. Prove that $f ( x ) = 0$ has no integer solutions.
A polynomial $f ( x )$ has integer coefficients such that $f ( 0 )$ and $f ( 1 )$ are both odd numbers. Prove that $f ( x ) = 0$ has no integer solutions.