Consider a complex number z, z=0 and the real sequence an=zn+zn1,n≥1. a) Show that if a1>2, then an+1<2an+an+2, for all n∈N∗. b) Prove that if there exists k∈N∗ such that ak≤2, then a1≤2.
Solution
a) We easily notice that 2∣zn+1+zn+11∣<∣z+z1∣⋅∣zn+1+zn+11∣=∣zn+zn1+zn+2+zn+21∣≤∣zn+zn1∣+∣zn+2+zn+21∣.
Alternative Solution. Consider the sequence (αn)n≥1 given by αn=zn+zn1. Extend to the left with the term α0=z0+z01=2, and denote α=α1. Clearly an=∣αn∣. We have ααn=(z+z1)(zn+zn1)=(zn+1+zn+11)+(zn−1+zn−11)=αn+1+αn−1 for all n≥1, so the sequence (αn)n≥0 satisfies the linear recurrence relation αn+1=ααn−αn−1. Then for ∣α∣>2 we have an=∣αn∣=ααn+1+αn−1≤∣α∣∣αn+1∣+∣αn−1∣<2an+1+an−1, i.e. the sequence (an)n≥0 is convex. But then, if a1=∣α∣>2=a0, any convex sequence is (strictly) increasing, since from an>an−1 follows an+1>2an−an−1=an+(an−an−1)>an, and the thesis is proved by simple induction. Conversely, if there exists k∈N∗ such that ak≤2, then a1≤2. Therefore the proof for b) comes directly from a), and the nature of the sequence is not anymore relevant.
b) a2=∣z2+z21∣=(z+z1)2−2≥(z+z1)2−2=a12−2>a1, therefore the sequence (an)n is strictly increasing, hence ak≥a1>2 for all k, a contradiction.
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.