Provide example of two series that both diverge but $summina_n,b_n$ converges
Clash Royale CLAN TAG#URR8PPP
$begingroup$
I've posted the solution for this problem and I'm trying to understand this.
In the end of the solution provided it says to continue this process. So, do we hold $a_n$ to be $frac1n^2$ and $b_n$ to be $frac1900^2$ for the next $900^2$ terms? And then hold $b_n$ to be $frac1n^2$ and $a_n$ to be $frac1810000 ^2$ for the next $810000 ^2$ terms? (because $900^2$ is $810000$)
And why do we have to add one to the sum of partial sums?
real-analysis sequences-and-series convergence examples-counterexamples
$endgroup$
add a comment |
$begingroup$
I've posted the solution for this problem and I'm trying to understand this.
In the end of the solution provided it says to continue this process. So, do we hold $a_n$ to be $frac1n^2$ and $b_n$ to be $frac1900^2$ for the next $900^2$ terms? And then hold $b_n$ to be $frac1n^2$ and $a_n$ to be $frac1810000 ^2$ for the next $810000 ^2$ terms? (because $900^2$ is $810000$)
And why do we have to add one to the sum of partial sums?
real-analysis sequences-and-series convergence examples-counterexamples
$endgroup$
add a comment |
$begingroup$
I've posted the solution for this problem and I'm trying to understand this.
In the end of the solution provided it says to continue this process. So, do we hold $a_n$ to be $frac1n^2$ and $b_n$ to be $frac1900^2$ for the next $900^2$ terms? And then hold $b_n$ to be $frac1n^2$ and $a_n$ to be $frac1810000 ^2$ for the next $810000 ^2$ terms? (because $900^2$ is $810000$)
And why do we have to add one to the sum of partial sums?
real-analysis sequences-and-series convergence examples-counterexamples
$endgroup$
I've posted the solution for this problem and I'm trying to understand this.
In the end of the solution provided it says to continue this process. So, do we hold $a_n$ to be $frac1n^2$ and $b_n$ to be $frac1900^2$ for the next $900^2$ terms? And then hold $b_n$ to be $frac1n^2$ and $a_n$ to be $frac1810000 ^2$ for the next $810000 ^2$ terms? (because $900^2$ is $810000$)
And why do we have to add one to the sum of partial sums?
real-analysis sequences-and-series convergence examples-counterexamples
real-analysis sequences-and-series convergence examples-counterexamples
edited Feb 23 at 16:01
K KA
asked Feb 23 at 2:23
K KAK KA
384
384
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
The idea behind the more challenging version is to construct $(a_n)$ and $(b_n)$ such that $sum a_n,sum b_n$ both diverge, but $sum mina_n,b_n$ converges. The way the author of this solution has chosen to proceed is by making $(a_n)$ and $(b_n)$ such that for each $n$, we have $mina_n,b_n = 1/n^2$, and yet we add enough small constant terms to each sequence so that the partial sums eventually grow by $1$ if we wait long enough. This growth by $1$ repeated over and over again ensures that the series $sum a_n,sum b_n$ both diverge since their partial sums each grow without bound by merely waiting long enough.
To find how many terms we add again, think about the pattern
beginalign*
(1+1) - 1 &= 1^2 \
(5 + 1) - 2 &= 2^2 \
(30 + 1) - 6 &= 5^2 \
(930 + 1) - 31 &= 30^2 \
(865830 + 1) - 931 &= 930^2 \
(x + 1) - 865831 &= 865830^2 \
dotsb
endalign*
$endgroup$
add a comment |
$begingroup$
Essentially, they're making $a_n$ and $b_n$ a positive monotone summable sequence (in this case, $frac1n^2$), and just "pausing" each sequence long enough that a $1$ is added to the partial sum, thereby forcing the sum to diverge.
So, start with the same series
beginmatrix
a_n = bigl(1 & frac12^2 & frac13^2 & frac14^2 & frac15^2 & frac16^2 & frac17^2 & frac18^2 & frac19^2 & frac110^2 & frac111^2 & frac112^2 & frac113^2 & frac114^2 & frac115^2 & frac116^2 & cdots &bigr) \
b_n = bigl(1 & frac12^2 & frac13^2 & frac14^2 & frac15^2 & frac16^2 & frac17^2 & frac18^2 & frac19^2 & frac110^2 & frac111^2 & frac112^2 & frac113^2 & frac114^2 & frac115^2 & frac116^2 & cdots &bigr)
endmatrix
and modify them like so:
beginmatrix
a_n = bigl(1 & colorredfrac14 & colorredfrac14 & colorredfrac14 & colorredfrac14 & frac16^2 & frac17^2 & cdots & frac129^2 & colorredfrac1900 & colorredfrac1900 & colorredfrac1900 & cdots & colorredfrac1900 & colorredfrac1900 & frac1930^2 & cdots &bigr) \
b_n = bigl(1 & frac12^2 & frac13^2 & frac14^2 & colorredfrac125 & colorredfrac125 & colorredfrac125 & cdots & colorredfrac125 & colorredfrac125 & frac131^2 & frac132^2 & cdots & frac1928^2 & colorredfrac1929^2 & colorredfrac1929^2 & cdots &bigr).
endmatrix
The streaks of red numbers add to $1$, and occur infinitely many often in both sequences, so each partial sum becomes unbounded and hence the series fails to converge. But, the minimum of the two sequences is always $frac1n^2$.
$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%2f3123303%2fprovide-example-of-two-series-that-both-diverge-but-sum-min-a-n-b-n-conver%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$
The idea behind the more challenging version is to construct $(a_n)$ and $(b_n)$ such that $sum a_n,sum b_n$ both diverge, but $sum mina_n,b_n$ converges. The way the author of this solution has chosen to proceed is by making $(a_n)$ and $(b_n)$ such that for each $n$, we have $mina_n,b_n = 1/n^2$, and yet we add enough small constant terms to each sequence so that the partial sums eventually grow by $1$ if we wait long enough. This growth by $1$ repeated over and over again ensures that the series $sum a_n,sum b_n$ both diverge since their partial sums each grow without bound by merely waiting long enough.
To find how many terms we add again, think about the pattern
beginalign*
(1+1) - 1 &= 1^2 \
(5 + 1) - 2 &= 2^2 \
(30 + 1) - 6 &= 5^2 \
(930 + 1) - 31 &= 30^2 \
(865830 + 1) - 931 &= 930^2 \
(x + 1) - 865831 &= 865830^2 \
dotsb
endalign*
$endgroup$
add a comment |
$begingroup$
The idea behind the more challenging version is to construct $(a_n)$ and $(b_n)$ such that $sum a_n,sum b_n$ both diverge, but $sum mina_n,b_n$ converges. The way the author of this solution has chosen to proceed is by making $(a_n)$ and $(b_n)$ such that for each $n$, we have $mina_n,b_n = 1/n^2$, and yet we add enough small constant terms to each sequence so that the partial sums eventually grow by $1$ if we wait long enough. This growth by $1$ repeated over and over again ensures that the series $sum a_n,sum b_n$ both diverge since their partial sums each grow without bound by merely waiting long enough.
To find how many terms we add again, think about the pattern
beginalign*
(1+1) - 1 &= 1^2 \
(5 + 1) - 2 &= 2^2 \
(30 + 1) - 6 &= 5^2 \
(930 + 1) - 31 &= 30^2 \
(865830 + 1) - 931 &= 930^2 \
(x + 1) - 865831 &= 865830^2 \
dotsb
endalign*
$endgroup$
add a comment |
$begingroup$
The idea behind the more challenging version is to construct $(a_n)$ and $(b_n)$ such that $sum a_n,sum b_n$ both diverge, but $sum mina_n,b_n$ converges. The way the author of this solution has chosen to proceed is by making $(a_n)$ and $(b_n)$ such that for each $n$, we have $mina_n,b_n = 1/n^2$, and yet we add enough small constant terms to each sequence so that the partial sums eventually grow by $1$ if we wait long enough. This growth by $1$ repeated over and over again ensures that the series $sum a_n,sum b_n$ both diverge since their partial sums each grow without bound by merely waiting long enough.
To find how many terms we add again, think about the pattern
beginalign*
(1+1) - 1 &= 1^2 \
(5 + 1) - 2 &= 2^2 \
(30 + 1) - 6 &= 5^2 \
(930 + 1) - 31 &= 30^2 \
(865830 + 1) - 931 &= 930^2 \
(x + 1) - 865831 &= 865830^2 \
dotsb
endalign*
$endgroup$
The idea behind the more challenging version is to construct $(a_n)$ and $(b_n)$ such that $sum a_n,sum b_n$ both diverge, but $sum mina_n,b_n$ converges. The way the author of this solution has chosen to proceed is by making $(a_n)$ and $(b_n)$ such that for each $n$, we have $mina_n,b_n = 1/n^2$, and yet we add enough small constant terms to each sequence so that the partial sums eventually grow by $1$ if we wait long enough. This growth by $1$ repeated over and over again ensures that the series $sum a_n,sum b_n$ both diverge since their partial sums each grow without bound by merely waiting long enough.
To find how many terms we add again, think about the pattern
beginalign*
(1+1) - 1 &= 1^2 \
(5 + 1) - 2 &= 2^2 \
(30 + 1) - 6 &= 5^2 \
(930 + 1) - 31 &= 30^2 \
(865830 + 1) - 931 &= 930^2 \
(x + 1) - 865831 &= 865830^2 \
dotsb
endalign*
answered Feb 23 at 2:54
Alex OrtizAlex Ortiz
11k21441
11k21441
add a comment |
add a comment |
$begingroup$
Essentially, they're making $a_n$ and $b_n$ a positive monotone summable sequence (in this case, $frac1n^2$), and just "pausing" each sequence long enough that a $1$ is added to the partial sum, thereby forcing the sum to diverge.
So, start with the same series
beginmatrix
a_n = bigl(1 & frac12^2 & frac13^2 & frac14^2 & frac15^2 & frac16^2 & frac17^2 & frac18^2 & frac19^2 & frac110^2 & frac111^2 & frac112^2 & frac113^2 & frac114^2 & frac115^2 & frac116^2 & cdots &bigr) \
b_n = bigl(1 & frac12^2 & frac13^2 & frac14^2 & frac15^2 & frac16^2 & frac17^2 & frac18^2 & frac19^2 & frac110^2 & frac111^2 & frac112^2 & frac113^2 & frac114^2 & frac115^2 & frac116^2 & cdots &bigr)
endmatrix
and modify them like so:
beginmatrix
a_n = bigl(1 & colorredfrac14 & colorredfrac14 & colorredfrac14 & colorredfrac14 & frac16^2 & frac17^2 & cdots & frac129^2 & colorredfrac1900 & colorredfrac1900 & colorredfrac1900 & cdots & colorredfrac1900 & colorredfrac1900 & frac1930^2 & cdots &bigr) \
b_n = bigl(1 & frac12^2 & frac13^2 & frac14^2 & colorredfrac125 & colorredfrac125 & colorredfrac125 & cdots & colorredfrac125 & colorredfrac125 & frac131^2 & frac132^2 & cdots & frac1928^2 & colorredfrac1929^2 & colorredfrac1929^2 & cdots &bigr).
endmatrix
The streaks of red numbers add to $1$, and occur infinitely many often in both sequences, so each partial sum becomes unbounded and hence the series fails to converge. But, the minimum of the two sequences is always $frac1n^2$.
$endgroup$
add a comment |
$begingroup$
Essentially, they're making $a_n$ and $b_n$ a positive monotone summable sequence (in this case, $frac1n^2$), and just "pausing" each sequence long enough that a $1$ is added to the partial sum, thereby forcing the sum to diverge.
So, start with the same series
beginmatrix
a_n = bigl(1 & frac12^2 & frac13^2 & frac14^2 & frac15^2 & frac16^2 & frac17^2 & frac18^2 & frac19^2 & frac110^2 & frac111^2 & frac112^2 & frac113^2 & frac114^2 & frac115^2 & frac116^2 & cdots &bigr) \
b_n = bigl(1 & frac12^2 & frac13^2 & frac14^2 & frac15^2 & frac16^2 & frac17^2 & frac18^2 & frac19^2 & frac110^2 & frac111^2 & frac112^2 & frac113^2 & frac114^2 & frac115^2 & frac116^2 & cdots &bigr)
endmatrix
and modify them like so:
beginmatrix
a_n = bigl(1 & colorredfrac14 & colorredfrac14 & colorredfrac14 & colorredfrac14 & frac16^2 & frac17^2 & cdots & frac129^2 & colorredfrac1900 & colorredfrac1900 & colorredfrac1900 & cdots & colorredfrac1900 & colorredfrac1900 & frac1930^2 & cdots &bigr) \
b_n = bigl(1 & frac12^2 & frac13^2 & frac14^2 & colorredfrac125 & colorredfrac125 & colorredfrac125 & cdots & colorredfrac125 & colorredfrac125 & frac131^2 & frac132^2 & cdots & frac1928^2 & colorredfrac1929^2 & colorredfrac1929^2 & cdots &bigr).
endmatrix
The streaks of red numbers add to $1$, and occur infinitely many often in both sequences, so each partial sum becomes unbounded and hence the series fails to converge. But, the minimum of the two sequences is always $frac1n^2$.
$endgroup$
add a comment |
$begingroup$
Essentially, they're making $a_n$ and $b_n$ a positive monotone summable sequence (in this case, $frac1n^2$), and just "pausing" each sequence long enough that a $1$ is added to the partial sum, thereby forcing the sum to diverge.
So, start with the same series
beginmatrix
a_n = bigl(1 & frac12^2 & frac13^2 & frac14^2 & frac15^2 & frac16^2 & frac17^2 & frac18^2 & frac19^2 & frac110^2 & frac111^2 & frac112^2 & frac113^2 & frac114^2 & frac115^2 & frac116^2 & cdots &bigr) \
b_n = bigl(1 & frac12^2 & frac13^2 & frac14^2 & frac15^2 & frac16^2 & frac17^2 & frac18^2 & frac19^2 & frac110^2 & frac111^2 & frac112^2 & frac113^2 & frac114^2 & frac115^2 & frac116^2 & cdots &bigr)
endmatrix
and modify them like so:
beginmatrix
a_n = bigl(1 & colorredfrac14 & colorredfrac14 & colorredfrac14 & colorredfrac14 & frac16^2 & frac17^2 & cdots & frac129^2 & colorredfrac1900 & colorredfrac1900 & colorredfrac1900 & cdots & colorredfrac1900 & colorredfrac1900 & frac1930^2 & cdots &bigr) \
b_n = bigl(1 & frac12^2 & frac13^2 & frac14^2 & colorredfrac125 & colorredfrac125 & colorredfrac125 & cdots & colorredfrac125 & colorredfrac125 & frac131^2 & frac132^2 & cdots & frac1928^2 & colorredfrac1929^2 & colorredfrac1929^2 & cdots &bigr).
endmatrix
The streaks of red numbers add to $1$, and occur infinitely many often in both sequences, so each partial sum becomes unbounded and hence the series fails to converge. But, the minimum of the two sequences is always $frac1n^2$.
$endgroup$
Essentially, they're making $a_n$ and $b_n$ a positive monotone summable sequence (in this case, $frac1n^2$), and just "pausing" each sequence long enough that a $1$ is added to the partial sum, thereby forcing the sum to diverge.
So, start with the same series
beginmatrix
a_n = bigl(1 & frac12^2 & frac13^2 & frac14^2 & frac15^2 & frac16^2 & frac17^2 & frac18^2 & frac19^2 & frac110^2 & frac111^2 & frac112^2 & frac113^2 & frac114^2 & frac115^2 & frac116^2 & cdots &bigr) \
b_n = bigl(1 & frac12^2 & frac13^2 & frac14^2 & frac15^2 & frac16^2 & frac17^2 & frac18^2 & frac19^2 & frac110^2 & frac111^2 & frac112^2 & frac113^2 & frac114^2 & frac115^2 & frac116^2 & cdots &bigr)
endmatrix
and modify them like so:
beginmatrix
a_n = bigl(1 & colorredfrac14 & colorredfrac14 & colorredfrac14 & colorredfrac14 & frac16^2 & frac17^2 & cdots & frac129^2 & colorredfrac1900 & colorredfrac1900 & colorredfrac1900 & cdots & colorredfrac1900 & colorredfrac1900 & frac1930^2 & cdots &bigr) \
b_n = bigl(1 & frac12^2 & frac13^2 & frac14^2 & colorredfrac125 & colorredfrac125 & colorredfrac125 & cdots & colorredfrac125 & colorredfrac125 & frac131^2 & frac132^2 & cdots & frac1928^2 & colorredfrac1929^2 & colorredfrac1929^2 & cdots &bigr).
endmatrix
The streaks of red numbers add to $1$, and occur infinitely many often in both sequences, so each partial sum becomes unbounded and hence the series fails to converge. But, the minimum of the two sequences is always $frac1n^2$.
answered Feb 23 at 2:58
Theo BenditTheo Bendit
19.6k12354
19.6k12354
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%2f3123303%2fprovide-example-of-two-series-that-both-diverge-but-sum-min-a-n-b-n-conver%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