AlgebraDifficulty 5.4AIME, harderProve itUnited States
Problem: Let a>2 be given, and define a sequence a0,a1,a2,… by a0=1,a1=a,an+1=(an−12an2−2)⋅an. Show that for all integers k≥0, we have i=0∑kai1<2a+2−a2−4.
Solution
Solution: Write the recursion as anan+1=(an−1an)2−2 Let bn=an+1/an; then bn=bn−12−2 and b0=a. Let t=2a+a2−4 Then a=t+1/t and it is a simple induction to show that bn=t2n+t−2n for n≥0. Then an=a0b0b1⋯bn−1=i=0∏n−1(t2i+t−2i)=i=0∏n−1t2i−t−2it2i+1−t−2i+1=t−t−1t2n−t−2n So i=0∑kai1=(t−t−1)i=0∑kt2i−t−2i1=(t−t−1)i=0∑kt2i+1−1t2i+1−1=(t−t−1)i=0∑k(ti−11−t2i+1−11)=(t−t−1)(t−11−t2k+1−11)<(t−t−1)(t−11)=1+t1=2a+2−a2−4.
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.