proof of limit of nth root of n
In this entry, we present a self-contained, elementaryproof of the fact that .We begin by with inductive proofs of two integerinequalities — real numbers will not enter untilthe 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 aninductive proof. Suppose that for someinteger . Using the inequality we just showed,
Snce and implies that when we conclude that dorall .∎
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 makinguse of the identity ,
Since , the left-hand side isless 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 concludeby the squeeze rule that
By lemma 2, the sequence is decreasing. Itis clearly bounded from below by . Above, we exhibiteda subsequence which tends towards . Thus it follows that
∎