Decide about convergence of the series for $a>0$ and $qin mathbb R$
$begingroup$
My series is: $$sum_{n=1}^{+ infty } frac{q^{n}n^{2}cos( frac{npi}{5} )}{ frac{n^{3}}{1444}+1001n^{2}+1444an }$$
for $q in mathbb{R}$ and $a > 1$.
I did this task for $|q|<1$ and $|q|>1$ using the Cauchy criterion and for $q=-1$ using the Leibnitz criterion. However I cannot do this task for $q=1$. My idea is to use Raabe test but there are big number and it is difficult to use it so I think exist easier way.
real-analysis
$endgroup$
add a comment |
$begingroup$
My series is: $$sum_{n=1}^{+ infty } frac{q^{n}n^{2}cos( frac{npi}{5} )}{ frac{n^{3}}{1444}+1001n^{2}+1444an }$$
for $q in mathbb{R}$ and $a > 1$.
I did this task for $|q|<1$ and $|q|>1$ using the Cauchy criterion and for $q=-1$ using the Leibnitz criterion. However I cannot do this task for $q=1$. My idea is to use Raabe test but there are big number and it is difficult to use it so I think exist easier way.
real-analysis
$endgroup$
add a comment |
$begingroup$
My series is: $$sum_{n=1}^{+ infty } frac{q^{n}n^{2}cos( frac{npi}{5} )}{ frac{n^{3}}{1444}+1001n^{2}+1444an }$$
for $q in mathbb{R}$ and $a > 1$.
I did this task for $|q|<1$ and $|q|>1$ using the Cauchy criterion and for $q=-1$ using the Leibnitz criterion. However I cannot do this task for $q=1$. My idea is to use Raabe test but there are big number and it is difficult to use it so I think exist easier way.
real-analysis
$endgroup$
My series is: $$sum_{n=1}^{+ infty } frac{q^{n}n^{2}cos( frac{npi}{5} )}{ frac{n^{3}}{1444}+1001n^{2}+1444an }$$
for $q in mathbb{R}$ and $a > 1$.
I did this task for $|q|<1$ and $|q|>1$ using the Cauchy criterion and for $q=-1$ using the Leibnitz criterion. However I cannot do this task for $q=1$. My idea is to use Raabe test but there are big number and it is difficult to use it so I think exist easier way.
real-analysis
real-analysis
edited Jan 4 at 23:16
T. Fo
496311
496311
asked Jan 4 at 23:08
MP3129MP3129
56610
56610
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
You can prove it converges using the Dirichlet Test. https://en.wikipedia.org/wiki/Dirichlet%27s_test
When $q=1$ this sum will be less than
$$1444sum_{n=1}^infty frac{cos{(frac{npi}{5})}}{n}$$
$|sum_{n=1}^N cos{(frac{npi}{5})}| le 10$ for every integer $N$, this is easy to see because the sum repeats every $20$, and the sum at $20$ is $0$ (Note I choose $10$ randomly, you could get a way better bound if you wanted). And $frac1n$ is decreasing and goes to 0, so the sum converges.
$endgroup$
$begingroup$
There are few unfortunate $a$s, which vanish the denominator.
$endgroup$
– user58697
Jan 5 at 5:02
$begingroup$
@user58697 The problem states that $a>1$ so the denominator will always be positive.
$endgroup$
– Erik Parkinson
Jan 5 at 5:04
$begingroup$
@ErikParkinson I checked this sum in Wolfram and I got that SumConvergence is for: "Abs[q] <= 1 && q != 1", so Wolfram think that for q=1, the series is divergent. Are you sure of your answer? Because I do not see an error in your reasoning, and yet Wolfram gives something else
$endgroup$
– MP3129
Jan 5 at 10:54
$begingroup$
@MP3129 I'm pretty sure, although I could be missing something. Do you know how Wolfram determines convergence? My guess is that it is doing something numerical and ends up guessing incorrectly that it diverges.
$endgroup$
– Erik Parkinson
Jan 5 at 11:08
$begingroup$
@ErikParkinson Unfortunately Wolfram must be right, because I am writing this series for q=1 and for several different $a$ - for example for 1,2 and really big $a$ to give Wolfram constant values and all the time I get that the series is divergent . Moreover I checked Sum for {n,1,100},{n,1,1000},{n,1,100000} and the sum is constantly growing so this series must be divergent
$endgroup$
– MP3129
Jan 5 at 12:08
|
show 2 more comments
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%2f3062220%2fdecide-about-convergence-of-the-series-for-a0-and-q-in-mathbb-r%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$
You can prove it converges using the Dirichlet Test. https://en.wikipedia.org/wiki/Dirichlet%27s_test
When $q=1$ this sum will be less than
$$1444sum_{n=1}^infty frac{cos{(frac{npi}{5})}}{n}$$
$|sum_{n=1}^N cos{(frac{npi}{5})}| le 10$ for every integer $N$, this is easy to see because the sum repeats every $20$, and the sum at $20$ is $0$ (Note I choose $10$ randomly, you could get a way better bound if you wanted). And $frac1n$ is decreasing and goes to 0, so the sum converges.
$endgroup$
$begingroup$
There are few unfortunate $a$s, which vanish the denominator.
$endgroup$
– user58697
Jan 5 at 5:02
$begingroup$
@user58697 The problem states that $a>1$ so the denominator will always be positive.
$endgroup$
– Erik Parkinson
Jan 5 at 5:04
$begingroup$
@ErikParkinson I checked this sum in Wolfram and I got that SumConvergence is for: "Abs[q] <= 1 && q != 1", so Wolfram think that for q=1, the series is divergent. Are you sure of your answer? Because I do not see an error in your reasoning, and yet Wolfram gives something else
$endgroup$
– MP3129
Jan 5 at 10:54
$begingroup$
@MP3129 I'm pretty sure, although I could be missing something. Do you know how Wolfram determines convergence? My guess is that it is doing something numerical and ends up guessing incorrectly that it diverges.
$endgroup$
– Erik Parkinson
Jan 5 at 11:08
$begingroup$
@ErikParkinson Unfortunately Wolfram must be right, because I am writing this series for q=1 and for several different $a$ - for example for 1,2 and really big $a$ to give Wolfram constant values and all the time I get that the series is divergent . Moreover I checked Sum for {n,1,100},{n,1,1000},{n,1,100000} and the sum is constantly growing so this series must be divergent
$endgroup$
– MP3129
Jan 5 at 12:08
|
show 2 more comments
$begingroup$
You can prove it converges using the Dirichlet Test. https://en.wikipedia.org/wiki/Dirichlet%27s_test
When $q=1$ this sum will be less than
$$1444sum_{n=1}^infty frac{cos{(frac{npi}{5})}}{n}$$
$|sum_{n=1}^N cos{(frac{npi}{5})}| le 10$ for every integer $N$, this is easy to see because the sum repeats every $20$, and the sum at $20$ is $0$ (Note I choose $10$ randomly, you could get a way better bound if you wanted). And $frac1n$ is decreasing and goes to 0, so the sum converges.
$endgroup$
$begingroup$
There are few unfortunate $a$s, which vanish the denominator.
$endgroup$
– user58697
Jan 5 at 5:02
$begingroup$
@user58697 The problem states that $a>1$ so the denominator will always be positive.
$endgroup$
– Erik Parkinson
Jan 5 at 5:04
$begingroup$
@ErikParkinson I checked this sum in Wolfram and I got that SumConvergence is for: "Abs[q] <= 1 && q != 1", so Wolfram think that for q=1, the series is divergent. Are you sure of your answer? Because I do not see an error in your reasoning, and yet Wolfram gives something else
$endgroup$
– MP3129
Jan 5 at 10:54
$begingroup$
@MP3129 I'm pretty sure, although I could be missing something. Do you know how Wolfram determines convergence? My guess is that it is doing something numerical and ends up guessing incorrectly that it diverges.
$endgroup$
– Erik Parkinson
Jan 5 at 11:08
$begingroup$
@ErikParkinson Unfortunately Wolfram must be right, because I am writing this series for q=1 and for several different $a$ - for example for 1,2 and really big $a$ to give Wolfram constant values and all the time I get that the series is divergent . Moreover I checked Sum for {n,1,100},{n,1,1000},{n,1,100000} and the sum is constantly growing so this series must be divergent
$endgroup$
– MP3129
Jan 5 at 12:08
|
show 2 more comments
$begingroup$
You can prove it converges using the Dirichlet Test. https://en.wikipedia.org/wiki/Dirichlet%27s_test
When $q=1$ this sum will be less than
$$1444sum_{n=1}^infty frac{cos{(frac{npi}{5})}}{n}$$
$|sum_{n=1}^N cos{(frac{npi}{5})}| le 10$ for every integer $N$, this is easy to see because the sum repeats every $20$, and the sum at $20$ is $0$ (Note I choose $10$ randomly, you could get a way better bound if you wanted). And $frac1n$ is decreasing and goes to 0, so the sum converges.
$endgroup$
You can prove it converges using the Dirichlet Test. https://en.wikipedia.org/wiki/Dirichlet%27s_test
When $q=1$ this sum will be less than
$$1444sum_{n=1}^infty frac{cos{(frac{npi}{5})}}{n}$$
$|sum_{n=1}^N cos{(frac{npi}{5})}| le 10$ for every integer $N$, this is easy to see because the sum repeats every $20$, and the sum at $20$ is $0$ (Note I choose $10$ randomly, you could get a way better bound if you wanted). And $frac1n$ is decreasing and goes to 0, so the sum converges.
answered Jan 5 at 0:45
Erik ParkinsonErik Parkinson
1,17519
1,17519
$begingroup$
There are few unfortunate $a$s, which vanish the denominator.
$endgroup$
– user58697
Jan 5 at 5:02
$begingroup$
@user58697 The problem states that $a>1$ so the denominator will always be positive.
$endgroup$
– Erik Parkinson
Jan 5 at 5:04
$begingroup$
@ErikParkinson I checked this sum in Wolfram and I got that SumConvergence is for: "Abs[q] <= 1 && q != 1", so Wolfram think that for q=1, the series is divergent. Are you sure of your answer? Because I do not see an error in your reasoning, and yet Wolfram gives something else
$endgroup$
– MP3129
Jan 5 at 10:54
$begingroup$
@MP3129 I'm pretty sure, although I could be missing something. Do you know how Wolfram determines convergence? My guess is that it is doing something numerical and ends up guessing incorrectly that it diverges.
$endgroup$
– Erik Parkinson
Jan 5 at 11:08
$begingroup$
@ErikParkinson Unfortunately Wolfram must be right, because I am writing this series for q=1 and for several different $a$ - for example for 1,2 and really big $a$ to give Wolfram constant values and all the time I get that the series is divergent . Moreover I checked Sum for {n,1,100},{n,1,1000},{n,1,100000} and the sum is constantly growing so this series must be divergent
$endgroup$
– MP3129
Jan 5 at 12:08
|
show 2 more comments
$begingroup$
There are few unfortunate $a$s, which vanish the denominator.
$endgroup$
– user58697
Jan 5 at 5:02
$begingroup$
@user58697 The problem states that $a>1$ so the denominator will always be positive.
$endgroup$
– Erik Parkinson
Jan 5 at 5:04
$begingroup$
@ErikParkinson I checked this sum in Wolfram and I got that SumConvergence is for: "Abs[q] <= 1 && q != 1", so Wolfram think that for q=1, the series is divergent. Are you sure of your answer? Because I do not see an error in your reasoning, and yet Wolfram gives something else
$endgroup$
– MP3129
Jan 5 at 10:54
$begingroup$
@MP3129 I'm pretty sure, although I could be missing something. Do you know how Wolfram determines convergence? My guess is that it is doing something numerical and ends up guessing incorrectly that it diverges.
$endgroup$
– Erik Parkinson
Jan 5 at 11:08
$begingroup$
@ErikParkinson Unfortunately Wolfram must be right, because I am writing this series for q=1 and for several different $a$ - for example for 1,2 and really big $a$ to give Wolfram constant values and all the time I get that the series is divergent . Moreover I checked Sum for {n,1,100},{n,1,1000},{n,1,100000} and the sum is constantly growing so this series must be divergent
$endgroup$
– MP3129
Jan 5 at 12:08
$begingroup$
There are few unfortunate $a$s, which vanish the denominator.
$endgroup$
– user58697
Jan 5 at 5:02
$begingroup$
There are few unfortunate $a$s, which vanish the denominator.
$endgroup$
– user58697
Jan 5 at 5:02
$begingroup$
@user58697 The problem states that $a>1$ so the denominator will always be positive.
$endgroup$
– Erik Parkinson
Jan 5 at 5:04
$begingroup$
@user58697 The problem states that $a>1$ so the denominator will always be positive.
$endgroup$
– Erik Parkinson
Jan 5 at 5:04
$begingroup$
@ErikParkinson I checked this sum in Wolfram and I got that SumConvergence is for: "Abs[q] <= 1 && q != 1", so Wolfram think that for q=1, the series is divergent. Are you sure of your answer? Because I do not see an error in your reasoning, and yet Wolfram gives something else
$endgroup$
– MP3129
Jan 5 at 10:54
$begingroup$
@ErikParkinson I checked this sum in Wolfram and I got that SumConvergence is for: "Abs[q] <= 1 && q != 1", so Wolfram think that for q=1, the series is divergent. Are you sure of your answer? Because I do not see an error in your reasoning, and yet Wolfram gives something else
$endgroup$
– MP3129
Jan 5 at 10:54
$begingroup$
@MP3129 I'm pretty sure, although I could be missing something. Do you know how Wolfram determines convergence? My guess is that it is doing something numerical and ends up guessing incorrectly that it diverges.
$endgroup$
– Erik Parkinson
Jan 5 at 11:08
$begingroup$
@MP3129 I'm pretty sure, although I could be missing something. Do you know how Wolfram determines convergence? My guess is that it is doing something numerical and ends up guessing incorrectly that it diverges.
$endgroup$
– Erik Parkinson
Jan 5 at 11:08
$begingroup$
@ErikParkinson Unfortunately Wolfram must be right, because I am writing this series for q=1 and for several different $a$ - for example for 1,2 and really big $a$ to give Wolfram constant values and all the time I get that the series is divergent . Moreover I checked Sum for {n,1,100},{n,1,1000},{n,1,100000} and the sum is constantly growing so this series must be divergent
$endgroup$
– MP3129
Jan 5 at 12:08
$begingroup$
@ErikParkinson Unfortunately Wolfram must be right, because I am writing this series for q=1 and for several different $a$ - for example for 1,2 and really big $a$ to give Wolfram constant values and all the time I get that the series is divergent . Moreover I checked Sum for {n,1,100},{n,1,1000},{n,1,100000} and the sum is constantly growing so this series must be divergent
$endgroup$
– MP3129
Jan 5 at 12:08
|
show 2 more comments
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%2f3062220%2fdecide-about-convergence-of-the-series-for-a0-and-q-in-mathbb-r%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