Decide about convergence of the series for $a>0$ and $qin mathbb R$












1














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







share|cite|improve this question





























    1














    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







    share|cite|improve this question



























      1












      1








      1







      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







      share|cite|improve this question















      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






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Jan 4 at 23:16









      T. Ford

      431110




      431110










      asked Jan 4 at 23:08









      MP3129MP3129

      956




      956






















          1 Answer
          1






          active

          oldest

          votes


















          1














          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.






          share|cite|improve this answer








          New contributor




          Erik Parkinson is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
          Check out our Code of Conduct.


















          • There are few unfortunate $a$s, which vanish the denominator.
            – user58697
            Jan 5 at 5:02












          • @user58697 The problem states that $a>1$ so the denominator will always be positive.
            – Erik Parkinson
            Jan 5 at 5:04










          • @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
            – MP3129
            Jan 5 at 10:54










          • @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.
            – Erik Parkinson
            Jan 5 at 11:08










          • @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
            – MP3129
            Jan 5 at 12:08











          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
          });


          }
          });














          draft saved

          draft discarded


















          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









          1














          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.






          share|cite|improve this answer








          New contributor




          Erik Parkinson is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
          Check out our Code of Conduct.


















          • There are few unfortunate $a$s, which vanish the denominator.
            – user58697
            Jan 5 at 5:02












          • @user58697 The problem states that $a>1$ so the denominator will always be positive.
            – Erik Parkinson
            Jan 5 at 5:04










          • @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
            – MP3129
            Jan 5 at 10:54










          • @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.
            – Erik Parkinson
            Jan 5 at 11:08










          • @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
            – MP3129
            Jan 5 at 12:08
















          1














          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.






          share|cite|improve this answer








          New contributor




          Erik Parkinson is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
          Check out our Code of Conduct.


















          • There are few unfortunate $a$s, which vanish the denominator.
            – user58697
            Jan 5 at 5:02












          • @user58697 The problem states that $a>1$ so the denominator will always be positive.
            – Erik Parkinson
            Jan 5 at 5:04










          • @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
            – MP3129
            Jan 5 at 10:54










          • @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.
            – Erik Parkinson
            Jan 5 at 11:08










          • @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
            – MP3129
            Jan 5 at 12:08














          1












          1








          1






          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.






          share|cite|improve this answer








          New contributor




          Erik Parkinson is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
          Check out our Code of Conduct.









          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.







          share|cite|improve this answer








          New contributor




          Erik Parkinson is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
          Check out our Code of Conduct.









          share|cite|improve this answer



          share|cite|improve this answer






          New contributor




          Erik Parkinson is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
          Check out our Code of Conduct.









          answered Jan 5 at 0:45









          Erik ParkinsonErik Parkinson

          9159




          9159




          New contributor




          Erik Parkinson is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
          Check out our Code of Conduct.





          New contributor





          Erik Parkinson is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
          Check out our Code of Conduct.






          Erik Parkinson is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
          Check out our Code of Conduct.












          • There are few unfortunate $a$s, which vanish the denominator.
            – user58697
            Jan 5 at 5:02












          • @user58697 The problem states that $a>1$ so the denominator will always be positive.
            – Erik Parkinson
            Jan 5 at 5:04










          • @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
            – MP3129
            Jan 5 at 10:54










          • @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.
            – Erik Parkinson
            Jan 5 at 11:08










          • @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
            – MP3129
            Jan 5 at 12:08


















          • There are few unfortunate $a$s, which vanish the denominator.
            – user58697
            Jan 5 at 5:02












          • @user58697 The problem states that $a>1$ so the denominator will always be positive.
            – Erik Parkinson
            Jan 5 at 5:04










          • @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
            – MP3129
            Jan 5 at 10:54










          • @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.
            – Erik Parkinson
            Jan 5 at 11:08










          • @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
            – MP3129
            Jan 5 at 12:08
















          There are few unfortunate $a$s, which vanish the denominator.
          – user58697
          Jan 5 at 5:02






          There are few unfortunate $a$s, which vanish the denominator.
          – user58697
          Jan 5 at 5:02














          @user58697 The problem states that $a>1$ so the denominator will always be positive.
          – Erik Parkinson
          Jan 5 at 5:04




          @user58697 The problem states that $a>1$ so the denominator will always be positive.
          – Erik Parkinson
          Jan 5 at 5:04












          @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
          – MP3129
          Jan 5 at 10:54




          @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
          – MP3129
          Jan 5 at 10:54












          @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.
          – Erik Parkinson
          Jan 5 at 11:08




          @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.
          – Erik Parkinson
          Jan 5 at 11:08












          @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
          – MP3129
          Jan 5 at 12:08




          @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
          – MP3129
          Jan 5 at 12:08


















          draft saved

          draft discarded




















































          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.




          draft saved


          draft discarded














          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





















































          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







          -

          Popular posts from this blog

          An IMO inspired problem

          Image
          14 4 This problem from IMO 1988 is said to be one of the most elegant ones in functional equations. Problem : The function $f$ is defined on the set of all positive integers as follows: begin{align} f(1) = 1, f(3) &= 3, f(2n) = f(n), \ f(4n+1) &= 2f(2n+1) - f(n), \ f(4n+3) &= 3 f(2n+1) - 2f(n) end{align} Find the number of $n$ with $f(n) = n, 1 leq n leq 1988$. The main idea towards the solution is realizing that these conditions stand for the fact that $f(n)$ just reverses the digits in the binary representation of the number $n$. So, essentially the solution is finding the number of binary pallindromes $leq 1988_{10}$. My question is the following : How to reformulate the problem so that $f(n)$ reverses the digits of $n$ in its ternary representation. Or even better, can we reformulate it for a
          Read more

          Management

          Image
          Management From Wikipedia, the free encyclopedia Jump to navigation Jump to search "Manager" redirects here. For other uses, see Management (disambiguation) and Manager (disambiguation). An organization chart for the United States Coast Guard shows the hierarchy of managerial roles in that organization. Business administration Management of a business Accounting Management accounting Financial accounting Financial audit Business entities Cooperative Corporation Limited liability company Partnership Sole proprietorship State-owned enterprise Corporate governance Annual general meeting Board of directors Supervisory board Advisory board Audit committee Corporate law Commercial law Constitutional documents Contract Corporate crime Corporate liability Insolvency law International trade law Mergers and acquisitions Economics Commodity Pu
          Read more

          Has there ever been an instance of an active nuclear power plant within or near a war zone?

          Image
          36 3 The question Has there ever been a military combat going on around an active (running or in outage but not decommissioned) commercial nuclear power plant? Or dangerously near it? If yes, how did the plant and its personnel fare in such situation? Why I ask Let's assume for the scope of this question modern commercial nuclear power plants (CANDU, PWR, BWR of generation II plus all of gen III and newer) are usually reasonably safe to operate given that the engineering has been done right and there is a whole cohort of very well trained personnel on-site at all times, well rested and with considerable resources on their hands. Things hard to get with an armed conflict like the recent Syrian war raging around. I can't seem to find any reference or a comprehensive article about this, hence this question.
          Read more