Maths WorkshopMaths problems with full solutions
Exercise 1297Algebra › Equations and radicalsOlympiadAdded 5 Nov 2026

How fast does a_{n+1} = a_n + 1/a_n grow?

#sequences#growth#squaring trick#estimates

Statement

Let a1=1a_1=1 and an+1=an+1ana_{n+1}=a_n+\dfrac1{a_n}.

  1. Prove that 2n−1≤an2≤2n+ln⁡n2n-1\le a_n^2\le2n+\ln n for all n≥1n\ge1.
  2. Deduce that an2n→1\dfrac{a_n}{\sqrt{2n}}\to1.
  3. Show that 14<a100<1514<a_{100}<15.
Hint

Square the recurrence: an+12=an2+2+1an2a_{n+1}^2=a_n^2+2+\frac1{a_n^2}.

Show solutionHide solution

Solution

Squaring. an+12=an2+2+1an2a_{n+1}^2=a_n^2+2+\dfrac1{a_n^2}. All an≥1>0a_n\ge1>0.

Lower bound. Since 1an2>0\frac1{a_n^2}>0, an+12>an2+2a_{n+1}^2>a_n^2+2, so an2≥a12+2(n−1)=2n−1a_n^2\ge a_1^2+2(n-1)=2n-1.

Upper bound. Summing the squared recurrence from 11 to n−1n-1,
an2=1+2(n−1)+∑k=1n−11ak2≤2n−1+∑k=1n−112k−1,a_n^2=1+2(n-1)+\sum_{k=1}^{n-1}\frac1{a_k^2}\le2n-1+\sum_{k=1}^{n-1}\frac1{2k-1},
using ak2≥2k−1a_k^2\ge2k-1. Since 12k−1≤1k\frac1{2k-1}\le\frac1k for k≥1k\ge1, the last sum is at most Hn−1≤1+ln⁡(n−1)H_{n-1}\le1+\ln(n-1) for n≥2n\ge2. Thus
an2≤2n−1+1+ln⁡n=2n+ln⁡n.a_n^2\le2n-1+1+\ln n=2n+\ln n.

2. Dividing by 2n2n: 1−12n≤an22n≤1+ln⁡n2n1-\frac1{2n}\le\frac{a_n^2}{2n}\le1+\frac{\ln n}{2n}, and both bounds tend to 11. Hence an2n→1\frac{a_n}{\sqrt{2n}}\to1.

3. a1002≥199>196=142a_{100}^2\ge199>196=14^2 and a1002≤200+ln⁡100<205<225=152a_{100}^2\le200+\ln100<205<225=15^2. So 14<a100<1514<a_{100}<15.

Lesson. For a recurrence an+1=an+εna_{n+1}=a_n+\varepsilon_n with small increments, look at an2a_n^2 so that the main term becomes linear.