Let ${a_n}$ be a sequence of positive numbers and $b_{n} = frac{a_{n}}{(a_{1}+…+a_{n})^{2}}$. Prove...
$begingroup$
Let ${a_n}_{n=1}^{infty}$ be a sequence of positive numbers and let $b_{n} = frac{a_{n}}{(a_{1}+...+a_{n})^{2}}$ for n $inmathbb{N}$. Prove that $sum_{n=1}^{infty}b_{n}$ is a convergent series.
I'm stuck on how to start this problem. I've considered the limit comparison test, but it hasn't worked out for me. I know I can assume ${a_{n}}$ and ${b_{n}}$ are positive, so maybe I need to show ${b_{n}}$ has an upper bound and apply the positive series test. Any help is appreciated. Thank you!
real-analysis calculus
$endgroup$
add a comment |
$begingroup$
Let ${a_n}_{n=1}^{infty}$ be a sequence of positive numbers and let $b_{n} = frac{a_{n}}{(a_{1}+...+a_{n})^{2}}$ for n $inmathbb{N}$. Prove that $sum_{n=1}^{infty}b_{n}$ is a convergent series.
I'm stuck on how to start this problem. I've considered the limit comparison test, but it hasn't worked out for me. I know I can assume ${a_{n}}$ and ${b_{n}}$ are positive, so maybe I need to show ${b_{n}}$ has an upper bound and apply the positive series test. Any help is appreciated. Thank you!
real-analysis calculus
$endgroup$
add a comment |
$begingroup$
Let ${a_n}_{n=1}^{infty}$ be a sequence of positive numbers and let $b_{n} = frac{a_{n}}{(a_{1}+...+a_{n})^{2}}$ for n $inmathbb{N}$. Prove that $sum_{n=1}^{infty}b_{n}$ is a convergent series.
I'm stuck on how to start this problem. I've considered the limit comparison test, but it hasn't worked out for me. I know I can assume ${a_{n}}$ and ${b_{n}}$ are positive, so maybe I need to show ${b_{n}}$ has an upper bound and apply the positive series test. Any help is appreciated. Thank you!
real-analysis calculus
$endgroup$
Let ${a_n}_{n=1}^{infty}$ be a sequence of positive numbers and let $b_{n} = frac{a_{n}}{(a_{1}+...+a_{n})^{2}}$ for n $inmathbb{N}$. Prove that $sum_{n=1}^{infty}b_{n}$ is a convergent series.
I'm stuck on how to start this problem. I've considered the limit comparison test, but it hasn't worked out for me. I know I can assume ${a_{n}}$ and ${b_{n}}$ are positive, so maybe I need to show ${b_{n}}$ has an upper bound and apply the positive series test. Any help is appreciated. Thank you!
real-analysis calculus
real-analysis calculus
asked Jan 2 at 3:17
dorkichardorkichar
724
724
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Hint:
With $S_n = a_1+ ldots + a_n$,
$$frac{a_n}{S_n^2} leqslant frac{S_n - S_{n-1}}{S_nS_{n-1}} = frac{1}{S_{n-1}}- frac{1}{S_n}$$
Note that $S_n$ converges either to a finite limit or $+infty$ and in all cases $1/S_n $ converges to a finite limit.
$endgroup$
$begingroup$
Clever approach and definitely makes sense to me. Thank you!
$endgroup$
– dorkichar
Jan 3 at 21:24
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%2f3059108%2flet-a-n-be-a-sequence-of-positive-numbers-and-b-n-fraca-na-1%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Hint:
With $S_n = a_1+ ldots + a_n$,
$$frac{a_n}{S_n^2} leqslant frac{S_n - S_{n-1}}{S_nS_{n-1}} = frac{1}{S_{n-1}}- frac{1}{S_n}$$
Note that $S_n$ converges either to a finite limit or $+infty$ and in all cases $1/S_n $ converges to a finite limit.
$endgroup$
$begingroup$
Clever approach and definitely makes sense to me. Thank you!
$endgroup$
– dorkichar
Jan 3 at 21:24
add a comment |
$begingroup$
Hint:
With $S_n = a_1+ ldots + a_n$,
$$frac{a_n}{S_n^2} leqslant frac{S_n - S_{n-1}}{S_nS_{n-1}} = frac{1}{S_{n-1}}- frac{1}{S_n}$$
Note that $S_n$ converges either to a finite limit or $+infty$ and in all cases $1/S_n $ converges to a finite limit.
$endgroup$
$begingroup$
Clever approach and definitely makes sense to me. Thank you!
$endgroup$
– dorkichar
Jan 3 at 21:24
add a comment |
$begingroup$
Hint:
With $S_n = a_1+ ldots + a_n$,
$$frac{a_n}{S_n^2} leqslant frac{S_n - S_{n-1}}{S_nS_{n-1}} = frac{1}{S_{n-1}}- frac{1}{S_n}$$
Note that $S_n$ converges either to a finite limit or $+infty$ and in all cases $1/S_n $ converges to a finite limit.
$endgroup$
Hint:
With $S_n = a_1+ ldots + a_n$,
$$frac{a_n}{S_n^2} leqslant frac{S_n - S_{n-1}}{S_nS_{n-1}} = frac{1}{S_{n-1}}- frac{1}{S_n}$$
Note that $S_n$ converges either to a finite limit or $+infty$ and in all cases $1/S_n $ converges to a finite limit.
edited Jan 2 at 3:51
answered Jan 2 at 3:44
RRLRRL
53.1k52574
53.1k52574
$begingroup$
Clever approach and definitely makes sense to me. Thank you!
$endgroup$
– dorkichar
Jan 3 at 21:24
add a comment |
$begingroup$
Clever approach and definitely makes sense to me. Thank you!
$endgroup$
– dorkichar
Jan 3 at 21:24
$begingroup$
Clever approach and definitely makes sense to me. Thank you!
$endgroup$
– dorkichar
Jan 3 at 21:24
$begingroup$
Clever approach and definitely makes sense to me. Thank you!
$endgroup$
– dorkichar
Jan 3 at 21:24
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.
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%2f3059108%2flet-a-n-be-a-sequence-of-positive-numbers-and-b-n-fraca-na-1%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