uniolympiads Ελληνικά

IMC 2012, Day 1, Problem 5

Let aa be a rational number and let nn be a positive integer. Prove that the polynomial X2n(X+a)2n+1X^{2^n}(X + a)^{2^n} + 1 is irreducible in the ring Q[X]\mathbb{Q}[X] of polynomials with rational coefficients.

Original from the official PDFLet a be a rational number and let n be a positive integer. Prove that the n n polynomial X 2 (X + a) 2 + 1 is irreducible in the ring Q[X] of polynomials with rational coefficients.

This transcription was compared symbol by symbol with the original, but not yet by a person.

Time on this problem 0:00

Work for at least 45 minutes before opening the solution.

Official solution

(Proposed by Vincent Jugé, École Polytechnique, Paris)

Solution. First let us consider the case a=0a=0. The roots of X2n+1+1X^{2^{n+1}}+1 are exactly all primitive roots of unity of order 2n+22^{n+2}, namely e2πik2n+2e^{2\pi i\frac{k}{2^{n+2}}} for odd k=1,3,5,…,2n+2−1k=1,3,5,\ldots,2^{n+2}-1. It is a cyclotomic polynomial, hence irreducible in Q[X]\mathbb{Q}[X].

Let now a≠0a\ne 0 and suppose that the polynomial in the question is reducible. Substituting X=Y−a2X=Y-\frac{a}{2} we get a polynomial (Y−a2)2n(Y+a2)2n+1=(Y2−a24)2n+1(Y-\frac{a}{2})^{2^n}(Y+\frac{a}{2})^{2^n}+1=(Y^2-\frac{a^2}{4})^{2^n}+1. It is again a cyclotomic polynomial in the variable Z=Y2−a24Z=Y^2-\frac{a^2}{4}, and therefore it is not divisible by any polynomial in Y2Y^2 with rational coefficients. Let us write this polynomial as the product of irreducible monic polynomials in YY with appropriate multiplicities, i.e.

(Y2−a24)2n+1=∏i=1rfi(Y)mifi  monic, irreducible, all different.\left(Y^2-\frac{a^2}{4}\right)^{2^n}+1=\prod_{i=1}^{r}f_i(Y)^{m_i}\qquad f_i\ \text{ monic, irreducible, all different.}
Since the left-hand side is a polynomial in Y2Y^2 we must have ∏ifi(Y)mi=∏ifi(−Y)mi\prod_i f_i(Y)^{m_i}=\prod_i f_i(-Y)^{m_i}. By the above argument non of the fif_i is a polynomial in Y2Y^2, i.e. fi(−Y)≠fi(Y)f_i(-Y)\ne f_i(Y). Therefore for every ii there is i′≠ii'\ne i such that fi(−Y)=±fi′(Y)f_i(-Y)=\pm f_{i'}(Y). In particular rr is even and irreducible factors fif_i split into pairs. Let us renumber them so that f1,…,fr2f_1,\ldots,f_{\frac{r}{2}} belong to different pairs and we have fi+r2(−Y)=±fi(Y)f_{i+\frac{r}{2}}(-Y)=\pm f_i(Y). Consider the polynomial f(Y)=∏i=1r/2fi(Y)mif(Y)=\prod_{i=1}^{r/2}f_i(Y)^{m_i}. This polynomial is monic of degree 2n2^n and (Y2−a24)2n+1=f(Y)f(−Y)(Y^2-\frac{a^2}{4})^{2^n}+1=f(Y)f(-Y). Let us write f(Y)=Y2n+⋯+bf(Y)=Y^{2^n}+\cdots+b where b∈Qb\in\mathbb{Q} is the constant term, i.e. b=f(0)b=f(0). Comparing constant terms we then get (a2)2n+1+1=b2\left(\frac{a}{2}\right)^{2^{n+1}}+1=b^2. Denote c=(a2)2n−1c=\left(\frac{a}{2}\right)^{2^{n-1}}. This is a nonzero rational number and we have c4+1=b2c^4+1=b^2.

It remains to show that there are no rational solutions c,b∈Qc,b\in\mathbb{Q} to the equation c4+1=b2c^4+1=b^2 with c≠0c\ne 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>0c,b>0. Write c=uvc=\frac{u}{v} with uu and vv coprime positive integers. Then u4+v4=(bv2)2u^4+v^4=(bv^2)^2. Let us denote w=bv2w=bv^2, this must be a positive integer too since u,vu,v are positive integers. Let us show that the set T={(u,v,w)∈N3∣u4+v4=w2 and u,v,w≥1}\mathcal{T}=\{(u,v,w)\in\mathbb{N}^3\mid u^4+v^4=w^2\text{ and }u,v,w\ge 1\} is empty. Suppose the contrary and consider some triple (u,v,w)∈T(u,v,w)\in\mathcal{T} such that ww is minimal. Without loss of generality, we may assume that uu is odd. (u2,v2,w)(u^2,v^2,w) is a primitive Pythagorean triple and thus there exist relatively prime integers d>e≥1d>e\ge 1 such that u2=d2−e2u^2=d^2-e^2, v2=2dev^2=2de and w=d2+e2w=d^2+e^2. In particular, considering the equation u2=d2−e2u^2=d^2-e^2 in Z/4Z\mathbb{Z}/4\mathbb{Z} proves that dd is odd and ee is even. Therefore, we can write d=f2d=f^2 and e=2g2e=2g^2. Moreover, since u2+e2=d2u^2+e^2=d^2, (u,e,d)(u,e,d) is also a primitive Pythagorean triple: there exist relatively prime integers h>i≥1h>i\ge 1 such that u=h2−i2u=h^2-i^2, e=2hi=2g2e=2hi=2g^2 and d=h2+i2d=h^2+i^2. Once again, we can write h=k2h=k^2 and i=l2i=l^2, so that we obtain the relation f2=d=h2+i2=k4+l4f^2=d=h^2+i^2=k^4+l^4 and (k,l,f)∈T(k,l,f)\in\mathcal{T}. Then, the inequality w>d2=f4≥fw>d^2=f^4\ge f contradicts the minimality of ww.

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+1P(X)=X^{2^n}(X+a)^{2^n}+1 and we will also need the cyclotomic polynomial T(X)=X2n+1T(X)=X^{2^n}+1. As we already said, when a=0a=0 then P(X)P(X) is itself cyclotomic and hence irreducible. Let now a≠0a\ne 0 and xx be any complex root of P(x)=0P(x)=0. Then ζ=x(x+a)\zeta=x(x+a) satisfies T(ζ)=0T(\zeta)=0, hence it is a primitive root of unity of order 2n+12^{n+1}. The field Q[x]\mathbb{Q}[x] is then an extension of Q[ζ]\mathbb{Q}[\zeta]. The latter field is cyclotomic and its degree over Q\mathbb{Q} is dim⁡Q(Q[ζ])=2n\dim_{\mathbb{Q}}\big(\mathbb{Q}[\zeta]\big)=2^n. Since the polynomial in the question has degree 2n+12^{n+1} we see that it is reducible if and only if the above mentioned extension is trivial, i.e. Q[x]=Q[ζ]\mathbb{Q}[x]=\mathbb{Q}[\zeta]. For the sake of contradiction we will now assume that this is indeed the case. Let S(X)S(X) be the minimal polynomial of xx over Q\mathbb{Q}. The degree of SS is then 2n2^n and we can number its roots by odd numbers in the set I={1,3,…,2n+1−1}I=\{1,3,\ldots,2^{n+1}-1\} so that S(X)=∏k∈I(X−xk)S(X)=\prod_{k\in I}(X-x_k) and xk(xk+a)=ζkx_k(x_k+a)=\zeta^k because Galois automorphisms of Q[ζ]\mathbb{Q}[\zeta] map ζ\zeta to ζk\zeta^k, k∈Ik\in 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) .S(X)S(-a-X)=\prod_{k\in I}(X-x_k)(-a-X-x_k)=(-1)^{|I|}\prod_{k\in I}\Big(X(X+a)-\zeta^k\Big)=T\big(X(X+a)\big)=P(X)\,.
In particular P(−a2)=S(−a2)2P(-\frac{a}{2})=S(-\frac{a}{2})^2, i.e. (a2)2n+1+1=((a2)2n+1)2\left(\frac{a}{2}\right)^{2^{n+1}}+1=\left(\left(\frac{a}{2}\right)^{2^n}+1\right)^2. Therefore the rational numbers c=(a2)2n−1≠0c=\left(\frac{a}{2}\right)^{2^{n-1}}\ne 0 and b=(a2)2n+1b=\left(\frac{a}{2}\right)^{2^n}+1 satisfy c4+1=b2c^4+1=b^2 which is a contradiction as it was shown in the first proof.

Remark 2. It is well-known that the Diophantine equation x4+y4=z2x^4+y^4=z^2 has only trivial solutions (i.e. with x=0x=0 or y=0y=0). This implies immediately that c4+1=b2c^4+1=b^2 has no rational solution with nonzero cc.

Transcribed from the official solutions, pages 3–4. This transcription has not been checked a second time; if in doubt, look at the original.

Archive problem: the statement is the official text (transcribed, with the original above). Subject classification and difficulty were estimated automatically; hints and a worked solution are added over time.

How did it go?