Maths Olympiad Prep

Library / /6 of 9

, 2013

Algebra Difficulty 7.4 National olympiad, round 2 Prove it Japan

Let a1,a2,a_1, a_2, \dots be an infinite sequence of distinct non-zero real numbers for which ai+1ai+ai+1ai\frac{a_{i+1}}{a_i} + \frac{a_{i+1}}{a_i} takes the same value lying in between 0 and 2 for each i1i \ge 1. Express in terms of a1,a2,a3a_1, a_2, a_3 the smallest number cc satisfying the following condition:
Condition: For any pair of positive integers x,yx, y with x<yx < y,
axax+1+ax+1ax+2++ay1ayaxaycholds. \frac{a_x a_{x+1} + a_{x+1} a_{x+2} + \dots + a_{y-1} a_y}{a_x a_y} \le c \quad \text{holds.}

Solution

24(a2a1+a2a3)2 \boxed{\frac{2}{\sqrt{4 - \left(\frac{a_2}{a_1} + \frac{a_2}{a_3}\right)^2}}}

Fix a positive integer xx. Let for a positive integer yy greater than xx,
by=axax+1+ax+1ax+2++ay1ayaxay. b_y = \frac{a_x a_{x+1} + a_{x+1} a_{x+2} + \dots + a_{y-1} a_y}{a_x a_y}.
Then, we get
by+by+2=1ax(axax+1++ay1ayay+axax+1++ay+1ay+2ay+2)=1ax(axax+1++ay1ayay+axax+1++ayay+1ay+2+ay+1)=1ax(axax+1++ay1ayay+ayay+1+axax+1ay+2+axax+1++ayay+1ay+2)=1ax(1ay+1ay+2)(axax+1++ayay+1)=(ay+1ay+ayay+2)axax+1++ayay+1axay=(ay+1ay+ayay+2)by+1. \begin{aligned} b_y + b_{y+2} &= \frac{1}{a_x} \left( \frac{a_x a_{x+1} + \dots + a_{y-1} a_y}{a_y} + \frac{a_x a_{x+1} + \dots + a_{y+1} a_{y+2}}{a_{y+2}} \right) \\ &= \frac{1}{a_x} \left( \frac{a_x a_{x+1} + \dots + a_{y-1} a_y}{a_y} + \frac{a_x a_{x+1} + \dots + a_y a_{y+1}}{a_{y+2}} + a_{y+1} \right) \\ &= \frac{1}{a_x} \left( \frac{a_x a_{x+1} + \dots + a_{y-1} a_y}{a_y} + \frac{a_y a_{y+1} + a_x a_{x+1}}{a_{y+2}} + \frac{a_x a_{x+1} + \dots + a_y a_{y+1}}{a_{y+2}} \right) \\ &= \frac{1}{a_x} \left( \frac{1}{a_y} + \frac{1}{a_{y+2}} \right) (a_x a_{x+1} + \dots + a_y a_{y+1}) \\ &= \left( \frac{a_{y+1}}{a_y} + \frac{a_y}{a_{y+2}} \right) \frac{a_x a_{x+1} + \dots + a_y a_{y+1}}{a_x a_y} \\ &= \left( \frac{a_{y+1}}{a_y} + \frac{a_y}{a_{y+2}} \right) b_{y+1}. \end{aligned}
By assumption, ay+1ay+ay+1ay+2=(a2a1+a2a3)\frac{a_{y+1}}{a_y} + \frac{a_{y+1}}{a_{y+2}} = \left( \frac{a_2}{a_1} + \frac{a_2}{a_3} \right) is a constant bigger than 0 and less than 2, so we can write this constant as 2cosθ2 \cos \theta by using an angle θ\theta satisfying 0<θ<π20 < \theta < \frac{\pi}{2}. The identity we obtained above can be represented as
by+by+2=2cosθby+1. b_y + b_{y+2} = 2 \cos \theta \cdot b_{y+1}.
Also, by letting bx=0b_x = 0 and y=xy = x, we get bx+1=axax+1axax+1=1b_{x+1} = \frac{a_x a_{x+1}}{a_x a_{x+1}} = 1, and bx+2=2cosθb_{x+2} = 2 \cos \theta. Using the identity
sinθ+sin(n+2)θ=2cosθsin(n+1)θ, \sin \theta + \sin (n + 2)\theta = 2 \cos \theta \sin (n + 1)\theta,
we can prove by mathematical induction that bx+n=sinnθsinθb_{x+n} = \frac{\sin n\theta}{\sin \theta} holds for any non-negative integer nn. Consequently, to obtain the desired answer to the problem it suffices to find the smallest positive number cc which satisfies the inequality
sinnθsinθc \frac{\sin n\theta}{\sin \theta} \le c
for any n1n \ge 1.
Next, we show that if a positive constant cc satisfies c>sinnθsinθc > \frac{\sin n\theta}{\sin \theta} for any n1n \ge 1, then for any α\alpha satisfying 0<α<π20 < \alpha < \frac{\pi}{2}, we must have c>sinαsinθc > \frac{\sin \alpha}{\sin \theta}. To show this, let us choose a positive integer mm large enough so that 2πm<π2α\frac{2\pi}{m} < \pi - 2\alpha. Let for k=0,1,2,,mk = 0, 1, 2, \dots, m, ϕk\phi_k be the unique number lying in the interval [0,2π)[0, 2\pi) for which kθ=2πj+ϕkk\theta = 2\pi \cdot j + \phi_k is satisfied for some integer jj. Since there are m+1m+1 numbers ϕ0,ϕ1,,ϕm\phi_0, \phi_1, \dots, \phi_m, by the pigeon-hole principle, there exists at least one interval among mm disjoint intervals
[2π(i1)m,2πim)[\frac{2\pi(i-1)}{m}, \frac{2\pi i}{m}) (i=1,2,,mi = 1, 2, \dots, m), which contains two or more of these m+1m+1 numbers. Suppose for some p,qp, q with 0p<qm0 \le p < q \le m, ϕp\phi_p and ϕq\phi_q belong to the same interval. If ϕp=ϕq\phi_p = \phi_q holds, then we have qθpθ=2π(jj)q\theta - p\theta = 2\pi \cdot (j - j') for some pair of integers jj and jj', so (qp)θ(q-p)\theta is an integral multiple of 2π2\pi and we have
a1a2++aqpapq+1a1aqp+1=sin(qp)θsinθ=0, \frac{a_1 a_2 + \dots + a_{q-p} a_{p-q+1}}{a_1 a_{q-p+1}} = \frac{\sin(q-p)\theta}{\sin\theta} = 0,
a1a2++aqp+1aqp+2a1aqp+2=sin(qp+1)θsinθ=sinθsinθ=1. \frac{a_1 a_2 + \dots + a_{q-p+1} a_{q-p+2}}{a_1 a_{q-p+2}} = \frac{\sin(q-p+1)\theta}{\sin\theta} = \frac{\sin\theta}{\sin\theta} = 1.
From the first of these equations we get a1a2++aqpaqp+1=0a_1 a_2 + \dots + a_{q-p} a_{q-p+1} = 0, and substituting this into the second equation, we get aqp+1=a1a_{q-p+1} = a_1. But this contradicts the assumption that all the aja_j's are distinct. Therefore, we have ϕpϕq\phi_p \ne \phi_q, which implies that 0<ϕpϕq<2πm<π2α0 < |\phi_p - \phi_q| < \frac{2\pi}{m} < \pi - 2\alpha. Now if for any k1k \ge 1, we write k(qp)θ=2πs+ηkk(q-p)\theta = 2\pi s + \eta_k, where 0ηk<2π0 \le \eta_k < 2\pi and ss is some integer, then as kk increases by 1, ηk\eta_k changes by the amount ϕqϕp\phi_q - \phi_p. Therefore, there exists a positive integer kk so that ηk\eta_k belongs to the interval (α,πα)(\alpha, \pi - \alpha). For this kk we have sink(qp)θ=sin(2πs+ηk)=sinηk>sinα\sin k(q-p)\theta = \sin(2\pi s + \eta_k) = \sin \eta_k > \sin \alpha, and therefore, we get
csink(qp)θsinθ>sinαsinθ. c \ge \frac{\sin k(q-p)\theta}{\sin\theta} > \frac{\sin\alpha}{\sin\theta}.
Thus we conclude that c>sinαsinθc > \frac{\sin\alpha}{\sin\theta} holds for any α\alpha satisfying 0<α<π20 < \alpha < \frac{\pi}{2}. From this we can conclude also that c1sinθc \ge \frac{1}{\sin\theta} is satisfied. If we let c0=1sinθc_0 = \frac{1}{\sin\theta}, then sinnθsinθc0\frac{\sin n\theta}{\sin\theta} \le c_0 obviously holds.
From these considerations we conclude that the smallest constant cc which satisfies the requirement of the problem equals c0=1sinθ=11cos2θc_0 = \frac{1}{\sin\theta} = \frac{1}{\sqrt{1 - \cos^2\theta}}, and since 2cosθ=(a2a1+a2a3)2\cos\theta = (\frac{a_2}{a_1} + \frac{a_2}{a_3}), the desired answer for the problem is given by
24(a2a1+a2a3)2. \frac{2}{\sqrt{4 - \left(\frac{a_2}{a_1} + \frac{a_2}{a_3}\right)^2}}.

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

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.