Conditions for which the sum of the product of sequences diverges
$begingroup$
Let $(C_k)_{k=1}^{infty} geq 0$ be non-decreasing sequence of natural numbers. I am trying to figure out when does the sum $$ sum_{k=1}^{infty} C_k 2^{-k} $$ diverge. From my understanding $C_k$ should be something of the form $2^{k}$ as we need to kill the decay of geometric series. Initially I thought $C_k$ ~ $2^k$ but then I can have $frac{2^k} {k}$ which diverges and is not comparable with $2^{k}$.
Any suggestions on lower bounds of $C_k$ would be greatly appreciated!
real-analysis analysis
$endgroup$
add a comment |
$begingroup$
Let $(C_k)_{k=1}^{infty} geq 0$ be non-decreasing sequence of natural numbers. I am trying to figure out when does the sum $$ sum_{k=1}^{infty} C_k 2^{-k} $$ diverge. From my understanding $C_k$ should be something of the form $2^{k}$ as we need to kill the decay of geometric series. Initially I thought $C_k$ ~ $2^k$ but then I can have $frac{2^k} {k}$ which diverges and is not comparable with $2^{k}$.
Any suggestions on lower bounds of $C_k$ would be greatly appreciated!
real-analysis analysis
$endgroup$
add a comment |
$begingroup$
Let $(C_k)_{k=1}^{infty} geq 0$ be non-decreasing sequence of natural numbers. I am trying to figure out when does the sum $$ sum_{k=1}^{infty} C_k 2^{-k} $$ diverge. From my understanding $C_k$ should be something of the form $2^{k}$ as we need to kill the decay of geometric series. Initially I thought $C_k$ ~ $2^k$ but then I can have $frac{2^k} {k}$ which diverges and is not comparable with $2^{k}$.
Any suggestions on lower bounds of $C_k$ would be greatly appreciated!
real-analysis analysis
$endgroup$
Let $(C_k)_{k=1}^{infty} geq 0$ be non-decreasing sequence of natural numbers. I am trying to figure out when does the sum $$ sum_{k=1}^{infty} C_k 2^{-k} $$ diverge. From my understanding $C_k$ should be something of the form $2^{k}$ as we need to kill the decay of geometric series. Initially I thought $C_k$ ~ $2^k$ but then I can have $frac{2^k} {k}$ which diverges and is not comparable with $2^{k}$.
Any suggestions on lower bounds of $C_k$ would be greatly appreciated!
real-analysis analysis
real-analysis analysis
edited Dec 13 '18 at 20:30
Shorty
asked Dec 13 '18 at 20:17
ShortyShorty
1438
1438
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
You could apply the ratio or the root test and get the sufficient conditions for absolute convergence $limsup |C_{k+1}/C_k| <2$ and $limsupsqrt[k]{|C_k|}<2$, respectively.
$endgroup$
$begingroup$
Isn't the ratio supposed to be 1?
$endgroup$
– mm-crj
Dec 13 '18 at 20:39
$begingroup$
Well, here we have $a_k = C_k2^{-k}$.
$endgroup$
– Dirk
Dec 13 '18 at 20:40
$begingroup$
aah yes, I see..
$endgroup$
– mm-crj
Dec 13 '18 at 20:42
add a comment |
$begingroup$
I think the ratio test would do the trick:
$$lim_{kto infty}left|frac{a_{k+1}}{a_k}right|=L$$
The series diverges for $L>1$. For a more general case where the limit doesn't exist $liminfleft|frac{a_{k+1}}{a_k}right|>1$ is a sufficient condition for divergence.
$endgroup$
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%2f3038526%2fconditions-for-which-the-sum-of-the-product-of-sequences-diverges%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
$begingroup$
You could apply the ratio or the root test and get the sufficient conditions for absolute convergence $limsup |C_{k+1}/C_k| <2$ and $limsupsqrt[k]{|C_k|}<2$, respectively.
$endgroup$
$begingroup$
Isn't the ratio supposed to be 1?
$endgroup$
– mm-crj
Dec 13 '18 at 20:39
$begingroup$
Well, here we have $a_k = C_k2^{-k}$.
$endgroup$
– Dirk
Dec 13 '18 at 20:40
$begingroup$
aah yes, I see..
$endgroup$
– mm-crj
Dec 13 '18 at 20:42
add a comment |
$begingroup$
You could apply the ratio or the root test and get the sufficient conditions for absolute convergence $limsup |C_{k+1}/C_k| <2$ and $limsupsqrt[k]{|C_k|}<2$, respectively.
$endgroup$
$begingroup$
Isn't the ratio supposed to be 1?
$endgroup$
– mm-crj
Dec 13 '18 at 20:39
$begingroup$
Well, here we have $a_k = C_k2^{-k}$.
$endgroup$
– Dirk
Dec 13 '18 at 20:40
$begingroup$
aah yes, I see..
$endgroup$
– mm-crj
Dec 13 '18 at 20:42
add a comment |
$begingroup$
You could apply the ratio or the root test and get the sufficient conditions for absolute convergence $limsup |C_{k+1}/C_k| <2$ and $limsupsqrt[k]{|C_k|}<2$, respectively.
$endgroup$
You could apply the ratio or the root test and get the sufficient conditions for absolute convergence $limsup |C_{k+1}/C_k| <2$ and $limsupsqrt[k]{|C_k|}<2$, respectively.
answered Dec 13 '18 at 20:38
DirkDirk
8,8002447
8,8002447
$begingroup$
Isn't the ratio supposed to be 1?
$endgroup$
– mm-crj
Dec 13 '18 at 20:39
$begingroup$
Well, here we have $a_k = C_k2^{-k}$.
$endgroup$
– Dirk
Dec 13 '18 at 20:40
$begingroup$
aah yes, I see..
$endgroup$
– mm-crj
Dec 13 '18 at 20:42
add a comment |
$begingroup$
Isn't the ratio supposed to be 1?
$endgroup$
– mm-crj
Dec 13 '18 at 20:39
$begingroup$
Well, here we have $a_k = C_k2^{-k}$.
$endgroup$
– Dirk
Dec 13 '18 at 20:40
$begingroup$
aah yes, I see..
$endgroup$
– mm-crj
Dec 13 '18 at 20:42
$begingroup$
Isn't the ratio supposed to be 1?
$endgroup$
– mm-crj
Dec 13 '18 at 20:39
$begingroup$
Isn't the ratio supposed to be 1?
$endgroup$
– mm-crj
Dec 13 '18 at 20:39
$begingroup$
Well, here we have $a_k = C_k2^{-k}$.
$endgroup$
– Dirk
Dec 13 '18 at 20:40
$begingroup$
Well, here we have $a_k = C_k2^{-k}$.
$endgroup$
– Dirk
Dec 13 '18 at 20:40
$begingroup$
aah yes, I see..
$endgroup$
– mm-crj
Dec 13 '18 at 20:42
$begingroup$
aah yes, I see..
$endgroup$
– mm-crj
Dec 13 '18 at 20:42
add a comment |
$begingroup$
I think the ratio test would do the trick:
$$lim_{kto infty}left|frac{a_{k+1}}{a_k}right|=L$$
The series diverges for $L>1$. For a more general case where the limit doesn't exist $liminfleft|frac{a_{k+1}}{a_k}right|>1$ is a sufficient condition for divergence.
$endgroup$
add a comment |
$begingroup$
I think the ratio test would do the trick:
$$lim_{kto infty}left|frac{a_{k+1}}{a_k}right|=L$$
The series diverges for $L>1$. For a more general case where the limit doesn't exist $liminfleft|frac{a_{k+1}}{a_k}right|>1$ is a sufficient condition for divergence.
$endgroup$
add a comment |
$begingroup$
I think the ratio test would do the trick:
$$lim_{kto infty}left|frac{a_{k+1}}{a_k}right|=L$$
The series diverges for $L>1$. For a more general case where the limit doesn't exist $liminfleft|frac{a_{k+1}}{a_k}right|>1$ is a sufficient condition for divergence.
$endgroup$
I think the ratio test would do the trick:
$$lim_{kto infty}left|frac{a_{k+1}}{a_k}right|=L$$
The series diverges for $L>1$. For a more general case where the limit doesn't exist $liminfleft|frac{a_{k+1}}{a_k}right|>1$ is a sufficient condition for divergence.
edited Dec 13 '18 at 20:47
answered Dec 13 '18 at 20:38
mm-crjmm-crj
425213
425213
add a comment |
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%2f3038526%2fconditions-for-which-the-sum-of-the-product-of-sequences-diverges%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