
Re: Is x^n + (x+2)^n irreducible over Q if n is a power of 2?
Posted:
Sep 11, 2006 9:04 PM


> One can prove it using Eisenstein, however, and that's probably the > best way.
I still prefer Peter's solution since it can be modified to show that if r is any nonzero rational number and n is any power of 2 then p(x) = x^n + (x+r)^n
is irreducible over Q.
Can that be done with Eisenstein's Criterion? :)
Anyhow, thanks to all who responded.
Edwin

