For which $n$ the polynomial $x^n + y^n$ will be irreducible over $\mathbb Z$?
I think when n is multiple of 2. Can you please correct me if I am wrong and explain why.
For which $n$ the polynomial $x^n + y^n$ will be irreducible over $\mathbb Z$?
I think when n is multiple of 2. Can you please correct me if I am wrong and explain why.
Note that if m is odd, then $x^m+y^m$ is divisible by $x+y$. Thus for $n=2^r⋅m$, where $m>1$ is odd, it follows that $x^n+y^n=(x^{2^r})^m+(y^{2^r})^m$ is divisible by $x^{2^r}+y^{2^r}.$
On the other hand, polynomials of type $x^{2^r}+y^{2^r}$ are always irreducible over $\mathbb{Q}$. Note that any factorization of $f(x,y)=x^{2^r}+y^{2^r}$ will give us a factorization of $f(x,1)=x^{2^r}+1$. So it suffices to show that $x^{2^r}+1$ is irreducible. Recall that cyclotomic polynomials $$\Phi_{n}(x)=\prod_{\substack{1\leq k\leq n \\ (n,k)=1}} (x-e^{2\pi ik/n})$$ are irreducible over $\mathbb{Q}$. Now since
$$\Phi_{2^{r+1}}(x)=x^{2^r}+1,$$ the claim follows.