Type a command or search the notes. Tab cycles completions. Up and down recall history when blank. Escape dismisses, then leaves the prompt.
MATH
[1251]

Examples from Sequences and limits

All examples from Sequences and limits.

Back to Sequences and limits

Proving 2+1n+1→22+\frac1{n+1}\to2

Let an=2+1n+1a_n=2+\frac1{n+1}. Given ε>0\varepsilon>0, choose an integer NN with N>1/εN>1/\varepsilon. If n>Nn>N, then

∣an−2∣=1n+1<1N<ε.|a_n-2| =\frac1{n+1} <\frac1N <\varepsilon.

Rationalising a square root

For

n2+3n−n,\sqrt{n^2+3n}-n,

multiply by the conjugate:

n2+3n−n=(n2+3n)−n2n2+3n+n=31+3/n+1⟶32.\begin{aligned} \sqrt{n^2+3n}-n &=\frac{(n^2+3n)-n^2}{\sqrt{n^2+3n}+n}\\ &=\frac{3}{\sqrt{1+3/n}+1} \longrightarrow\frac32. \end{aligned}

Logarithmic, root and geometric limits

For every α>0\alpha>0,

ln⁡nnα⟶0.\frac{\ln n}{n^\alpha}\longrightarrow0.

L'Hôpital's rule applied to ln⁡x/xα\ln x/x^\alpha gives

(1/x)αxα−1=1αxα⟶0.\frac{(1/x)}{\alpha x^{\alpha-1}} =\frac1{\alpha x^\alpha}\longrightarrow0.

For fixed x>0x>0,

x1/n=e(ln⁡x)/n⟶1,n1/n=e(ln⁡n)/n⟶1.x^{1/n}=e^{(\ln x)/n}\longrightarrow1, \qquad n^{1/n}=e^{(\ln n)/n}\longrightarrow1.

For 0<x<10<x<1, geometric decay gives xn→0x^n\to0. Finally,

(1+1n)n⟶e.\left(1+\frac1n\right)^n\longrightarrow e.

Taking logarithms,

nln⁡(1+1n)=ln⁡(1+1/n)1/n⟶1,n\ln\left(1+\frac1n\right) =\frac{\ln(1+1/n)}{1/n} \longrightarrow1,

and exponentiating gives the result.

A factorial sequence

For

0<n!nn=∏k=1nkn,0<\frac{n!}{n^n} =\prod_{k=1}^{n}\frac{k}{n},

at least ⌊n/2⌋\lfloor n/2\rfloor factors are at most 1/21/2. Therefore

0<n!nn≤(12)⌊n/2⌋⟶0.0<\frac{n!}{n^n} \le\left(\frac12\right)^{\lfloor n/2\rfloor} \longrightarrow0.

The rough hierarchy

1,ln⁡n,np,cn,n!,nn1,\quad \ln n,\quad n^p,\quad c^n,\quad n!,\quad n^n

for fixed p>0p>0 and c>1c>1 helps choose comparisons, but it is not itself a proof of a limit.

Two monotone sequences

The sequence

an=nn+1a_n=\frac n{n+1}

is increasing and bounded above by 11, so it converges. Its limit is 11.

For

bn=2nn!,b_n=\frac{2^n}{n!},

we have

bn+1bn=2n+1<1\frac{b_{n+1}}{b_n}=\frac2{n+1}<1

once n≥2n\ge2. It is eventually decreasing and bounded below by 00, so it converges. Its limit is 00, because the ratio is at most 1/21/2 for n≥3n\ge3, so bn≤b3(1/2)n−3b_n\le b_3(1/2)^{n-3} for all later terms.

A recursively defined sequence

Let

a1=4,an+1=1+3an.a_1=4,\qquad a_{n+1}=\sqrt{1+3a_n}.

The positive solution of the fixed-point equation L2=1+3LL^2=1+3L is

α=3+132.\alpha=\frac{3+\sqrt{13}}2.

Since a1=4≥αa_1=4\ge\alpha and since

an≥α⟹1+3an≥1+3α=α2,a_n\ge\alpha\quad\Longrightarrow\quad 1+3a_n\ge1+3\alpha=\alpha^2,

the recursion gives an+1=1+3an≥αa_{n+1}=\sqrt{1+3a_n}\ge\alpha. Induction therefore gives an≥αa_n\ge\alpha for every nn. For an≥αa_n\ge\alpha,

an+1≤an⟺1+3an≤an2,a_{n+1}\le a_n \quad\Longleftrightarrow\quad 1+3a_n\le a_n^2,

and the latter holds because an2−3an−1≥0a_n^2-3a_n-1\ge0 for an≥αa_n\ge\alpha. Thus {an}\{a_n\} is decreasing and bounded below by α\alpha, so it converges.

If an→La_n\to L, continuity of the square-root function gives

L=1+3L.L=\sqrt{1+3L}.

The sequence is positive, so the compatible root is

lim⁡n→∞an=3+132.{\lim_{n\to\infty}a_n=\frac{3+\sqrt{13}}2.}

On this page