Maths Olympiad Prep

Library / Saudi Arabian Mathematical Competitions /253 of 395

Saudi Arabian Mathematical Competitions

Algebra Difficulty 6.0 National Olympiad Prove it Saudi Arabia

Let fn=22n+1f_{n} = 2^{2^{n}} + 1, n=1,2,3,…n = 1, 2, 3, \ldots, be the Fermat's numbers. Find the least real number CC such that
1f1+2f2+22f3+…+2n−1fn<C \frac{1}{f_{1}} + \frac{2}{f_{2}} + \frac{2^{2}}{f_{3}} + \ldots + \frac{2^{n-1}}{f_{n}} < C
for all positive integers nn.

Solution

We have for k=1,2,…k = 1, 2, \ldots
22k+1−1=(22k)2−1=(22k−1)(22k+1), 2^{2^{k+1}} - 1 = \left(2^{2^{k}}\right)^{2} - 1 = \left(2^{2^{k}} - 1\right)\left(2^{2^{k}} + 1\right),
hence we get
122k+1−1=12(122k−1−122k+1) \frac{1}{2^{2^{k+1}} - 1} = \frac{1}{2} \left( \frac{1}{2^{2^{k}} - 1} - \frac{1}{2^{2^{k}} + 1} \right)
It follows
1fk=1xk−2xk+1,k=1,2,… \begin{equation*} \frac{1}{f_{k}} = \frac{1}{x_{k}} - \frac{2}{x_{k+1}}, \quad k = 1, 2, \ldots \tag{1} \end{equation*}
where xk=22k−1x_{k} = 2^{2^{k}} - 1. From (1) we get for n=1,2,…n = 1, 2, \ldots
1f1+2f2+22f3+…+2n−1fn=1x1−2nxn+1=13−2nxn+1 \begin{equation*} \frac{1}{f_{1}} + \frac{2}{f_{2}} + \frac{2^{2}}{f_{3}} + \ldots + \frac{2^{n-1}}{f_{n}} = \frac{1}{x_{1}} - \frac{2^{n}}{x_{n+1}} = \frac{1}{3} - \frac{2^{n}}{x_{n+1}} \tag{2} \end{equation*}
From (2) it follows
1f1+2f2+22f3+…+2n−1fn<13 \frac{1}{f_{1}} + \frac{2}{f_{2}} + \frac{2^{2}}{f_{3}} + \ldots + \frac{2^{n-1}}{f_{n}} < \frac{1}{3}
for all positive integers nn. Since
lim⁡n→∞2nxn+1=lim⁡n→∞2n22n+1−1=lim⁡t→∞t22t−1=0 \lim_{n \rightarrow \infty} \frac{2^{n}}{x_{n+1}} = \lim_{n \rightarrow \infty} \frac{2^{n}}{2^{2^{n+1}} - 1} = \lim_{t \rightarrow \infty} \frac{t}{2^{2t} - 1} = 0
we obtain that the least real number CC with the desired property is C=13C = \frac{1}{3}.

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.