A sequence converges to the real number if every open interval containing contains all the terms from some index on. We then write .
Equivalently: for every , there exists such that for all , .
Examples
Example 20.22
Let and . One checks by induction that for all (the inequality for is equivalent to ), then that is decreasing, since
Decreasing and bounded below, converges to some , which must satisfy , i.e. . Hence . This is Heron’s algorithm, already used by the Babylonians; its convergence is extremely fast ( already gives to eight decimal places).