Convergence of the series $ sumfrac{1}{a_na_{n+1}} $ if the sequence $(a_n)$ is arithmetic
$begingroup$
We know that $(a_n)$ is arithmetic progression and I need to decide if
$$ sum_{n=1}^{infty} frac{1}{a_n cdot a_{n+1}} $$
convergences.
Firstly I check necessary condition:
$ frac{1}{a_n cdot a_{n+1}} rightarrow 0 $
It is true because $$ a_n rightarrow +/- infty $$ because $ a_n = a + (n-1)r $
Ok, now I should check convergence:
Ratio test:
$$ frac{u_{n+1}}{u_n} = frac{a_n(a_n+r)}{(a_n+r)(a_n+2r)} rightarrow 1 $$
So it gives me nothing.
Root tests:
$$ sqrt[n]{frac{1}{a_n cdot a_{n+1}}} rightarrow 1 $$
so it fails too...
Have somebody any idea how can I check this?
real-analysis arithmetic-progressions
$endgroup$
add a comment |
$begingroup$
We know that $(a_n)$ is arithmetic progression and I need to decide if
$$ sum_{n=1}^{infty} frac{1}{a_n cdot a_{n+1}} $$
convergences.
Firstly I check necessary condition:
$ frac{1}{a_n cdot a_{n+1}} rightarrow 0 $
It is true because $$ a_n rightarrow +/- infty $$ because $ a_n = a + (n-1)r $
Ok, now I should check convergence:
Ratio test:
$$ frac{u_{n+1}}{u_n} = frac{a_n(a_n+r)}{(a_n+r)(a_n+2r)} rightarrow 1 $$
So it gives me nothing.
Root tests:
$$ sqrt[n]{frac{1}{a_n cdot a_{n+1}}} rightarrow 1 $$
so it fails too...
Have somebody any idea how can I check this?
real-analysis arithmetic-progressions
$endgroup$
1
$begingroup$
Hint: $$frac{1}{a_na_{n+1}}=frac{1}{a_{n+1}-a_n}cdot left(frac{1}{a_{n}}-frac{1}{a_{n+1}}right)$$
$endgroup$
– Thomas Andrews
Dec 13 '18 at 17:51
add a comment |
$begingroup$
We know that $(a_n)$ is arithmetic progression and I need to decide if
$$ sum_{n=1}^{infty} frac{1}{a_n cdot a_{n+1}} $$
convergences.
Firstly I check necessary condition:
$ frac{1}{a_n cdot a_{n+1}} rightarrow 0 $
It is true because $$ a_n rightarrow +/- infty $$ because $ a_n = a + (n-1)r $
Ok, now I should check convergence:
Ratio test:
$$ frac{u_{n+1}}{u_n} = frac{a_n(a_n+r)}{(a_n+r)(a_n+2r)} rightarrow 1 $$
So it gives me nothing.
Root tests:
$$ sqrt[n]{frac{1}{a_n cdot a_{n+1}}} rightarrow 1 $$
so it fails too...
Have somebody any idea how can I check this?
real-analysis arithmetic-progressions
$endgroup$
We know that $(a_n)$ is arithmetic progression and I need to decide if
$$ sum_{n=1}^{infty} frac{1}{a_n cdot a_{n+1}} $$
convergences.
Firstly I check necessary condition:
$ frac{1}{a_n cdot a_{n+1}} rightarrow 0 $
It is true because $$ a_n rightarrow +/- infty $$ because $ a_n = a + (n-1)r $
Ok, now I should check convergence:
Ratio test:
$$ frac{u_{n+1}}{u_n} = frac{a_n(a_n+r)}{(a_n+r)(a_n+2r)} rightarrow 1 $$
So it gives me nothing.
Root tests:
$$ sqrt[n]{frac{1}{a_n cdot a_{n+1}}} rightarrow 1 $$
so it fails too...
Have somebody any idea how can I check this?
real-analysis arithmetic-progressions
real-analysis arithmetic-progressions
edited Dec 13 '18 at 17:53
Did
248k23223460
248k23223460
asked Dec 13 '18 at 17:49
VirtualUserVirtualUser
81014
81014
1
$begingroup$
Hint: $$frac{1}{a_na_{n+1}}=frac{1}{a_{n+1}-a_n}cdot left(frac{1}{a_{n}}-frac{1}{a_{n+1}}right)$$
$endgroup$
– Thomas Andrews
Dec 13 '18 at 17:51
add a comment |
1
$begingroup$
Hint: $$frac{1}{a_na_{n+1}}=frac{1}{a_{n+1}-a_n}cdot left(frac{1}{a_{n}}-frac{1}{a_{n+1}}right)$$
$endgroup$
– Thomas Andrews
Dec 13 '18 at 17:51
1
1
$begingroup$
Hint: $$frac{1}{a_na_{n+1}}=frac{1}{a_{n+1}-a_n}cdot left(frac{1}{a_{n}}-frac{1}{a_{n+1}}right)$$
$endgroup$
– Thomas Andrews
Dec 13 '18 at 17:51
$begingroup$
Hint: $$frac{1}{a_na_{n+1}}=frac{1}{a_{n+1}-a_n}cdot left(frac{1}{a_{n}}-frac{1}{a_{n+1}}right)$$
$endgroup$
– Thomas Andrews
Dec 13 '18 at 17:51
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
First note that $$frac{1}{a_na_{n+1}}=frac{1}{a_{n+1}-a_n}cdot left(frac{1}{a_{n}}-frac{1}{a_{n+1}}right)$$
Then since $a_n$ is arrithematic, $a_{n+1}-a_n=a_2-a_1=d.$ So you get:
$$sum_{n=1}^{N}frac{1}{a_na_{n+1}}=frac{1}{d}left(frac{1}{a_1}-frac{1}{a_{N+1}}right)$$
Which means the series converges to...
We have to assume the $a_ineq 0$ and that $dneq 0.$ If $d=0$ then all the $a_i$ are equal, and the sum diverges.
$endgroup$
add a comment |
$begingroup$
If $a_n$ is an arithmetic progression, then $a_n$ grows with order $n$; therefore, $a_n cdot a_{n + 1}$ grows at least as quickly as $n^2$, and convergence follows from a comparison test. Note that this convergence is too slow to be detected by either ratio test or root test.
To make this a bit more precise, if $a_n$ is a term of an arithmetic progression we can write $a_n =cn + b$ for constants $c$ and $b$. Then
$$frac{1}{a_n cdot a_{n + 1}} = frac{1}{c^2 n^2 + text{ lower order}}$$
and the comparison is quick from here.
$endgroup$
1
$begingroup$
Indeed -- but see @ThomasAndrews' comment on main...
$endgroup$
– Did
Dec 13 '18 at 17:54
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%2f3038365%2fconvergence-of-the-series-sum-frac1a-na-n1-if-the-sequence-a-n-i%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$
First note that $$frac{1}{a_na_{n+1}}=frac{1}{a_{n+1}-a_n}cdot left(frac{1}{a_{n}}-frac{1}{a_{n+1}}right)$$
Then since $a_n$ is arrithematic, $a_{n+1}-a_n=a_2-a_1=d.$ So you get:
$$sum_{n=1}^{N}frac{1}{a_na_{n+1}}=frac{1}{d}left(frac{1}{a_1}-frac{1}{a_{N+1}}right)$$
Which means the series converges to...
We have to assume the $a_ineq 0$ and that $dneq 0.$ If $d=0$ then all the $a_i$ are equal, and the sum diverges.
$endgroup$
add a comment |
$begingroup$
First note that $$frac{1}{a_na_{n+1}}=frac{1}{a_{n+1}-a_n}cdot left(frac{1}{a_{n}}-frac{1}{a_{n+1}}right)$$
Then since $a_n$ is arrithematic, $a_{n+1}-a_n=a_2-a_1=d.$ So you get:
$$sum_{n=1}^{N}frac{1}{a_na_{n+1}}=frac{1}{d}left(frac{1}{a_1}-frac{1}{a_{N+1}}right)$$
Which means the series converges to...
We have to assume the $a_ineq 0$ and that $dneq 0.$ If $d=0$ then all the $a_i$ are equal, and the sum diverges.
$endgroup$
add a comment |
$begingroup$
First note that $$frac{1}{a_na_{n+1}}=frac{1}{a_{n+1}-a_n}cdot left(frac{1}{a_{n}}-frac{1}{a_{n+1}}right)$$
Then since $a_n$ is arrithematic, $a_{n+1}-a_n=a_2-a_1=d.$ So you get:
$$sum_{n=1}^{N}frac{1}{a_na_{n+1}}=frac{1}{d}left(frac{1}{a_1}-frac{1}{a_{N+1}}right)$$
Which means the series converges to...
We have to assume the $a_ineq 0$ and that $dneq 0.$ If $d=0$ then all the $a_i$ are equal, and the sum diverges.
$endgroup$
First note that $$frac{1}{a_na_{n+1}}=frac{1}{a_{n+1}-a_n}cdot left(frac{1}{a_{n}}-frac{1}{a_{n+1}}right)$$
Then since $a_n$ is arrithematic, $a_{n+1}-a_n=a_2-a_1=d.$ So you get:
$$sum_{n=1}^{N}frac{1}{a_na_{n+1}}=frac{1}{d}left(frac{1}{a_1}-frac{1}{a_{N+1}}right)$$
Which means the series converges to...
We have to assume the $a_ineq 0$ and that $dneq 0.$ If $d=0$ then all the $a_i$ are equal, and the sum diverges.
answered Dec 13 '18 at 17:55
Thomas AndrewsThomas Andrews
130k11146297
130k11146297
add a comment |
add a comment |
$begingroup$
If $a_n$ is an arithmetic progression, then $a_n$ grows with order $n$; therefore, $a_n cdot a_{n + 1}$ grows at least as quickly as $n^2$, and convergence follows from a comparison test. Note that this convergence is too slow to be detected by either ratio test or root test.
To make this a bit more precise, if $a_n$ is a term of an arithmetic progression we can write $a_n =cn + b$ for constants $c$ and $b$. Then
$$frac{1}{a_n cdot a_{n + 1}} = frac{1}{c^2 n^2 + text{ lower order}}$$
and the comparison is quick from here.
$endgroup$
1
$begingroup$
Indeed -- but see @ThomasAndrews' comment on main...
$endgroup$
– Did
Dec 13 '18 at 17:54
add a comment |
$begingroup$
If $a_n$ is an arithmetic progression, then $a_n$ grows with order $n$; therefore, $a_n cdot a_{n + 1}$ grows at least as quickly as $n^2$, and convergence follows from a comparison test. Note that this convergence is too slow to be detected by either ratio test or root test.
To make this a bit more precise, if $a_n$ is a term of an arithmetic progression we can write $a_n =cn + b$ for constants $c$ and $b$. Then
$$frac{1}{a_n cdot a_{n + 1}} = frac{1}{c^2 n^2 + text{ lower order}}$$
and the comparison is quick from here.
$endgroup$
1
$begingroup$
Indeed -- but see @ThomasAndrews' comment on main...
$endgroup$
– Did
Dec 13 '18 at 17:54
add a comment |
$begingroup$
If $a_n$ is an arithmetic progression, then $a_n$ grows with order $n$; therefore, $a_n cdot a_{n + 1}$ grows at least as quickly as $n^2$, and convergence follows from a comparison test. Note that this convergence is too slow to be detected by either ratio test or root test.
To make this a bit more precise, if $a_n$ is a term of an arithmetic progression we can write $a_n =cn + b$ for constants $c$ and $b$. Then
$$frac{1}{a_n cdot a_{n + 1}} = frac{1}{c^2 n^2 + text{ lower order}}$$
and the comparison is quick from here.
$endgroup$
If $a_n$ is an arithmetic progression, then $a_n$ grows with order $n$; therefore, $a_n cdot a_{n + 1}$ grows at least as quickly as $n^2$, and convergence follows from a comparison test. Note that this convergence is too slow to be detected by either ratio test or root test.
To make this a bit more precise, if $a_n$ is a term of an arithmetic progression we can write $a_n =cn + b$ for constants $c$ and $b$. Then
$$frac{1}{a_n cdot a_{n + 1}} = frac{1}{c^2 n^2 + text{ lower order}}$$
and the comparison is quick from here.
answered Dec 13 '18 at 17:51
T. BongersT. Bongers
23.1k54662
23.1k54662
1
$begingroup$
Indeed -- but see @ThomasAndrews' comment on main...
$endgroup$
– Did
Dec 13 '18 at 17:54
add a comment |
1
$begingroup$
Indeed -- but see @ThomasAndrews' comment on main...
$endgroup$
– Did
Dec 13 '18 at 17:54
1
1
$begingroup$
Indeed -- but see @ThomasAndrews' comment on main...
$endgroup$
– Did
Dec 13 '18 at 17:54
$begingroup$
Indeed -- but see @ThomasAndrews' comment on main...
$endgroup$
– Did
Dec 13 '18 at 17:54
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%2f3038365%2fconvergence-of-the-series-sum-frac1a-na-n1-if-the-sequence-a-n-i%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
$begingroup$
Hint: $$frac{1}{a_na_{n+1}}=frac{1}{a_{n+1}-a_n}cdot left(frac{1}{a_{n}}-frac{1}{a_{n+1}}right)$$
$endgroup$
– Thomas Andrews
Dec 13 '18 at 17:51