Decide whether the series are absolutely convergent , conditionally convergent, or divergent.

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
0
down vote

favorite
2












Decide whether the series are absolutely convergent, conditionally convergent, or divergent.



$$a) sum _n=1^infty (-1)^n frac(log n)^log nn^a , a>0$$



$$b) sum_n=1^infty frac (-1)^[log n]n$$ where [ ] is greatest integer symbol.



My attempt : the easiest way to think about this problem is the Leibniz test both $a)$ and $b)$ will be conditionally convergents.



Is it correct ?



any hints/solutions



thanks u







share|cite|improve this question


























    up vote
    0
    down vote

    favorite
    2












    Decide whether the series are absolutely convergent, conditionally convergent, or divergent.



    $$a) sum _n=1^infty (-1)^n frac(log n)^log nn^a , a>0$$



    $$b) sum_n=1^infty frac (-1)^[log n]n$$ where [ ] is greatest integer symbol.



    My attempt : the easiest way to think about this problem is the Leibniz test both $a)$ and $b)$ will be conditionally convergents.



    Is it correct ?



    any hints/solutions



    thanks u







    share|cite|improve this question
























      up vote
      0
      down vote

      favorite
      2









      up vote
      0
      down vote

      favorite
      2






      2





      Decide whether the series are absolutely convergent, conditionally convergent, or divergent.



      $$a) sum _n=1^infty (-1)^n frac(log n)^log nn^a , a>0$$



      $$b) sum_n=1^infty frac (-1)^[log n]n$$ where [ ] is greatest integer symbol.



      My attempt : the easiest way to think about this problem is the Leibniz test both $a)$ and $b)$ will be conditionally convergents.



      Is it correct ?



      any hints/solutions



      thanks u







      share|cite|improve this question














      Decide whether the series are absolutely convergent, conditionally convergent, or divergent.



      $$a) sum _n=1^infty (-1)^n frac(log n)^log nn^a , a>0$$



      $$b) sum_n=1^infty frac (-1)^[log n]n$$ where [ ] is greatest integer symbol.



      My attempt : the easiest way to think about this problem is the Leibniz test both $a)$ and $b)$ will be conditionally convergents.



      Is it correct ?



      any hints/solutions



      thanks u









      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Aug 11 at 6:42









      gimusi

      66.1k73685




      66.1k73685










      asked Aug 10 at 21:44









      stupid

      58419




      58419




















          2 Answers
          2






          active

          oldest

          votes

















          up vote
          -1
          down vote



          accepted










          For the first one we have that



          $$frac(log n)^log nn^ato infty$$



          indeed by $x=e^y to infty$ as $yge e^2a$



          $$frac(log x)^log xx^a=fracy^ye^aygefrace^2aye^ay=e^ayto infty$$



          therefore the given series diverges.



          For the second one we can write



          $$sum_n=1^infty frac (-1)^[log n]n=sum_n=1^1 frac 1n-sum_n=2^2 frac 1n+sum_n=3^7 frac 1n-sum_n=8^20 frac 1n+ldots+(-1)^k+1sum_n=[e^k]^[e^k+1-1] frac 1n+ldots =sum_k=1^infty (-1)^k+1 a_k$$



          that is an alternating sum of terms not convergent to zero and thus it diverges too, indeed as $kto infty$ by harmonic series



          $$a_k=sum_n=[e^k]^[e^k+1-1] frac 1nsim log (e^k+1)-log(e^k)=k+1-k=1$$






          share|cite|improve this answer






















          • @RushabhMehta Once $a_n not to 0$ the series diverges anyway, the$ (-1)^n$ factor is completely useless to conclude here.
            – gimusi
            Aug 10 at 22:17











          • @RushabhMehta For the second one I'm thinking about it, it is not so trivial as the first one.
            – gimusi
            Aug 10 at 22:18










          • @RushabhMehta Now it should be complete. And please revise also your wrong first coment about the $(-1)^n$ term.
            – gimusi
            Aug 10 at 22:44










          • thanks u @gimusi..one last confusion how $y ge e^2a$ ?
            – stupid
            Aug 10 at 23:51






          • 1




            @stupid As $y ge e^2a$ we have $(y)^yge (e^2a)^y=e^2ay$. Why are you considering $log(log y)>2$?
            – gimusi
            Aug 11 at 6:41

















          up vote
          1
          down vote













          For the second part note that for $n$ between $e^k$ and $e ^k+1$, $(-1)^[log n]$ has a constant sign. Compare $sum_[e^k]^[e^k+1] frac 1 n$ with the integral of $frac 1 x $ from $[e^k]$ to $[e^k+1]$ to see that the sum of the terms from $[e^k]$ to $[e^k+1]$ does not tend to $0$. Hence the series is divergent.






          share|cite|improve this answer




















          • sir how $e^k $ and$ e^k+1$ come ?
            – stupid
            Aug 10 at 23:43






          • 1




            @stupid If $[ln n]=k$ then $k leq ln n < k+1$. This gives $e^k <n <e^k+1$.
            – Kavi Rama Murthy
            Aug 11 at 0:36











          • sir thanks u...
            – stupid
            Aug 11 at 0:43










          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',
          convertImagesToLinks: true,
          noModals: false,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: 10,
          bindNavPrevention: true,
          postfix: "",
          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%2f2878837%2fdecide-whether-the-series-are-absolutely-convergent-conditionally-convergent%23new-answer', 'question_page');

          );

          Post as a guest






























          2 Answers
          2






          active

          oldest

          votes








          2 Answers
          2






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes








          up vote
          -1
          down vote



          accepted










          For the first one we have that



          $$frac(log n)^log nn^ato infty$$



          indeed by $x=e^y to infty$ as $yge e^2a$



          $$frac(log x)^log xx^a=fracy^ye^aygefrace^2aye^ay=e^ayto infty$$



          therefore the given series diverges.



          For the second one we can write



          $$sum_n=1^infty frac (-1)^[log n]n=sum_n=1^1 frac 1n-sum_n=2^2 frac 1n+sum_n=3^7 frac 1n-sum_n=8^20 frac 1n+ldots+(-1)^k+1sum_n=[e^k]^[e^k+1-1] frac 1n+ldots =sum_k=1^infty (-1)^k+1 a_k$$



          that is an alternating sum of terms not convergent to zero and thus it diverges too, indeed as $kto infty$ by harmonic series



          $$a_k=sum_n=[e^k]^[e^k+1-1] frac 1nsim log (e^k+1)-log(e^k)=k+1-k=1$$






          share|cite|improve this answer






















          • @RushabhMehta Once $a_n not to 0$ the series diverges anyway, the$ (-1)^n$ factor is completely useless to conclude here.
            – gimusi
            Aug 10 at 22:17











          • @RushabhMehta For the second one I'm thinking about it, it is not so trivial as the first one.
            – gimusi
            Aug 10 at 22:18










          • @RushabhMehta Now it should be complete. And please revise also your wrong first coment about the $(-1)^n$ term.
            – gimusi
            Aug 10 at 22:44










          • thanks u @gimusi..one last confusion how $y ge e^2a$ ?
            – stupid
            Aug 10 at 23:51






          • 1




            @stupid As $y ge e^2a$ we have $(y)^yge (e^2a)^y=e^2ay$. Why are you considering $log(log y)>2$?
            – gimusi
            Aug 11 at 6:41














          up vote
          -1
          down vote



          accepted










          For the first one we have that



          $$frac(log n)^log nn^ato infty$$



          indeed by $x=e^y to infty$ as $yge e^2a$



          $$frac(log x)^log xx^a=fracy^ye^aygefrace^2aye^ay=e^ayto infty$$



          therefore the given series diverges.



          For the second one we can write



          $$sum_n=1^infty frac (-1)^[log n]n=sum_n=1^1 frac 1n-sum_n=2^2 frac 1n+sum_n=3^7 frac 1n-sum_n=8^20 frac 1n+ldots+(-1)^k+1sum_n=[e^k]^[e^k+1-1] frac 1n+ldots =sum_k=1^infty (-1)^k+1 a_k$$



          that is an alternating sum of terms not convergent to zero and thus it diverges too, indeed as $kto infty$ by harmonic series



          $$a_k=sum_n=[e^k]^[e^k+1-1] frac 1nsim log (e^k+1)-log(e^k)=k+1-k=1$$






          share|cite|improve this answer






















          • @RushabhMehta Once $a_n not to 0$ the series diverges anyway, the$ (-1)^n$ factor is completely useless to conclude here.
            – gimusi
            Aug 10 at 22:17











          • @RushabhMehta For the second one I'm thinking about it, it is not so trivial as the first one.
            – gimusi
            Aug 10 at 22:18










          • @RushabhMehta Now it should be complete. And please revise also your wrong first coment about the $(-1)^n$ term.
            – gimusi
            Aug 10 at 22:44










          • thanks u @gimusi..one last confusion how $y ge e^2a$ ?
            – stupid
            Aug 10 at 23:51






          • 1




            @stupid As $y ge e^2a$ we have $(y)^yge (e^2a)^y=e^2ay$. Why are you considering $log(log y)>2$?
            – gimusi
            Aug 11 at 6:41












          up vote
          -1
          down vote



          accepted







          up vote
          -1
          down vote



          accepted






          For the first one we have that



          $$frac(log n)^log nn^ato infty$$



          indeed by $x=e^y to infty$ as $yge e^2a$



          $$frac(log x)^log xx^a=fracy^ye^aygefrace^2aye^ay=e^ayto infty$$



          therefore the given series diverges.



          For the second one we can write



          $$sum_n=1^infty frac (-1)^[log n]n=sum_n=1^1 frac 1n-sum_n=2^2 frac 1n+sum_n=3^7 frac 1n-sum_n=8^20 frac 1n+ldots+(-1)^k+1sum_n=[e^k]^[e^k+1-1] frac 1n+ldots =sum_k=1^infty (-1)^k+1 a_k$$



          that is an alternating sum of terms not convergent to zero and thus it diverges too, indeed as $kto infty$ by harmonic series



          $$a_k=sum_n=[e^k]^[e^k+1-1] frac 1nsim log (e^k+1)-log(e^k)=k+1-k=1$$






          share|cite|improve this answer














          For the first one we have that



          $$frac(log n)^log nn^ato infty$$



          indeed by $x=e^y to infty$ as $yge e^2a$



          $$frac(log x)^log xx^a=fracy^ye^aygefrace^2aye^ay=e^ayto infty$$



          therefore the given series diverges.



          For the second one we can write



          $$sum_n=1^infty frac (-1)^[log n]n=sum_n=1^1 frac 1n-sum_n=2^2 frac 1n+sum_n=3^7 frac 1n-sum_n=8^20 frac 1n+ldots+(-1)^k+1sum_n=[e^k]^[e^k+1-1] frac 1n+ldots =sum_k=1^infty (-1)^k+1 a_k$$



          that is an alternating sum of terms not convergent to zero and thus it diverges too, indeed as $kto infty$ by harmonic series



          $$a_k=sum_n=[e^k]^[e^k+1-1] frac 1nsim log (e^k+1)-log(e^k)=k+1-k=1$$







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Aug 11 at 22:36

























          answered Aug 10 at 22:03









          gimusi

          66.1k73685




          66.1k73685











          • @RushabhMehta Once $a_n not to 0$ the series diverges anyway, the$ (-1)^n$ factor is completely useless to conclude here.
            – gimusi
            Aug 10 at 22:17











          • @RushabhMehta For the second one I'm thinking about it, it is not so trivial as the first one.
            – gimusi
            Aug 10 at 22:18










          • @RushabhMehta Now it should be complete. And please revise also your wrong first coment about the $(-1)^n$ term.
            – gimusi
            Aug 10 at 22:44










          • thanks u @gimusi..one last confusion how $y ge e^2a$ ?
            – stupid
            Aug 10 at 23:51






          • 1




            @stupid As $y ge e^2a$ we have $(y)^yge (e^2a)^y=e^2ay$. Why are you considering $log(log y)>2$?
            – gimusi
            Aug 11 at 6:41
















          • @RushabhMehta Once $a_n not to 0$ the series diverges anyway, the$ (-1)^n$ factor is completely useless to conclude here.
            – gimusi
            Aug 10 at 22:17











          • @RushabhMehta For the second one I'm thinking about it, it is not so trivial as the first one.
            – gimusi
            Aug 10 at 22:18










          • @RushabhMehta Now it should be complete. And please revise also your wrong first coment about the $(-1)^n$ term.
            – gimusi
            Aug 10 at 22:44










          • thanks u @gimusi..one last confusion how $y ge e^2a$ ?
            – stupid
            Aug 10 at 23:51






          • 1




            @stupid As $y ge e^2a$ we have $(y)^yge (e^2a)^y=e^2ay$. Why are you considering $log(log y)>2$?
            – gimusi
            Aug 11 at 6:41















          @RushabhMehta Once $a_n not to 0$ the series diverges anyway, the$ (-1)^n$ factor is completely useless to conclude here.
          – gimusi
          Aug 10 at 22:17





          @RushabhMehta Once $a_n not to 0$ the series diverges anyway, the$ (-1)^n$ factor is completely useless to conclude here.
          – gimusi
          Aug 10 at 22:17













          @RushabhMehta For the second one I'm thinking about it, it is not so trivial as the first one.
          – gimusi
          Aug 10 at 22:18




          @RushabhMehta For the second one I'm thinking about it, it is not so trivial as the first one.
          – gimusi
          Aug 10 at 22:18












          @RushabhMehta Now it should be complete. And please revise also your wrong first coment about the $(-1)^n$ term.
          – gimusi
          Aug 10 at 22:44




          @RushabhMehta Now it should be complete. And please revise also your wrong first coment about the $(-1)^n$ term.
          – gimusi
          Aug 10 at 22:44












          thanks u @gimusi..one last confusion how $y ge e^2a$ ?
          – stupid
          Aug 10 at 23:51




          thanks u @gimusi..one last confusion how $y ge e^2a$ ?
          – stupid
          Aug 10 at 23:51




          1




          1




          @stupid As $y ge e^2a$ we have $(y)^yge (e^2a)^y=e^2ay$. Why are you considering $log(log y)>2$?
          – gimusi
          Aug 11 at 6:41




          @stupid As $y ge e^2a$ we have $(y)^yge (e^2a)^y=e^2ay$. Why are you considering $log(log y)>2$?
          – gimusi
          Aug 11 at 6:41










          up vote
          1
          down vote













          For the second part note that for $n$ between $e^k$ and $e ^k+1$, $(-1)^[log n]$ has a constant sign. Compare $sum_[e^k]^[e^k+1] frac 1 n$ with the integral of $frac 1 x $ from $[e^k]$ to $[e^k+1]$ to see that the sum of the terms from $[e^k]$ to $[e^k+1]$ does not tend to $0$. Hence the series is divergent.






          share|cite|improve this answer




















          • sir how $e^k $ and$ e^k+1$ come ?
            – stupid
            Aug 10 at 23:43






          • 1




            @stupid If $[ln n]=k$ then $k leq ln n < k+1$. This gives $e^k <n <e^k+1$.
            – Kavi Rama Murthy
            Aug 11 at 0:36











          • sir thanks u...
            – stupid
            Aug 11 at 0:43














          up vote
          1
          down vote













          For the second part note that for $n$ between $e^k$ and $e ^k+1$, $(-1)^[log n]$ has a constant sign. Compare $sum_[e^k]^[e^k+1] frac 1 n$ with the integral of $frac 1 x $ from $[e^k]$ to $[e^k+1]$ to see that the sum of the terms from $[e^k]$ to $[e^k+1]$ does not tend to $0$. Hence the series is divergent.






          share|cite|improve this answer




















          • sir how $e^k $ and$ e^k+1$ come ?
            – stupid
            Aug 10 at 23:43






          • 1




            @stupid If $[ln n]=k$ then $k leq ln n < k+1$. This gives $e^k <n <e^k+1$.
            – Kavi Rama Murthy
            Aug 11 at 0:36











          • sir thanks u...
            – stupid
            Aug 11 at 0:43












          up vote
          1
          down vote










          up vote
          1
          down vote









          For the second part note that for $n$ between $e^k$ and $e ^k+1$, $(-1)^[log n]$ has a constant sign. Compare $sum_[e^k]^[e^k+1] frac 1 n$ with the integral of $frac 1 x $ from $[e^k]$ to $[e^k+1]$ to see that the sum of the terms from $[e^k]$ to $[e^k+1]$ does not tend to $0$. Hence the series is divergent.






          share|cite|improve this answer












          For the second part note that for $n$ between $e^k$ and $e ^k+1$, $(-1)^[log n]$ has a constant sign. Compare $sum_[e^k]^[e^k+1] frac 1 n$ with the integral of $frac 1 x $ from $[e^k]$ to $[e^k+1]$ to see that the sum of the terms from $[e^k]$ to $[e^k+1]$ does not tend to $0$. Hence the series is divergent.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Aug 10 at 23:30









          Kavi Rama Murthy

          21.8k2932




          21.8k2932











          • sir how $e^k $ and$ e^k+1$ come ?
            – stupid
            Aug 10 at 23:43






          • 1




            @stupid If $[ln n]=k$ then $k leq ln n < k+1$. This gives $e^k <n <e^k+1$.
            – Kavi Rama Murthy
            Aug 11 at 0:36











          • sir thanks u...
            – stupid
            Aug 11 at 0:43
















          • sir how $e^k $ and$ e^k+1$ come ?
            – stupid
            Aug 10 at 23:43






          • 1




            @stupid If $[ln n]=k$ then $k leq ln n < k+1$. This gives $e^k <n <e^k+1$.
            – Kavi Rama Murthy
            Aug 11 at 0:36











          • sir thanks u...
            – stupid
            Aug 11 at 0:43















          sir how $e^k $ and$ e^k+1$ come ?
          – stupid
          Aug 10 at 23:43




          sir how $e^k $ and$ e^k+1$ come ?
          – stupid
          Aug 10 at 23:43




          1




          1




          @stupid If $[ln n]=k$ then $k leq ln n < k+1$. This gives $e^k <n <e^k+1$.
          – Kavi Rama Murthy
          Aug 11 at 0:36





          @stupid If $[ln n]=k$ then $k leq ln n < k+1$. This gives $e^k <n <e^k+1$.
          – Kavi Rama Murthy
          Aug 11 at 0:36













          sir thanks u...
          – stupid
          Aug 11 at 0:43




          sir thanks u...
          – stupid
          Aug 11 at 0:43












           

          draft saved


          draft discarded


























           


          draft saved


          draft discarded














          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2878837%2fdecide-whether-the-series-are-absolutely-convergent-conditionally-convergent%23new-answer', 'question_page');

          );

          Post as a guest













































































          這個網誌中的熱門文章

          How to combine Bézier curves to a surface?

          Carbon dioxide

          Why am i infinitely getting the same tweet with the Twitter Search API?