Maths Olympiad Prep

Library / /413 of 520

Algebra Difficulty 5.7 AIME, harder Prove it

{a1=12,an=13n1(a1an1+a2un2++an2a2+an1a1). \left\{\begin{aligned} a_{1}= & \frac{1}{2}, \\ a_{n}= & \frac{1}{3 n-1}\left(a_{1} a_{n-1}+a_{2} u_{n \cdots 2}\right. \\ & \left.+\cdots+a_{n-2} a_{2}+a_{n-1} a_{1}\right) . \end{aligned}\right.

Prove: an+1<ana_{n+1}<a_{n}.

Solution

Second, the second mathematical induction for electricity.
a2=15a12=110a1<a1,a3=28a1a2=18a2<a2. a_{2}=\frac{1}{5} a_{1}^{2}=\frac{1}{10} a_{1}<a_{1}, a_{3}=\frac{2}{8} a_{1} a_{2}=\frac{1}{8} a_{2}<a_{2} .

Assume ak<ak1<<a3<a2<a1a_{k}<a_{k-1}<\cdots<a_{3}<a_{2}<a_{1}, then for n=k+1n=k+1,
ak+1=13k+2(a1ak+a2ak1++ak2a3+ak1a2+aka1)=a1ak+a2ak1++ak2a3+ak1a23k+2+a1ak3k+2a1ak1+a2ak2++ak2a2+ak1a13k+2+ak2(3k+2)=3k13k+2a1ak1++ak1a13k1+ak2(3k+2)=3k13k+2ak+ak2(3k+2)=6k12(3k+2)ak<ak. \begin{aligned} a_{k+1}= & \frac{1}{3 k+2}\left(a_{1} a_{k}+a_{2} a_{k-1}+\cdots+a_{k-2} a_{3}+a_{k-1} a_{2}\right. \\ & \left.+a_{k} a_{1}\right) \\ = & \frac{a_{1} a_{k}+a_{2} a_{k-1}+\cdots+a_{k-2} a_{3}+a_{k-1} a_{2}}{3 k+2} \\ & +\frac{a_{1} a_{k}}{3 k+2} \\ \leqslant & \frac{a_{1} a_{k-1}+a_{2} a_{k-2}+\cdots+a_{k-2} a_{2}+a_{k-1} a_{1}}{3 k+2} \\ & +\frac{a_{k}}{2(3 k+2)} \\ = & \frac{3 k-1}{3 k+2} \cdot \frac{a_{1} a_{k-1}+\cdots+a_{k-1} a_{1}}{3 k-1}+\frac{a_{k}}{2(3 k+2)} \\ = & \frac{3 k-1}{3 k+2} a_{k}+\frac{a_{k}}{2(3 k+2)} \\ = & \frac{6 k-1}{2(3 k+2)} a_{k}<a_{k} . \end{aligned}

This shows that the proposition holds for n=k+1n=k+1. By mathematical induction, the sequence is monotonic, and it can also be proven that an12a_{n} \leqslant \frac{1}{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: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.