Is the series $a_n = (1 + (-1)^{n}3)^{-n} n^{2}$ absolutely convergent$?$
$begingroup$
The given series is $a_n = (1 + (-1)^{n}3)^{-n} n^2$
I need to check if it is absolutely convergent.
I partition the standard form of series to get -
$$a_n = frac{n^{2}}{(-2)^{n}} = frac{(-1)^{n}n^{2}}{2^n} $$, when $n$ is odd
And
$$a_n = frac{n^{2}}{4^{n}},$$ when n is even.
Since, both parts are absolutely convergent, can I conclude from this that the whole series is absolutely convergent$?$
Moreover, Is this series an alternating series ?
The series is changing its sign alternatively, but it's not in the form of $sum (-1)^{n}a_n$
sequences-and-series
$endgroup$
add a comment |
$begingroup$
The given series is $a_n = (1 + (-1)^{n}3)^{-n} n^2$
I need to check if it is absolutely convergent.
I partition the standard form of series to get -
$$a_n = frac{n^{2}}{(-2)^{n}} = frac{(-1)^{n}n^{2}}{2^n} $$, when $n$ is odd
And
$$a_n = frac{n^{2}}{4^{n}},$$ when n is even.
Since, both parts are absolutely convergent, can I conclude from this that the whole series is absolutely convergent$?$
Moreover, Is this series an alternating series ?
The series is changing its sign alternatively, but it's not in the form of $sum (-1)^{n}a_n$
sequences-and-series
$endgroup$
add a comment |
$begingroup$
The given series is $a_n = (1 + (-1)^{n}3)^{-n} n^2$
I need to check if it is absolutely convergent.
I partition the standard form of series to get -
$$a_n = frac{n^{2}}{(-2)^{n}} = frac{(-1)^{n}n^{2}}{2^n} $$, when $n$ is odd
And
$$a_n = frac{n^{2}}{4^{n}},$$ when n is even.
Since, both parts are absolutely convergent, can I conclude from this that the whole series is absolutely convergent$?$
Moreover, Is this series an alternating series ?
The series is changing its sign alternatively, but it's not in the form of $sum (-1)^{n}a_n$
sequences-and-series
$endgroup$
The given series is $a_n = (1 + (-1)^{n}3)^{-n} n^2$
I need to check if it is absolutely convergent.
I partition the standard form of series to get -
$$a_n = frac{n^{2}}{(-2)^{n}} = frac{(-1)^{n}n^{2}}{2^n} $$, when $n$ is odd
And
$$a_n = frac{n^{2}}{4^{n}},$$ when n is even.
Since, both parts are absolutely convergent, can I conclude from this that the whole series is absolutely convergent$?$
Moreover, Is this series an alternating series ?
The series is changing its sign alternatively, but it's not in the form of $sum (-1)^{n}a_n$
sequences-and-series
sequences-and-series
asked Dec 26 '18 at 12:01
MathsaddictMathsaddict
3619
3619
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
From what you have found you can say that $$|a_n|leq frac{n^2}{2^n}$$
for all $n$. Since by ratio test $sum frac{n^2}{2^n}$ converges, hence $sum |a_n|$ converges, i.e. $sum a_n$ is absolutely convergent.
$endgroup$
add a comment |
$begingroup$
You can first use absolute convergence, remember the (reverse) triangle inequality and notice that $n^2/3^n leq 1/2^n$ from some $n$ (now by comparison with a geometric series you can conclude)
$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%2f3052879%2fis-the-series-a-n-1-1n3-n-n2-absolutely-convergent%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$
From what you have found you can say that $$|a_n|leq frac{n^2}{2^n}$$
for all $n$. Since by ratio test $sum frac{n^2}{2^n}$ converges, hence $sum |a_n|$ converges, i.e. $sum a_n$ is absolutely convergent.
$endgroup$
add a comment |
$begingroup$
From what you have found you can say that $$|a_n|leq frac{n^2}{2^n}$$
for all $n$. Since by ratio test $sum frac{n^2}{2^n}$ converges, hence $sum |a_n|$ converges, i.e. $sum a_n$ is absolutely convergent.
$endgroup$
add a comment |
$begingroup$
From what you have found you can say that $$|a_n|leq frac{n^2}{2^n}$$
for all $n$. Since by ratio test $sum frac{n^2}{2^n}$ converges, hence $sum |a_n|$ converges, i.e. $sum a_n$ is absolutely convergent.
$endgroup$
From what you have found you can say that $$|a_n|leq frac{n^2}{2^n}$$
for all $n$. Since by ratio test $sum frac{n^2}{2^n}$ converges, hence $sum |a_n|$ converges, i.e. $sum a_n$ is absolutely convergent.
answered Dec 26 '18 at 12:11
user9077user9077
1,239612
1,239612
add a comment |
add a comment |
$begingroup$
You can first use absolute convergence, remember the (reverse) triangle inequality and notice that $n^2/3^n leq 1/2^n$ from some $n$ (now by comparison with a geometric series you can conclude)
$endgroup$
add a comment |
$begingroup$
You can first use absolute convergence, remember the (reverse) triangle inequality and notice that $n^2/3^n leq 1/2^n$ from some $n$ (now by comparison with a geometric series you can conclude)
$endgroup$
add a comment |
$begingroup$
You can first use absolute convergence, remember the (reverse) triangle inequality and notice that $n^2/3^n leq 1/2^n$ from some $n$ (now by comparison with a geometric series you can conclude)
$endgroup$
You can first use absolute convergence, remember the (reverse) triangle inequality and notice that $n^2/3^n leq 1/2^n$ from some $n$ (now by comparison with a geometric series you can conclude)
edited Dec 26 '18 at 12:36
answered Dec 26 '18 at 12:18
LeonardoLeonardo
3469
3469
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%2f3052879%2fis-the-series-a-n-1-1n3-n-n2-absolutely-convergent%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