(Proposed by Vincent Jugé, École Polytechnique, Paris)
Solution. First let us consider the case a=0. The roots of X2n+1+1 are exactly all primitive roots of unity of order 2n+2, namely e2πi2n+2k for odd k=1,3,5,…,2n+2−1. It is a cyclotomic polynomial, hence irreducible in Q[X].
Let now a=0 and suppose that the polynomial in the question is reducible. Substituting X=Y−2a we get a polynomial (Y−2a)2n(Y+2a)2n+1=(Y2−4a2)2n+1. It is again a cyclotomic polynomial in the variable Z=Y2−4a2, and therefore it is not divisible by any polynomial in Y2 with rational coefficients. Let us write this polynomial as the product of irreducible monic polynomials in Y with appropriate multiplicities, i.e.
(Y2−4a2)2n+1=i=1∏rfi(Y)mifi monic, irreducible, all different.
Since the left-hand side is a polynomial in
Y2 we must have
∏ifi(Y)mi=∏ifi(−Y)mi. By the above argument non of the
fi is a polynomial in
Y2, i.e.
fi(−Y)=fi(Y). Therefore for every
i there is
i′=i such that
fi(−Y)=±fi′(Y). In particular
r is even and irreducible factors
fi split into pairs. Let us renumber them so that
f1,…,f2r belong to different pairs and we have
fi+2r(−Y)=±fi(Y). Consider the polynomial
f(Y)=∏i=1r/2fi(Y)mi. This polynomial is monic of degree
2n and
(Y2−4a2)2n+1=f(Y)f(−Y). Let us write
f(Y)=Y2n+⋯+b where
b∈Q is the constant term, i.e.
b=f(0). Comparing constant terms we then get
(2a)2n+1+1=b2. Denote
c=(2a)2n−1. This is a nonzero rational number and we have
c4+1=b2.
It remains to show that there are no rational solutions c,b∈Q to the equation c4+1=b2 with c=0 which will contradict our assumption that the polynomial under consideration is reducible. Suppose there is a solution. Without loss of generality we can assume that c,b>0. Write c=vu with u and v coprime positive integers. Then u4+v4=(bv2)2. Let us denote w=bv2, this must be a positive integer too since u,v are positive integers. Let us show that the set T={(u,v,w)∈N3∣u4+v4=w2 and u,v,w≥1} is empty. Suppose the contrary and consider some triple (u,v,w)∈T such that w is minimal. Without loss of generality, we may assume that u is odd. (u2,v2,w) is a primitive Pythagorean triple and thus there exist relatively prime integers d>e≥1 such that u2=d2−e2, v2=2de and w=d2+e2. In particular, considering the equation u2=d2−e2 in Z/4Z proves that d is odd and e is even. Therefore, we can write d=f2 and e=2g2. Moreover, since u2+e2=d2, (u,e,d) is also a primitive Pythagorean triple: there exist relatively prime integers h>i≥1 such that u=h2−i2, e=2hi=2g2 and d=h2+i2. Once again, we can write h=k2 and i=l2, so that we obtain the relation f2=d=h2+i2=k4+l4 and (k,l,f)∈T. Then, the inequality w>d2=f4≥f contradicts the minimality of w.
Remark 1. One can also use Galois theory arguments in order to solve this question. Let us denote the polynomial in the question by P(X)=X2n(X+a)2n+1 and we will also need the cyclotomic polynomial T(X)=X2n+1. As we already said, when a=0 then P(X) is itself cyclotomic and hence irreducible. Let now a=0 and x be any complex root of P(x)=0. Then ζ=x(x+a) satisfies T(ζ)=0, hence it is a primitive root of unity of order 2n+1. The field Q[x] is then an extension of Q[ζ]. The latter field is cyclotomic and its degree over Q is dimQ(Q[ζ])=2n. Since the polynomial in the question has degree 2n+1 we see that it is reducible if and only if the above mentioned extension is trivial, i.e. Q[x]=Q[ζ]. For the sake of contradiction we will now assume that this is indeed the case. Let S(X) be the minimal polynomial of x over Q. The degree of S is then 2n and we can number its roots by odd numbers in the set I={1,3,…,2n+1−1} so that S(X)=∏k∈I(X−xk) and xk(xk+a)=ζk because Galois automorphisms of Q[ζ] map ζ to ζk, k∈I. Then one has
S(X)S(−a−X)=k∈I∏(X−xk)(−a−X−xk)=(−1)∣I∣k∈I∏(X(X+a)−ζk)=T(X(X+a))=P(X).
In particular
P(−2a)=S(−2a)2, i.e.
(2a)2n+1+1=((2a)2n+1)2. Therefore the rational numbers
c=(2a)2n−1=0 and
b=(2a)2n+1 satisfy
c4+1=b2 which is a contradiction as it was shown in the first proof.
Remark 2. It is well-known that the Diophantine equation x4+y4=z2 has only trivial solutions (i.e. with x=0 or y=0). This implies immediately that c4+1=b2 has no rational solution with nonzero c.
Μεταγραφή από το επίσημο κείμενο λύσεων, σελίδες 3–4. Η μεταγραφή δεν έχει ελεγχθεί δεύτερη φορά· αν έχεις αμφιβολία, κοίτα το πρωτότυπο.