proof of limit of nth root of n


In this entry, we present a self-contained, elementary proof of the fact that  limnn1/n=1. We begin by with inductive proofs of two integer inequalitiesMathworldPlanetmathreal numbers will not enter until the very end.

Lemma 1.

For all integers n greater than or equal to 5,

2n>n2
Proof.

We begin with a few easy observations. First, a bit of arithmetic:

25=32>25=52

Second, some algebraic manipulation of the inequality n>4:

n-1 >3
(n-1)2 >9
(n-1)2 >2
n2-2n+1 >2
2n2 >n2+2n+1
2n2 >(n+1)2

These observations provide us with the makings of an inductive proof. Suppose that 2n>n2 for some integer n5. Using the inequality we just showed,

2n+1=22n>2n2>(n+1)2.

Snce 25>52 and 2n>n2 implies that 2n+1>(n+1)2 when n5 we conclude that 2n>n2 dor all n5. ∎

Lemma 2.

For all integers n greater than or equal to 3,

nn+1>(n+1)n
Proof.

We begin by noting that

34=81>64=43.

Next, we make assume that

(n-1)n>n(n-1).

for some n. Multiplying both sides by n:

n(n-1)n>nn.

Multiplying both sides by (n+1)n and making use of the identity (n+1)(n-1)=n2-1,

n(n2-1)n>nn(n+1)n.

Since n2>n2-1, the left-hand side is less than n2n+1, hence

n2n+1>nn(n+1)n.

Canceling nn from both sides,

n(n+1)>(n+1)n.

Hence, by induction, n(n+1)>(n+1)n for all n3. ∎

Theorem 1.
limnn1/n=1
Proof.

Consider the subsequence where n is a power of 2. We then have

(2m)(1/2m)=2m/2m.

By lemma 1, m/2m<1/m when m5. Hence, (2m)1/2m<21/m. Since limm021/m=1, and (2m)1/2m)>1, we conclude by the squeeze rule that

limm0(2m)1/2m=1.

By lemma 2, the sequence {n1/n} is decreasing. It is clearly bounded from below by 1. Above, we exhibited a subsequence which tends towards 1. Thus it follows that

limnn1/n=1.

Title proof of limit of nth root of n
Canonical name ProofOfLimitOfNthRootOfN
Date of creation 2014-02-28 7:21:31
Last modified on 2014-02-28 7:21:31
Owner rspuzio (6075)
Last modified by rspuzio (6075)
Numerical id 19
Author rspuzio (6075)
Entry type Proof
Classification msc 30-00
Classification msc 12D99