value of Then $lim_{nrightarrow infty}frac{1}{ln (n)}sum^{n}_{k=1}frac{a_{k}}{k}$
For a given sequence $a_{1},a_{2},a_{3},....,a_{n}$.
If $lim_{nrightarrow infty} a_{n} = a.$ Then $displaystyle lim_{nrightarrow infty}frac{1}{ln (n)}sum^{n}_{k=1}frac{a_{k}}{k}$
Try: Using Stolz Method ,
Let $displaystyle frac{a_{n}}{b_{n}} = lim_{nrightarrow infty}frac{1}{ln (n)}sum^{n}_{k=1}frac{a_{k}}{k}$
Then $$lim_{nrightarrow infty}frac{a_{n+1}-a_{n}}{b_{n+1}-b_{n}} = lim_{nrightarrow infty}frac{a_{n+1}}{(n+1)ln(1+frac{1}{n})}=a_{n+1}$$
Answer given is $a$,
Could some help me Why $a_{n+1}=a_{n}$ for $nrightarrow infty,$ thanks
limits
add a comment |
For a given sequence $a_{1},a_{2},a_{3},....,a_{n}$.
If $lim_{nrightarrow infty} a_{n} = a.$ Then $displaystyle lim_{nrightarrow infty}frac{1}{ln (n)}sum^{n}_{k=1}frac{a_{k}}{k}$
Try: Using Stolz Method ,
Let $displaystyle frac{a_{n}}{b_{n}} = lim_{nrightarrow infty}frac{1}{ln (n)}sum^{n}_{k=1}frac{a_{k}}{k}$
Then $$lim_{nrightarrow infty}frac{a_{n+1}-a_{n}}{b_{n+1}-b_{n}} = lim_{nrightarrow infty}frac{a_{n+1}}{(n+1)ln(1+frac{1}{n})}=a_{n+1}$$
Answer given is $a$,
Could some help me Why $a_{n+1}=a_{n}$ for $nrightarrow infty,$ thanks
limits
1
A more general result is true. If $a_nto L$ then any subsequence of $a_n$ (like $a_{n+1},a_{2n}$) also converges to $L$ and the proof is immediate via definition of limit. This however does not mean that $a_{n+1}=a_n$ for large $n$. It just means they have same limit. Two functions can have same limits without being equal.
– Paramanand Singh
Nov 30 at 2:58
add a comment |
For a given sequence $a_{1},a_{2},a_{3},....,a_{n}$.
If $lim_{nrightarrow infty} a_{n} = a.$ Then $displaystyle lim_{nrightarrow infty}frac{1}{ln (n)}sum^{n}_{k=1}frac{a_{k}}{k}$
Try: Using Stolz Method ,
Let $displaystyle frac{a_{n}}{b_{n}} = lim_{nrightarrow infty}frac{1}{ln (n)}sum^{n}_{k=1}frac{a_{k}}{k}$
Then $$lim_{nrightarrow infty}frac{a_{n+1}-a_{n}}{b_{n+1}-b_{n}} = lim_{nrightarrow infty}frac{a_{n+1}}{(n+1)ln(1+frac{1}{n})}=a_{n+1}$$
Answer given is $a$,
Could some help me Why $a_{n+1}=a_{n}$ for $nrightarrow infty,$ thanks
limits
For a given sequence $a_{1},a_{2},a_{3},....,a_{n}$.
If $lim_{nrightarrow infty} a_{n} = a.$ Then $displaystyle lim_{nrightarrow infty}frac{1}{ln (n)}sum^{n}_{k=1}frac{a_{k}}{k}$
Try: Using Stolz Method ,
Let $displaystyle frac{a_{n}}{b_{n}} = lim_{nrightarrow infty}frac{1}{ln (n)}sum^{n}_{k=1}frac{a_{k}}{k}$
Then $$lim_{nrightarrow infty}frac{a_{n+1}-a_{n}}{b_{n+1}-b_{n}} = lim_{nrightarrow infty}frac{a_{n+1}}{(n+1)ln(1+frac{1}{n})}=a_{n+1}$$
Answer given is $a$,
Could some help me Why $a_{n+1}=a_{n}$ for $nrightarrow infty,$ thanks
limits
limits
asked Nov 29 at 14:22
D Tiwari
5,3492630
5,3492630
1
A more general result is true. If $a_nto L$ then any subsequence of $a_n$ (like $a_{n+1},a_{2n}$) also converges to $L$ and the proof is immediate via definition of limit. This however does not mean that $a_{n+1}=a_n$ for large $n$. It just means they have same limit. Two functions can have same limits without being equal.
– Paramanand Singh
Nov 30 at 2:58
add a comment |
1
A more general result is true. If $a_nto L$ then any subsequence of $a_n$ (like $a_{n+1},a_{2n}$) also converges to $L$ and the proof is immediate via definition of limit. This however does not mean that $a_{n+1}=a_n$ for large $n$. It just means they have same limit. Two functions can have same limits without being equal.
– Paramanand Singh
Nov 30 at 2:58
1
1
A more general result is true. If $a_nto L$ then any subsequence of $a_n$ (like $a_{n+1},a_{2n}$) also converges to $L$ and the proof is immediate via definition of limit. This however does not mean that $a_{n+1}=a_n$ for large $n$. It just means they have same limit. Two functions can have same limits without being equal.
– Paramanand Singh
Nov 30 at 2:58
A more general result is true. If $a_nto L$ then any subsequence of $a_n$ (like $a_{n+1},a_{2n}$) also converges to $L$ and the proof is immediate via definition of limit. This however does not mean that $a_{n+1}=a_n$ for large $n$. It just means they have same limit. Two functions can have same limits without being equal.
– Paramanand Singh
Nov 30 at 2:58
add a comment |
2 Answers
2
active
oldest
votes
By Stolz-Cesaro
$$frac{a_{n}}{b_{n}} = lim_{nrightarrow infty} frac{sum^{n}_{k=1}frac{a_{k}}{k}}{ln (n)}$$
then
$$lim_{nrightarrow infty}frac{a_{n+1}-a_{n}}{b_{n+1}-b_{n}} =lim_{nrightarrow infty}frac{frac{a_{n+1}}{n+1}}{ln (n+1)-ln n}=lim_{nrightarrow infty}frac{frac{n}{n+1}a_{n+1}}{ln left(1+frac1nright)^n} to a$$
add a comment |
What the author of the solution is using is that $lim_{n to infty}a_{n+1} = lim_{n to infty}a_n$.
Therefore, we may rewrite the last step in a more rigorous way as
$lim_{n to infty}frac{a_{n+1}}{(n+1)ln(1+frac{1}{n})} = frac{lim_{n to infty}a_{n+1}}{lim_{n to infty}ln(1+frac{1}{n})^{n+1}} = frac{a}{log e} = a$, where I also used the fact that $ lim_{n to infty}(1+frac{1}{n})^{n+1} = e$
It doesn't have to be the case that $a_{n+1} = a_n$ for the solution to work.
I have a doubt why $lim_{nrightarrow infty}a_{n+1}=a.$ please explain me
– D Tiwari
Nov 29 at 14:52
@DurgeshTiwari Just by the definition of the limit: $lim_{n to infty}a_n = a$ is equivalent to $|a_n-a| < epsilon$ for all n suff large(for any fixed $epsilon$). This would also imply that $|a_{n+1}-a| < epsilon$ for all n sufficiently large and any (fixed) $epsilon$.
– Sorin Tirc
Nov 29 at 15:30
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
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%2f3018681%2fvalue-of-then-lim-n-rightarrow-infty-frac1-ln-n-sumn-k-1-fraca%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
By Stolz-Cesaro
$$frac{a_{n}}{b_{n}} = lim_{nrightarrow infty} frac{sum^{n}_{k=1}frac{a_{k}}{k}}{ln (n)}$$
then
$$lim_{nrightarrow infty}frac{a_{n+1}-a_{n}}{b_{n+1}-b_{n}} =lim_{nrightarrow infty}frac{frac{a_{n+1}}{n+1}}{ln (n+1)-ln n}=lim_{nrightarrow infty}frac{frac{n}{n+1}a_{n+1}}{ln left(1+frac1nright)^n} to a$$
add a comment |
By Stolz-Cesaro
$$frac{a_{n}}{b_{n}} = lim_{nrightarrow infty} frac{sum^{n}_{k=1}frac{a_{k}}{k}}{ln (n)}$$
then
$$lim_{nrightarrow infty}frac{a_{n+1}-a_{n}}{b_{n+1}-b_{n}} =lim_{nrightarrow infty}frac{frac{a_{n+1}}{n+1}}{ln (n+1)-ln n}=lim_{nrightarrow infty}frac{frac{n}{n+1}a_{n+1}}{ln left(1+frac1nright)^n} to a$$
add a comment |
By Stolz-Cesaro
$$frac{a_{n}}{b_{n}} = lim_{nrightarrow infty} frac{sum^{n}_{k=1}frac{a_{k}}{k}}{ln (n)}$$
then
$$lim_{nrightarrow infty}frac{a_{n+1}-a_{n}}{b_{n+1}-b_{n}} =lim_{nrightarrow infty}frac{frac{a_{n+1}}{n+1}}{ln (n+1)-ln n}=lim_{nrightarrow infty}frac{frac{n}{n+1}a_{n+1}}{ln left(1+frac1nright)^n} to a$$
By Stolz-Cesaro
$$frac{a_{n}}{b_{n}} = lim_{nrightarrow infty} frac{sum^{n}_{k=1}frac{a_{k}}{k}}{ln (n)}$$
then
$$lim_{nrightarrow infty}frac{a_{n+1}-a_{n}}{b_{n+1}-b_{n}} =lim_{nrightarrow infty}frac{frac{a_{n+1}}{n+1}}{ln (n+1)-ln n}=lim_{nrightarrow infty}frac{frac{n}{n+1}a_{n+1}}{ln left(1+frac1nright)^n} to a$$
answered Nov 29 at 14:58
gimusi
1
1
add a comment |
add a comment |
What the author of the solution is using is that $lim_{n to infty}a_{n+1} = lim_{n to infty}a_n$.
Therefore, we may rewrite the last step in a more rigorous way as
$lim_{n to infty}frac{a_{n+1}}{(n+1)ln(1+frac{1}{n})} = frac{lim_{n to infty}a_{n+1}}{lim_{n to infty}ln(1+frac{1}{n})^{n+1}} = frac{a}{log e} = a$, where I also used the fact that $ lim_{n to infty}(1+frac{1}{n})^{n+1} = e$
It doesn't have to be the case that $a_{n+1} = a_n$ for the solution to work.
I have a doubt why $lim_{nrightarrow infty}a_{n+1}=a.$ please explain me
– D Tiwari
Nov 29 at 14:52
@DurgeshTiwari Just by the definition of the limit: $lim_{n to infty}a_n = a$ is equivalent to $|a_n-a| < epsilon$ for all n suff large(for any fixed $epsilon$). This would also imply that $|a_{n+1}-a| < epsilon$ for all n sufficiently large and any (fixed) $epsilon$.
– Sorin Tirc
Nov 29 at 15:30
add a comment |
What the author of the solution is using is that $lim_{n to infty}a_{n+1} = lim_{n to infty}a_n$.
Therefore, we may rewrite the last step in a more rigorous way as
$lim_{n to infty}frac{a_{n+1}}{(n+1)ln(1+frac{1}{n})} = frac{lim_{n to infty}a_{n+1}}{lim_{n to infty}ln(1+frac{1}{n})^{n+1}} = frac{a}{log e} = a$, where I also used the fact that $ lim_{n to infty}(1+frac{1}{n})^{n+1} = e$
It doesn't have to be the case that $a_{n+1} = a_n$ for the solution to work.
I have a doubt why $lim_{nrightarrow infty}a_{n+1}=a.$ please explain me
– D Tiwari
Nov 29 at 14:52
@DurgeshTiwari Just by the definition of the limit: $lim_{n to infty}a_n = a$ is equivalent to $|a_n-a| < epsilon$ for all n suff large(for any fixed $epsilon$). This would also imply that $|a_{n+1}-a| < epsilon$ for all n sufficiently large and any (fixed) $epsilon$.
– Sorin Tirc
Nov 29 at 15:30
add a comment |
What the author of the solution is using is that $lim_{n to infty}a_{n+1} = lim_{n to infty}a_n$.
Therefore, we may rewrite the last step in a more rigorous way as
$lim_{n to infty}frac{a_{n+1}}{(n+1)ln(1+frac{1}{n})} = frac{lim_{n to infty}a_{n+1}}{lim_{n to infty}ln(1+frac{1}{n})^{n+1}} = frac{a}{log e} = a$, where I also used the fact that $ lim_{n to infty}(1+frac{1}{n})^{n+1} = e$
It doesn't have to be the case that $a_{n+1} = a_n$ for the solution to work.
What the author of the solution is using is that $lim_{n to infty}a_{n+1} = lim_{n to infty}a_n$.
Therefore, we may rewrite the last step in a more rigorous way as
$lim_{n to infty}frac{a_{n+1}}{(n+1)ln(1+frac{1}{n})} = frac{lim_{n to infty}a_{n+1}}{lim_{n to infty}ln(1+frac{1}{n})^{n+1}} = frac{a}{log e} = a$, where I also used the fact that $ lim_{n to infty}(1+frac{1}{n})^{n+1} = e$
It doesn't have to be the case that $a_{n+1} = a_n$ for the solution to work.
answered Nov 29 at 14:36
Sorin Tirc
94710
94710
I have a doubt why $lim_{nrightarrow infty}a_{n+1}=a.$ please explain me
– D Tiwari
Nov 29 at 14:52
@DurgeshTiwari Just by the definition of the limit: $lim_{n to infty}a_n = a$ is equivalent to $|a_n-a| < epsilon$ for all n suff large(for any fixed $epsilon$). This would also imply that $|a_{n+1}-a| < epsilon$ for all n sufficiently large and any (fixed) $epsilon$.
– Sorin Tirc
Nov 29 at 15:30
add a comment |
I have a doubt why $lim_{nrightarrow infty}a_{n+1}=a.$ please explain me
– D Tiwari
Nov 29 at 14:52
@DurgeshTiwari Just by the definition of the limit: $lim_{n to infty}a_n = a$ is equivalent to $|a_n-a| < epsilon$ for all n suff large(for any fixed $epsilon$). This would also imply that $|a_{n+1}-a| < epsilon$ for all n sufficiently large and any (fixed) $epsilon$.
– Sorin Tirc
Nov 29 at 15:30
I have a doubt why $lim_{nrightarrow infty}a_{n+1}=a.$ please explain me
– D Tiwari
Nov 29 at 14:52
I have a doubt why $lim_{nrightarrow infty}a_{n+1}=a.$ please explain me
– D Tiwari
Nov 29 at 14:52
@DurgeshTiwari Just by the definition of the limit: $lim_{n to infty}a_n = a$ is equivalent to $|a_n-a| < epsilon$ for all n suff large(for any fixed $epsilon$). This would also imply that $|a_{n+1}-a| < epsilon$ for all n sufficiently large and any (fixed) $epsilon$.
– Sorin Tirc
Nov 29 at 15:30
@DurgeshTiwari Just by the definition of the limit: $lim_{n to infty}a_n = a$ is equivalent to $|a_n-a| < epsilon$ for all n suff large(for any fixed $epsilon$). This would also imply that $|a_{n+1}-a| < epsilon$ for all n sufficiently large and any (fixed) $epsilon$.
– Sorin Tirc
Nov 29 at 15:30
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
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%2f3018681%2fvalue-of-then-lim-n-rightarrow-infty-frac1-ln-n-sumn-k-1-fraca%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
1
A more general result is true. If $a_nto L$ then any subsequence of $a_n$ (like $a_{n+1},a_{2n}$) also converges to $L$ and the proof is immediate via definition of limit. This however does not mean that $a_{n+1}=a_n$ for large $n$. It just means they have same limit. Two functions can have same limits without being equal.
– Paramanand Singh
Nov 30 at 2:58