Maths Olympiad Prep

Library / Saudi Arabian Mathematical Competitions /308 of 395

Saudi Arabian Mathematical Competitions, 2015

Algebra Difficulty 6.5 National Olympiad Prove it Saudi Arabia

Prove that for any integer n≥2n \geq 2, there exists a unique finite sequence x0,x1,…,xnx_{0}, x_{1}, \ldots, x_{n} of real numbers which satisfies x0=xn=0x_{0}=x_{n}=0 and xi+1−8xi3−4xi+3xi−1+1=0x_{i+1}-8 x_{i}^{3}- 4 x_{i}+3 x_{i-1}+1=0 for all i=1,2,…,n−1i=1,2, \ldots, n-1. Prove moreover that ∣xi∣≤12\left|x_{i}\right| \leq \frac{1}{2} for all i=1,2,…,n−1i=1,2, \ldots, n-1.

Solution

Let P1(X)=XP_{1}(X)=X, P2(X)=8X3+4X−1P_{2}(X)=8 X^{3}+4 X-1 and define by induction Pk+1(X)P_{k+1}(X) by Pk+1(X)=8Pk(X)3+4Pk(X)−3Pk−1(X)−1P_{k+1}(X)=8 P_{k}(X)^{3}+4 P_{k}(X)-3 P_{k-1}(X)-1 for all integer k≥2k \geq 2. Clearly, Pk(X)P_{k}(X) is a polynomial of odd degree for all k≥1k \geq 1.

Let n≥2n \geq 2 be an integer and aa a real zero of the polynomial Pn(X)P_{n}(X). The real aa exists since the degree of Pn(X)P_{n}(X) is odd.

Consider the finite sequence x0,x1,…,xnx_{0}, x_{1}, \ldots, x_{n} of real numbers defined by x0=0x_{0}=0, x1=ax_{1}=a and xi+1=8xi3+4xi−3xi−1−1x_{i+1}=8 x_{i}^{3}+4 x_{i}-3 x_{i-1}-1, for all 1≤i≤n−11 \leq i \leq n-1. Clearly, x1=P1(a)x_{1}=P_{1}(a) and x2=P2(a)x_{2}=P_{2}(a). Assume that for 2≤k≤n−12 \leq k \leq n-1, xk−1=Pk−1(a)x_{k-1}=P_{k-1}(a) and xk=Pk(a)x_{k}=P_{k}(a). We have

xk+1=8xk3+4xk−3xk−1−1=8Pk(a)3+4Pk(a)−3Pk−1(a)−1=Pk+1(a)x_{k+1}=8 x_{k}^{3}+4 x_{k}-3 x_{k-1}-1=8 P_{k}(a)^{3}+4 P_{k}(a)-3 P_{k-1}(a)-1=P_{k+1}(a).

This proves that xk=Pk(a)x_{k}=P_{k}(a) for all 1≤k≤n1 \leq k \leq n and in particular xn=Pn(a)=0x_{n}= P_{n}(a)=0. This proves the existence of the sequence x0,x1,…,xnx_{0}, x_{1}, \ldots, x_{n} satisfying x0=xn=0x_{0}=x_{n}=0 and xi+1−8xi3−4xi+3xi−1+1=0x_{i+1}-8 x_{i}^{3}-4 x_{i}+3 x_{i-1}+1=0 for all i=1,2,…,n−1i=1,2, \ldots, n-1.

Conversely, if such a sequence x0,x1,…,xnx_{0}, x_{1}, \ldots, x_{n} exists then x1x_{1} is a real zero of the polynomial Pn(X)P_{n}(X). Therefore, proving the uniqueness of the sequence is equivalent to proving that Pn(X)P_{n}(X) has a unique real zero.

Let x,yx, y be two real numbers. We have ∣P2(x)−P2(y)∣=4∣x−y∣∣2(x2+xy+y2)+1∣≥∣x−y∣=∣P1(x)−P1(y)∣\left|P_{2}(x)-P_{2}(y)\right|=4|x-y|\left|2\left(x^{2}+x y+y^{2}\right)+1\right| \geq |x-y|=\left|P_{1}(x)-P_{1}(y)\right|, since x2+xy+y2≥0x^{2}+x y+y^{2} \geq 0. Assume that ∣Pk(x)−Pk(y)∣≥∣Pk−1(x)−Pk−1(y)∣\left|P_{k}(x)-P_{k}(y)\right| \geq \left|P_{k-1}(x)-P_{k-1}(y)\right|, for some integer k≥2k \geq 2. We have

∣Pk+1(x)−Pk+1(y)∣≥≥4∣Pk(x)−Pk(y)∣⋅∣2(Pk2(x)+Pk(x)Pk(y)+Pk2(y))+1∣−3∣Pk−1(x)−Pk−1(y)∣≥4∣Pk(x)−Pk(y)∣−3∣Pk−1(x)−Pk−1(y)∣≥∣Pk(x)−Pk(y)∣ \begin{gathered} \left|P_{k+1}(x)-P_{k+1}(y)\right| \geq \\ \geq 4\left|P_{k}(x)-P_{k}(y)\right| \cdot \left|2\left(P_{k}^{2}(x)+P_{k}(x) P_{k}(y)+P_{k}^{2}(y)\right)+1\right| \\ -3\left|P_{k-1}(x)-P_{k-1}(y)\right| \\ \geq 4\left|P_{k}(x)-P_{k}(y)\right|-3\left|P_{k-1}(x)-P_{k-1}(y)\right| \geq \left|P_{k}(x)-P_{k}(y)\right| \end{gathered}

Hence, the sequence (∣Pk(x)−Pk(y)∣)k≥1\left(\left|P_{k}(x)-P_{k}(y)\right|\right)_{k \geq 1} is non-decreasing and if x≠yx \neq y then Pk(x)≠Pk(y)P_{k}(x) \neq P_{k}(y) for all k≥1k \geq 1. We deduce that Pn(X)P_{n}(X) has a unique real zero, and therefore the sequence x0,x1,…,xnx_{0}, x_{1}, \ldots, x_{n} is unique.

Let c=max⁡{∣xi∣:1≤i≤n−1}c=\max \left\{\left|x_{i}\right|: 1 \leq i \leq n-1\right\}. There exists k∈{1,2,…,n−1}k \in \{1,2, \ldots, n-1\} such that c=∣xk∣c=\left|x_{k}\right|. Because xkx_{k} and xk3x_{k}^{3} have the same sign, it follows that

c+2c3=∣xk∣+2∣xk∣3=∣xk+2xk3∣=14∣1+xk+1+3xk−1∣≤14+14(∣xk+1∣+3∣xk−1∣)≤14+c, \begin{aligned} c+2 c^{3} & =\left|x_{k}\right|+2\left|x_{k}\right|^{3}=\left|x_{k}+2 x_{k}^{3}\right|=\frac{1}{4}\left|1+x_{k+1}+3 x_{k-1}\right| \\ & \leq \frac{1}{4}+\frac{1}{4}\left(\left|x_{k+1}\right|+3\left|x_{k-1}\right|\right) \leq \frac{1}{4}+c, \end{aligned}

which implies that c≤12c \leq \frac{1}{2}.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.