Proof verification of $lim_{n to infty}frac{q^n}{n} = 0$ for $|q| < 1$ using $epsilon$ definition
up vote
0
down vote
favorite
Prove
$$
lim_{n to infty}frac{q^n}{n} = 0
$$ for $|q| < 1$ using $epsilon$ definition.
Using the definition of a limit:
$$
lim_{nto infty}frac{q^n}{n} = 0 stackrel{text{def}}{iff} { forallepsilon>0 ,exists Ninmathbb N, forall n > N : left|frac{q^n}{n} - 0right| < epsilon }
$$
Consider the following:
$$
left|frac{q^n}{n}right| < epsilon iff frac{|q|^n}{n} < epsilon
$$
Redefine $|q|^n$:
$$
|q|^n = frac{1}{(1+t)^n} lefrac{1}{(1+nt)}
$$
Thus:
$$
frac{|q|^n}{n} < frac{1}{n(1+nt)} < frac{1}{n^2t} < frac{1}{n} < epsilon
$$
So from this we may find $N$ such that:
$$
frac{1}{n} < frac{1}{N} < epsilon
$$
Thus the limit is $0$.
Is it a correct proof?
calculus limits proof-verification limits-without-lhopital epsilon-delta
add a comment |
up vote
0
down vote
favorite
Prove
$$
lim_{n to infty}frac{q^n}{n} = 0
$$ for $|q| < 1$ using $epsilon$ definition.
Using the definition of a limit:
$$
lim_{nto infty}frac{q^n}{n} = 0 stackrel{text{def}}{iff} { forallepsilon>0 ,exists Ninmathbb N, forall n > N : left|frac{q^n}{n} - 0right| < epsilon }
$$
Consider the following:
$$
left|frac{q^n}{n}right| < epsilon iff frac{|q|^n}{n} < epsilon
$$
Redefine $|q|^n$:
$$
|q|^n = frac{1}{(1+t)^n} lefrac{1}{(1+nt)}
$$
Thus:
$$
frac{|q|^n}{n} < frac{1}{n(1+nt)} < frac{1}{n^2t} < frac{1}{n} < epsilon
$$
So from this we may find $N$ such that:
$$
frac{1}{n} < frac{1}{N} < epsilon
$$
Thus the limit is $0$.
Is it a correct proof?
calculus limits proof-verification limits-without-lhopital epsilon-delta
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
Prove
$$
lim_{n to infty}frac{q^n}{n} = 0
$$ for $|q| < 1$ using $epsilon$ definition.
Using the definition of a limit:
$$
lim_{nto infty}frac{q^n}{n} = 0 stackrel{text{def}}{iff} { forallepsilon>0 ,exists Ninmathbb N, forall n > N : left|frac{q^n}{n} - 0right| < epsilon }
$$
Consider the following:
$$
left|frac{q^n}{n}right| < epsilon iff frac{|q|^n}{n} < epsilon
$$
Redefine $|q|^n$:
$$
|q|^n = frac{1}{(1+t)^n} lefrac{1}{(1+nt)}
$$
Thus:
$$
frac{|q|^n}{n} < frac{1}{n(1+nt)} < frac{1}{n^2t} < frac{1}{n} < epsilon
$$
So from this we may find $N$ such that:
$$
frac{1}{n} < frac{1}{N} < epsilon
$$
Thus the limit is $0$.
Is it a correct proof?
calculus limits proof-verification limits-without-lhopital epsilon-delta
Prove
$$
lim_{n to infty}frac{q^n}{n} = 0
$$ for $|q| < 1$ using $epsilon$ definition.
Using the definition of a limit:
$$
lim_{nto infty}frac{q^n}{n} = 0 stackrel{text{def}}{iff} { forallepsilon>0 ,exists Ninmathbb N, forall n > N : left|frac{q^n}{n} - 0right| < epsilon }
$$
Consider the following:
$$
left|frac{q^n}{n}right| < epsilon iff frac{|q|^n}{n} < epsilon
$$
Redefine $|q|^n$:
$$
|q|^n = frac{1}{(1+t)^n} lefrac{1}{(1+nt)}
$$
Thus:
$$
frac{|q|^n}{n} < frac{1}{n(1+nt)} < frac{1}{n^2t} < frac{1}{n} < epsilon
$$
So from this we may find $N$ such that:
$$
frac{1}{n} < frac{1}{N} < epsilon
$$
Thus the limit is $0$.
Is it a correct proof?
calculus limits proof-verification limits-without-lhopital epsilon-delta
calculus limits proof-verification limits-without-lhopital epsilon-delta
edited Nov 21 at 16:51
asked Nov 21 at 16:28
roman
9701815
9701815
add a comment |
add a comment |
3 Answers
3
active
oldest
votes
up vote
3
down vote
accepted
Your proof is almost correct, but there is a small problem concerning the inequality $dfrac1{n^2t}<dfrac1n$. This is equivalent to $nt>1$. Why would that be true? All you know about $t$ is that $t>0$. So, you should deal with the inequality $dfrac1{nt}<varepsilon$. That is, choose $N$ such that $dfrac1{Nt}<varepsilon$.
That's a nice catch, thank you!
– roman
Nov 21 at 16:50
I'm glad I could help.
– José Carlos Santos
Nov 21 at 16:52
add a comment |
up vote
1
down vote
Yes, your proof is fine. You should mention, that the inequality $frac{1}{n^2t }<frac{1}{n}$ does not hold for all $n $, but for almost all $n $.
add a comment |
up vote
1
down vote
You have::
$dfrac{|q|^n}{n} < dfrac{1}{n^2t}< dfrac{1}{nt},$ $t>0$.
Let $epsilon$ be given.
Archimedean principle:
There is a $N$, positive interger, s.t.
$N >dfrac{1}{t epsilon}$.
For $n ge N$:
$dfrac{|q|^n}{n} <dfrac{1}{nt} le dfrac{1}{Nt} <epsilon$.
add a comment |
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
3
down vote
accepted
Your proof is almost correct, but there is a small problem concerning the inequality $dfrac1{n^2t}<dfrac1n$. This is equivalent to $nt>1$. Why would that be true? All you know about $t$ is that $t>0$. So, you should deal with the inequality $dfrac1{nt}<varepsilon$. That is, choose $N$ such that $dfrac1{Nt}<varepsilon$.
That's a nice catch, thank you!
– roman
Nov 21 at 16:50
I'm glad I could help.
– José Carlos Santos
Nov 21 at 16:52
add a comment |
up vote
3
down vote
accepted
Your proof is almost correct, but there is a small problem concerning the inequality $dfrac1{n^2t}<dfrac1n$. This is equivalent to $nt>1$. Why would that be true? All you know about $t$ is that $t>0$. So, you should deal with the inequality $dfrac1{nt}<varepsilon$. That is, choose $N$ such that $dfrac1{Nt}<varepsilon$.
That's a nice catch, thank you!
– roman
Nov 21 at 16:50
I'm glad I could help.
– José Carlos Santos
Nov 21 at 16:52
add a comment |
up vote
3
down vote
accepted
up vote
3
down vote
accepted
Your proof is almost correct, but there is a small problem concerning the inequality $dfrac1{n^2t}<dfrac1n$. This is equivalent to $nt>1$. Why would that be true? All you know about $t$ is that $t>0$. So, you should deal with the inequality $dfrac1{nt}<varepsilon$. That is, choose $N$ such that $dfrac1{Nt}<varepsilon$.
Your proof is almost correct, but there is a small problem concerning the inequality $dfrac1{n^2t}<dfrac1n$. This is equivalent to $nt>1$. Why would that be true? All you know about $t$ is that $t>0$. So, you should deal with the inequality $dfrac1{nt}<varepsilon$. That is, choose $N$ such that $dfrac1{Nt}<varepsilon$.
answered Nov 21 at 16:33
José Carlos Santos
142k20111207
142k20111207
That's a nice catch, thank you!
– roman
Nov 21 at 16:50
I'm glad I could help.
– José Carlos Santos
Nov 21 at 16:52
add a comment |
That's a nice catch, thank you!
– roman
Nov 21 at 16:50
I'm glad I could help.
– José Carlos Santos
Nov 21 at 16:52
That's a nice catch, thank you!
– roman
Nov 21 at 16:50
That's a nice catch, thank you!
– roman
Nov 21 at 16:50
I'm glad I could help.
– José Carlos Santos
Nov 21 at 16:52
I'm glad I could help.
– José Carlos Santos
Nov 21 at 16:52
add a comment |
up vote
1
down vote
Yes, your proof is fine. You should mention, that the inequality $frac{1}{n^2t }<frac{1}{n}$ does not hold for all $n $, but for almost all $n $.
add a comment |
up vote
1
down vote
Yes, your proof is fine. You should mention, that the inequality $frac{1}{n^2t }<frac{1}{n}$ does not hold for all $n $, but for almost all $n $.
add a comment |
up vote
1
down vote
up vote
1
down vote
Yes, your proof is fine. You should mention, that the inequality $frac{1}{n^2t }<frac{1}{n}$ does not hold for all $n $, but for almost all $n $.
Yes, your proof is fine. You should mention, that the inequality $frac{1}{n^2t }<frac{1}{n}$ does not hold for all $n $, but for almost all $n $.
answered Nov 21 at 16:39
Fred
42.6k1642
42.6k1642
add a comment |
add a comment |
up vote
1
down vote
You have::
$dfrac{|q|^n}{n} < dfrac{1}{n^2t}< dfrac{1}{nt},$ $t>0$.
Let $epsilon$ be given.
Archimedean principle:
There is a $N$, positive interger, s.t.
$N >dfrac{1}{t epsilon}$.
For $n ge N$:
$dfrac{|q|^n}{n} <dfrac{1}{nt} le dfrac{1}{Nt} <epsilon$.
add a comment |
up vote
1
down vote
You have::
$dfrac{|q|^n}{n} < dfrac{1}{n^2t}< dfrac{1}{nt},$ $t>0$.
Let $epsilon$ be given.
Archimedean principle:
There is a $N$, positive interger, s.t.
$N >dfrac{1}{t epsilon}$.
For $n ge N$:
$dfrac{|q|^n}{n} <dfrac{1}{nt} le dfrac{1}{Nt} <epsilon$.
add a comment |
up vote
1
down vote
up vote
1
down vote
You have::
$dfrac{|q|^n}{n} < dfrac{1}{n^2t}< dfrac{1}{nt},$ $t>0$.
Let $epsilon$ be given.
Archimedean principle:
There is a $N$, positive interger, s.t.
$N >dfrac{1}{t epsilon}$.
For $n ge N$:
$dfrac{|q|^n}{n} <dfrac{1}{nt} le dfrac{1}{Nt} <epsilon$.
You have::
$dfrac{|q|^n}{n} < dfrac{1}{n^2t}< dfrac{1}{nt},$ $t>0$.
Let $epsilon$ be given.
Archimedean principle:
There is a $N$, positive interger, s.t.
$N >dfrac{1}{t epsilon}$.
For $n ge N$:
$dfrac{|q|^n}{n} <dfrac{1}{nt} le dfrac{1}{Nt} <epsilon$.
answered Nov 21 at 16:56
Peter Szilas
10.2k2720
10.2k2720
add a comment |
add a comment |
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3007962%2fproof-verification-of-lim-n-to-infty-fracqnn-0-for-q-1-using%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown