Maths Olympiad Prep

Library / /1378 of 1394

, 2015

Algebra Difficulty 6.3 National Olympiad Prove it United States

Problem:

Suppose (a1,a2,a3,a4)(a_{1}, a_{2}, a_{3}, a_{4}) is a 4-term sequence of real numbers satisfying the following two conditions:
- a3=a2+a1a_{3} = a_{2} + a_{1} and a4=a3+a2a_{4} = a_{3} + a_{2};
- there exist real numbers a,b,ca, b, c such that
an2+bn+c=cos(an) a n^{2} + b n + c = \cos(a_{n})
for all n{1,2,3,4}n \in \{1,2,3,4\}.
Compute the maximum possible value of
cos(a1)cos(a4) \cos(a_{1}) - \cos(a_{4})
over all such sequences (a1,a2,a3,a4)(a_{1}, a_{2}, a_{3}, a_{4}).

Solution

Solution:

Answer: 9+313-9 + 3 \sqrt{13}

Let f(n)=cosanf(n) = \cos a_{n} and m=1m = 1. The second ("quadratic interpolation") condition on f(m),f(m+1),f(m+2),f(m+3)f(m), f(m+1), f(m+2), f(m+3) is equivalent to having a vanishing third finite difference
f(m+3)3f(m+2)+3f(m+1)f(m)=0 f(m+3) - 3 f(m+2) + 3 f(m+1) - f(m) = 0
This is equivalent to
f(m+3)f(m)=3[f(m+2)f(m+1)]cos(am+3)cos(am)=3(cos(am+2)cos(am+1))=6sin(am+2+am+12)sin(am+2am+12)=6sin(am+32)sin(am2). \begin{aligned} f(m+3) - f(m) &= 3 [f(m+2) - f(m+1)] \\ \Longleftrightarrow \cos(a_{m+3}) - \cos(a_{m}) &= 3 (\cos(a_{m+2}) - \cos(a_{m+1})) \\ &= -6 \sin\left(\frac{a_{m+2} + a_{m+1}}{2}\right) \sin\left(\frac{a_{m+2} - a_{m+1}}{2}\right) \\ &= -6 \sin\left(\frac{a_{m+3}}{2}\right) \sin\left(\frac{a_{m}}{2}\right) . \end{aligned}
Set x=sin(am+32)x = \sin\left(\frac{a_{m+3}}{2}\right) and y=sin(am2)y = \sin\left(\frac{a_{m}}{2}\right). Then the above rearranges to
(12x2)(12y2)=6xyx2y2=3xy (1 - 2x^{2}) - (1 - 2y^{2}) = -6 x y \Longleftrightarrow x^{2} - y^{2} = 3 x y
Solving gives y=x3±132y = x \frac{-3 \pm \sqrt{13}}{2}. The expression we are trying to maximize is 2(x2y2)=6xy2(x^{2} - y^{2}) = 6 x y, so we want x,yx, y to have the same sign; thus y=x3+132y = x \frac{-3 + \sqrt{13}}{2}.
Then yx|y| \leq |x|, so since x,y1|x|, |y| \leq 1, to maximize 6xy6 x y we can simply set x=1x = 1, for a maximal value of 63+132=9+3136 \cdot \frac{-3 + \sqrt{13}}{2} = -9 + 3 \sqrt{13}.

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 reproduced verbatim; metadata (topic, difficulty) added by this project.