Maths Olympiad Prep

Library / HMMT November /640 of 672

HMMT November, 2018

Algebra Difficulty 5.8 AIME, harder Prove it United States

Problem:
Let a0,a1,…a_{0}, a_{1}, \ldots and b0,b1,…b_{0}, b_{1}, \ldots be geometric sequences with common ratios rar_{a} and rbr_{b}, respectively, such that
∑i=0∞ai=∑i=0∞bi=1 and (∑i=0∞ai2)(∑i=0∞bi2)=∑i=0∞aibi. \sum_{i=0}^{\infty} a_{i}=\sum_{i=0}^{\infty} b_{i}=1 \quad \text{ and } \quad\left(\sum_{i=0}^{\infty} a_{i}^{2}\right)\left(\sum_{i=0}^{\infty} b_{i}^{2}\right)=\sum_{i=0}^{\infty} a_{i} b_{i} .
Find the smallest real number cc such that a0<ca_{0}<c must be true.

Solution

Solution:
Answer: 43\frac{4}{3}
Let a0=aa_{0}=a and b0=bb_{0}=b. From ∑i=0∞ai=a01−ra=1\sum_{i=0}^{\infty} a_{i}=\frac{a_{0}}{1-r_{a}}=1 we have a0=1−raa_{0}=1-r_{a} and similarly b0=1−rbb_{0}=1-r_{b}. This means ∑i=0∞ai2=a021−ra2=a2(1−ra)(1+ra)=a2a(2−a)=a2−a\sum_{i=0}^{\infty} a_{i}^{2}=\frac{a_{0}^{2}}{1-r_{a}^{2}}=\frac{a^{2}}{\left(1-r_{a}\right)\left(1+r_{a}\right)}=\frac{a^{2}}{a(2-a)}=\frac{a}{2-a}, so ∑i=0∞ai2∑i=0∞bi2=∑i=0∞aibi\sum_{i=0}^{\infty} a_{i}^{2} \sum_{i=0}^{\infty} b_{i}^{2}=\sum_{i=0}^{\infty} a_{i} b_{i} yields
a2−a⋅b2−b=ab1−(1−a)(1−b). \frac{a}{2-a} \cdot \frac{b}{2-b}=\frac{a b}{1-(1-a)(1-b)} .
Since the numerators are equal, the denominators must be equal, which when expanded gives 2ab−3a−3b+4=02 a b-3 a-3 b+4=0, which is equivalent to (2a−3)(2b−3)=1(2 a-3)(2 b-3)=1. But note that 0<a,b<20<a, b<2 since we need the sequences to converge (or ∣ra∣,∣rb∣<1\left|r_{a}\right|,\left|r_{b}\right|<1), so then −3<2b−3<1-3<2 b-3<1, and thus 2a−3>12 a-3>1 (impossible) or 2a−3<−132 a-3<-\frac{1}{3}. Hence a<43a<\frac{4}{3}, with equality when bb approaches 00.

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: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.