Prove that $f(x)=(x^2+x)^{2^n}+1$ is irreducible. I've thought about using mod 2 or $\mathbb Z_2$, which results in $f(x)=x^{2^{n+1}}+x^{2^n}+1=(x^{2^n}+x^{2{n-1}}+1)(x^{2^n}-x^{2{n-1}}+1)$ I've also thought about using $\mathbb Z_4$, which results in $f(x)=x^{2^{n+1}}+2x^{3*2^{n-1}}+x^{2^n}+1$, for which I'm not sure how to proceed.
EDIT by Sil: This is a problem from Romanian IMO Team Selection Tests 1998.
Assume that $f(x)=(x^2+x)^{2^n}+1=g(x)h(x)$ is reducible. Then it must be reducible in $\mathbb{Z}_2$. Note $f_2(x)=(x^2+x+1)^{2^n}$ is the function in $\mathbb{Z}_2$, and $x^2+x+1$ is irreducible. Define $g_2(x), h_2(x)$ similarly, and since $\mathbb{Z}_2$ is a UFD, let's just set $g_2(x)=(x^2+x+1)^y$ and $h_2(x)=(x^2+x+1)^{2^n-y}$.
Let $g(x)=g_2(x)+2g_1(x)$, $h(x)=h_2(x)+2h_1(x)$. Let $r$ be a root of $x^2+x+1$. If $g,h$ are nonconstant, then $g_2(r)=h_2(r)=0$ From $g(x)h(x)=f(x)$, plugging $x=r$, we obtain $4g_1(r)h_1(r)=(r^2+r)^{2^n}+1=2$. Note that $g_1(r)h_1(r)=ar^2+br+c$ for some integers $a,b,c$ because $r^3=1, r^4=r, r^5=r^2$. Also $r^2+r+1=0$, so WLOG $c=0$. Note that $a(-\frac{1}{2}+\frac{\sqrt{3}i}{2})+b(-\frac{1}{2}-\frac{\sqrt{3}i}{2})$ is real, so $a=b$, but then $a=-\frac{1}{2}$ is an integer. Contradiction.