2
$\begingroup$

I can't figure it out. Can you give me some advice? Let $f$ be a polynomial in $\mathbb{Z}[X]$ of degree at least 1. Prove that $f(n)$ cannot be a prime for each $n \in \mathbb{Z}$. I tried induction on the degree, but that didn't work. What can I do now?

1 Answers 1

9

Suppose $f(n)$ is a prime for every integer $n$. In particular, $f(0)=p$ for some prime $p$, and so the constant term of $f$ is $p$. Now consider $f(kp)$ for $k$ an integer. $f(kp)$ must be divisible by $p$, but must also be a prime, so we must have $f(kp)=p$ for every $k$. But then $f$ takes the value $p$ infinitely many times, so must be the constant polynomial $p$.

  • 0
    Thanks!! I was thinking way too hard :p.2012-10-15
  • 1
    One thing I don't get is why it should be a constant.2012-10-15
  • 0
    @Kevin - If $f$ takes a vaule $a$ infinitely many times then $f-a$ takes the value $0$ infinitely many times. But this contradicts the fundamental theorem of algebra2012-10-15
  • 0
    Ok, so, if I get it: suppose $g(k)=f(k \cdot a)-a$, then $deg(g)=deg(f)$, but $g(k)=0 \forall k \in \mathbb{Z}$, zo $g(k)=...(x+2)(x+1)(x)(x-1)(x-2)... \Rightarrow deg(g)=\infty$?2012-10-15
  • 0
    @Belgi Every nonzero polynomial with coefficients in a ring R has no more roots than its degree iff R is an *integral domain* (i.e. $\rm\:ab = 0\:\Rightarrow\: a=0\ \ or\ \ b=0).\:$ Conceptually, this has little to do with the fundamental theorem of algebra.2012-10-15