1

Polynomial $x^{p^n} + 1$, $p$ is prime and odd, is irreducible in $\mathbb Q[x]$

I can't use Eisenstein's criterion because $1|a_n$ , $a_n=1$.

Since $p$ is odd, $p^n$ is odd too, so $-1$ is zero of $x^{p^n} + 1$ Hence, $$x^{p^n} + 1 = (x+1) ( x^{p^{n-1}} - x^{p^{n-2}} + x^{p^{n-3}} + \dots + x^{p} +1)$$ I don't know how use the fact about $p$ being prime.

andre
  • 101

1 Answers1

1

You've shown that $x+1$ is a factor of $x^{p^n}+1$; thus, $x^{p^n}+1$ is reducible.

robjohn
  • 345,667
  • yes, but i dont understand why p need be prime if x+1|$x^{p^n}$+1 when p is odd and p dont need be necessarily prime. – andre Oct 22 '13 at 18:13
  • @andre: You don't. The only thing you need is that $p$ is odd and greater than $1$ (and $n\gt0$). – robjohn Oct 22 '13 at 18:40