TITLE: If $X^n+Y^n+1$ is reducible, is the degree divisible by the characteristic?
QUESTION [7 upvotes]: I was playing around with the Frobenius map, and made a small observation. 
Suppose $F$ is a field, and $F[X,Y]$ is the corresponding polynomial ring in two indeterminates. If $\text{char}(F)=p$ divides some integer $n$, then $n=pq$ for some $q$. Consider the polynomial $X^n+Y^n+1$. Then
$$
X^n+Y^n+1=X^{pq}+Y^{pq}+1^{pq}=(X^q+Y^q+1^q)^p
$$
so $X^n+Y^n+1$ is reducible. I hope this observation is correct.
Does the converse also hold? That is, if $X^n+Y^n+1$ is reducible, can you conclude that $\text{char}(F)$ divides $n$? I tried finding some factorization, and I think it should look something like $(X^r+\text{stuff}+1)$ and $(X^s+\text{stuff}+1)$ where $r+s=n$, but couldn't actually find an explicit factorization.

REPLY [11 votes]: I will show that if the characteristic, say $p$, of the field does not divide $n$ then $X^n + Y^n + 1$ is irreducible in $F[X,Y]$. In $F[Y]$ the polynomial $Y^n + 1$ is separable and of course not constant. Let $\pi(Y)$ be an irreducible factor of $Y^n+1$ in $F[Y]$. Then in the ring $F[X,Y] = F[Y][X]$, we consider the polynomial $X^n + Y^n + 1$ as a polynomial in $X$ with coefficients in $F[Y]$ and see that it is Eisenstein with respect to $\pi(Y)$. Therefore by the Eisenstein irreducibility criterion (applied to the PID $F[Y]$, not ${\mathbf Z}$) our polynomial in irreducible in $F[Y][X] = F[X,Y]$.
I like to use this kind of example in some courses for $X^n + Y^n - 1$ instead, since then $Y-1$ is a visible linear factor of $Y^n - 1$ and one can say directly (without the abstract choice of $\pi(Y)$) that $X^n + Y^n - 1$ is Eisenstein with respect to $Y-1$ when $p$ doesn't divide $n$ so it is irreducible in $F[Y][X] = F[X,Y]$. This makes (some) students get a new appreciation for the scope of the Eisenstein irreducibility criterion.