AlgebraDifficulty 5.8AIME, harderProve itUnited States
Problem: Let a0,a1,… and b0,b1,… be geometric sequences with common ratios ra and rb, respectively, such that i=0∑∞ai=i=0∑∞bi=1 and (i=0∑∞ai2)(i=0∑∞bi2)=i=0∑∞aibi. Find the smallest real number c such that a0<c must be true.
Solution
Solution: Answer: 34 Let a0=a and b0=b. From ∑i=0∞ai=1−raa0=1 we have a0=1−ra and similarly b0=1−rb. This means ∑i=0∞ai2=1−ra2a02=(1−ra)(1+ra)a2=a(2−a)a2=2−aa, so ∑i=0∞ai2∑i=0∞bi2=∑i=0∞aibi yields 2−aa⋅2−bb=1−(1−a)(1−b)ab. Since the numerators are equal, the denominators must be equal, which when expanded gives 2ab−3a−3b+4=0, which is equivalent to (2a−3)(2b−3)=1. But note that 0<a,b<2 since we need the sequences to converge (or ∣ra∣,∣rb∣<1), so then −3<2b−3<1, and thus 2a−3>1 (impossible) or 2a−3<−31. Hence a<34, with equality when b approaches 0.
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.