The sequences of real numbers {ai}i=1∞ and {bi}i=1∞ satisfy an+1=(an−1−1)(bn+1) and bn+1=anbn−1−1 for n≥2, with a1=a2=2015 and b1=b2=2013. Evaluate, with proof, the infinite sum ∑n=1∞bn(an+11−an+31).
A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.
Solution
First note that an and bn are weakly increasing and tend to infinity. In particular, an,bn∈/{0,−1,1} for all n. For n≥1, we have an+3=(an+1−1)(bn+2+1)=(an+1−1)(an+1bn), so an+3bn=an+1(an+1−1)1=an+1−11−an+11. Therefore, ∑n=1∞an+1bn−an+3bn=∑n=1∞an+1bn−(an+1−11−an+11)=∑n=1∞an+1bn+1−an+1−11. Furthermore, bn+1=an−1−1an+1 for n≥2. So the sum over n≥2 is ∑n=2∞(an−1−11−an+1−11)=limN→∞∑n=2N(an−1−11−an+1−11)=a1−11+a2−11−limN→∞(aN−11+aN+1−11)=a1−11+a2−11. Hence the final answer is (a2b1+1−a2−11)+(a1−11+a2−11). Cancelling the common terms and putting in our starting values, this equals 20152014+20141=1−20151+20141=1+2014⋅20151
Want a route through all this instead of an archive? The track
puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.
Source: Omni-MATH,
licensed Apache-2.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.