proof of limit of nth root of n
In this entry, we present a self-contained, elementary proof of the fact that . We begin by with inductive proofs of two integer inequalities — real numbers will not enter until the very end.
Lemma 1.
For all integers greater than or equal to ,
Proof.
We begin with a few easy observations. First, a bit of arithmetic:
Second, some algebraic manipulation of the inequality :
These observations provide us with the makings of an inductive proof. Suppose that for some integer . Using the inequality we just showed,
Snce and implies that when we conclude that dor all . ∎
Lemma 2.
For all integers greater than or equal to ,
Proof.
We begin by noting that
Next, we make assume that
for some . Multiplying both sides by :
Multiplying both sides by and making use of the identity ,
Since , the left-hand side is less than , hence
Canceling from both sides,
Hence, by induction, for all . ∎
Theorem 1.
Proof.
Consider the subsequence where is a power of . We then have
By lemma 1, when . Hence, . Since , and , we conclude by the squeeze rule that
By lemma 2, the sequence is decreasing. It is clearly bounded from below by . Above, we exhibited a subsequence which tends towards . Thus it follows that
∎
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 |