Depending on the parameter $alpha$ study the convergence of the series $sum_n=2^inftyfraclog(logn)log^alphan$

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











up vote
1
down vote

favorite












Depending on the parameter $alpha$ study the convergence of the series $$sum_n=2^inftyfraclog(logn)log^alphan$$



So for $alpha gt 0$ and $x gt 1$ the function $f(x)=fraclog(logx)log^alphax$ is decreasing so I can use the integral test



which is divergent for $alpha =1$



Is my reasoning right? I don't know what to do next







share|cite|improve this question





















  • How do you prove that the integral diverges?
    – gimusi
    Jul 27 at 6:48










  • I fixed it. I hope it's right
    – J.Dane
    Jul 27 at 7:03










  • It seems uncorrect, try to derive to check. Cauchy condensation test would simplify a lot.
    – gimusi
    Jul 27 at 7:09










  • What is $int u,mathrmdu$? It's not $frac u2+C$. Even when that's fixed, what about $alphane1$?
    – robjohn♦
    Jul 27 at 7:54











  • Yes, I had my integral wrong.
    – J.Dane
    Jul 27 at 7:56














up vote
1
down vote

favorite












Depending on the parameter $alpha$ study the convergence of the series $$sum_n=2^inftyfraclog(logn)log^alphan$$



So for $alpha gt 0$ and $x gt 1$ the function $f(x)=fraclog(logx)log^alphax$ is decreasing so I can use the integral test



which is divergent for $alpha =1$



Is my reasoning right? I don't know what to do next







share|cite|improve this question





















  • How do you prove that the integral diverges?
    – gimusi
    Jul 27 at 6:48










  • I fixed it. I hope it's right
    – J.Dane
    Jul 27 at 7:03










  • It seems uncorrect, try to derive to check. Cauchy condensation test would simplify a lot.
    – gimusi
    Jul 27 at 7:09










  • What is $int u,mathrmdu$? It's not $frac u2+C$. Even when that's fixed, what about $alphane1$?
    – robjohn♦
    Jul 27 at 7:54











  • Yes, I had my integral wrong.
    – J.Dane
    Jul 27 at 7:56












up vote
1
down vote

favorite









up vote
1
down vote

favorite











Depending on the parameter $alpha$ study the convergence of the series $$sum_n=2^inftyfraclog(logn)log^alphan$$



So for $alpha gt 0$ and $x gt 1$ the function $f(x)=fraclog(logx)log^alphax$ is decreasing so I can use the integral test



which is divergent for $alpha =1$



Is my reasoning right? I don't know what to do next







share|cite|improve this question













Depending on the parameter $alpha$ study the convergence of the series $$sum_n=2^inftyfraclog(logn)log^alphan$$



So for $alpha gt 0$ and $x gt 1$ the function $f(x)=fraclog(logx)log^alphax$ is decreasing so I can use the integral test



which is divergent for $alpha =1$



Is my reasoning right? I don't know what to do next









share|cite|improve this question












share|cite|improve this question




share|cite|improve this question








edited Jul 27 at 7:55
























asked Jul 27 at 6:41









J.Dane

159112




159112











  • How do you prove that the integral diverges?
    – gimusi
    Jul 27 at 6:48










  • I fixed it. I hope it's right
    – J.Dane
    Jul 27 at 7:03










  • It seems uncorrect, try to derive to check. Cauchy condensation test would simplify a lot.
    – gimusi
    Jul 27 at 7:09










  • What is $int u,mathrmdu$? It's not $frac u2+C$. Even when that's fixed, what about $alphane1$?
    – robjohn♦
    Jul 27 at 7:54











  • Yes, I had my integral wrong.
    – J.Dane
    Jul 27 at 7:56
















  • How do you prove that the integral diverges?
    – gimusi
    Jul 27 at 6:48










  • I fixed it. I hope it's right
    – J.Dane
    Jul 27 at 7:03










  • It seems uncorrect, try to derive to check. Cauchy condensation test would simplify a lot.
    – gimusi
    Jul 27 at 7:09










  • What is $int u,mathrmdu$? It's not $frac u2+C$. Even when that's fixed, what about $alphane1$?
    – robjohn♦
    Jul 27 at 7:54











  • Yes, I had my integral wrong.
    – J.Dane
    Jul 27 at 7:56















How do you prove that the integral diverges?
– gimusi
Jul 27 at 6:48




How do you prove that the integral diverges?
– gimusi
Jul 27 at 6:48












I fixed it. I hope it's right
– J.Dane
Jul 27 at 7:03




I fixed it. I hope it's right
– J.Dane
Jul 27 at 7:03












It seems uncorrect, try to derive to check. Cauchy condensation test would simplify a lot.
– gimusi
Jul 27 at 7:09




It seems uncorrect, try to derive to check. Cauchy condensation test would simplify a lot.
– gimusi
Jul 27 at 7:09












What is $int u,mathrmdu$? It's not $frac u2+C$. Even when that's fixed, what about $alphane1$?
– robjohn♦
Jul 27 at 7:54





What is $int u,mathrmdu$? It's not $frac u2+C$. Even when that's fixed, what about $alphane1$?
– robjohn♦
Jul 27 at 7:54













Yes, I had my integral wrong.
– J.Dane
Jul 27 at 7:56




Yes, I had my integral wrong.
– J.Dane
Jul 27 at 7:56










3 Answers
3






active

oldest

votes

















up vote
1
down vote



accepted










If you know Bertrand's series, the answer is obvious by the comparison test:



A Bertrand's series is a series
$$sum_n=2^inftyfrac1n^alpha,log^beta nqquad (alpha,betainbf R)$$
and it is known to converge if and only if



  • either $alpha>1$,

  • or $alpha=1$ and $beta>1$.





share|cite|improve this answer





















  • So is this right $frac1n^alpha ltfrac1log^alphan $, $fraclog(logn)n^alpha ltfraclog(logn)log^alphan $, $frac1n^alphalog^-1(logn) ltfraclog(logn)log^alphan $ so $beta=-1$, therefore, the sequence diverges for $alpha lt 1$
    – J.Dane
    Jul 27 at 9:16










  • It's much simpler than that: $;fracloglog nlog^alpha n>frac1log^alpha n$ ($n>2$), and the latter series diverges.
    – Bernard
    Jul 27 at 9:16











  • yes for $alpha lt 1$
    – J.Dane
    Jul 27 at 9:17










  • @J.Dane No, for every $alpha$.
    – Did
    Jul 27 at 11:48

















up vote
2
down vote













We have that eventually (notably for $n>e^e$)



$$fraclog(logn)log^alphange frac1log^alphan$$



and for $alpha>0$



$$sum_n=2^inftyfrac1log^alphan$$



diverges by limit comparison test with $sum_n=2^infty frac1n$ indeed



$$fracfrac1log^alphanfrac1n=fracnlog^alphanto infty$$






share|cite|improve this answer






























    up vote
    1
    down vote













    For all $xgt0$, $log(x)lt x$. Therefore, for all $xgt1$ and $alphagt0$,
    $$
    beginalign
    log(x)^alpha
    &=alpha^alphalog!left(x^1/alpharight)^alpha\
    &ltalpha^alpha x^1/alphacdotalpha\[3pt]
    &=alpha^alpha x
    endalign
    $$
    Therefore, since $log(log(n))ge1$ for $nge16$, it suffices to compare
    $$
    sum_n=2^inftyfrac1log(n)^alphagefrac1alpha^alphasum_n=2^inftyfrac1n
    $$






    share|cite|improve this answer





















    • Very nice and elegant!
      – gimusi
      Jul 27 at 8:01










    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%2f2864111%2fdepending-on-the-parameter-alpha-study-the-convergence-of-the-series-sum-n%23new-answer', 'question_page');

    );

    Post as a guest






























    3 Answers
    3






    active

    oldest

    votes








    3 Answers
    3






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes








    up vote
    1
    down vote



    accepted










    If you know Bertrand's series, the answer is obvious by the comparison test:



    A Bertrand's series is a series
    $$sum_n=2^inftyfrac1n^alpha,log^beta nqquad (alpha,betainbf R)$$
    and it is known to converge if and only if



    • either $alpha>1$,

    • or $alpha=1$ and $beta>1$.





    share|cite|improve this answer





















    • So is this right $frac1n^alpha ltfrac1log^alphan $, $fraclog(logn)n^alpha ltfraclog(logn)log^alphan $, $frac1n^alphalog^-1(logn) ltfraclog(logn)log^alphan $ so $beta=-1$, therefore, the sequence diverges for $alpha lt 1$
      – J.Dane
      Jul 27 at 9:16










    • It's much simpler than that: $;fracloglog nlog^alpha n>frac1log^alpha n$ ($n>2$), and the latter series diverges.
      – Bernard
      Jul 27 at 9:16











    • yes for $alpha lt 1$
      – J.Dane
      Jul 27 at 9:17










    • @J.Dane No, for every $alpha$.
      – Did
      Jul 27 at 11:48














    up vote
    1
    down vote



    accepted










    If you know Bertrand's series, the answer is obvious by the comparison test:



    A Bertrand's series is a series
    $$sum_n=2^inftyfrac1n^alpha,log^beta nqquad (alpha,betainbf R)$$
    and it is known to converge if and only if



    • either $alpha>1$,

    • or $alpha=1$ and $beta>1$.





    share|cite|improve this answer





















    • So is this right $frac1n^alpha ltfrac1log^alphan $, $fraclog(logn)n^alpha ltfraclog(logn)log^alphan $, $frac1n^alphalog^-1(logn) ltfraclog(logn)log^alphan $ so $beta=-1$, therefore, the sequence diverges for $alpha lt 1$
      – J.Dane
      Jul 27 at 9:16










    • It's much simpler than that: $;fracloglog nlog^alpha n>frac1log^alpha n$ ($n>2$), and the latter series diverges.
      – Bernard
      Jul 27 at 9:16











    • yes for $alpha lt 1$
      – J.Dane
      Jul 27 at 9:17










    • @J.Dane No, for every $alpha$.
      – Did
      Jul 27 at 11:48












    up vote
    1
    down vote



    accepted







    up vote
    1
    down vote



    accepted






    If you know Bertrand's series, the answer is obvious by the comparison test:



    A Bertrand's series is a series
    $$sum_n=2^inftyfrac1n^alpha,log^beta nqquad (alpha,betainbf R)$$
    and it is known to converge if and only if



    • either $alpha>1$,

    • or $alpha=1$ and $beta>1$.





    share|cite|improve this answer













    If you know Bertrand's series, the answer is obvious by the comparison test:



    A Bertrand's series is a series
    $$sum_n=2^inftyfrac1n^alpha,log^beta nqquad (alpha,betainbf R)$$
    and it is known to converge if and only if



    • either $alpha>1$,

    • or $alpha=1$ and $beta>1$.






    share|cite|improve this answer













    share|cite|improve this answer



    share|cite|improve this answer











    answered Jul 27 at 8:46









    Bernard

    110k635102




    110k635102











    • So is this right $frac1n^alpha ltfrac1log^alphan $, $fraclog(logn)n^alpha ltfraclog(logn)log^alphan $, $frac1n^alphalog^-1(logn) ltfraclog(logn)log^alphan $ so $beta=-1$, therefore, the sequence diverges for $alpha lt 1$
      – J.Dane
      Jul 27 at 9:16










    • It's much simpler than that: $;fracloglog nlog^alpha n>frac1log^alpha n$ ($n>2$), and the latter series diverges.
      – Bernard
      Jul 27 at 9:16











    • yes for $alpha lt 1$
      – J.Dane
      Jul 27 at 9:17










    • @J.Dane No, for every $alpha$.
      – Did
      Jul 27 at 11:48
















    • So is this right $frac1n^alpha ltfrac1log^alphan $, $fraclog(logn)n^alpha ltfraclog(logn)log^alphan $, $frac1n^alphalog^-1(logn) ltfraclog(logn)log^alphan $ so $beta=-1$, therefore, the sequence diverges for $alpha lt 1$
      – J.Dane
      Jul 27 at 9:16










    • It's much simpler than that: $;fracloglog nlog^alpha n>frac1log^alpha n$ ($n>2$), and the latter series diverges.
      – Bernard
      Jul 27 at 9:16











    • yes for $alpha lt 1$
      – J.Dane
      Jul 27 at 9:17










    • @J.Dane No, for every $alpha$.
      – Did
      Jul 27 at 11:48















    So is this right $frac1n^alpha ltfrac1log^alphan $, $fraclog(logn)n^alpha ltfraclog(logn)log^alphan $, $frac1n^alphalog^-1(logn) ltfraclog(logn)log^alphan $ so $beta=-1$, therefore, the sequence diverges for $alpha lt 1$
    – J.Dane
    Jul 27 at 9:16




    So is this right $frac1n^alpha ltfrac1log^alphan $, $fraclog(logn)n^alpha ltfraclog(logn)log^alphan $, $frac1n^alphalog^-1(logn) ltfraclog(logn)log^alphan $ so $beta=-1$, therefore, the sequence diverges for $alpha lt 1$
    – J.Dane
    Jul 27 at 9:16












    It's much simpler than that: $;fracloglog nlog^alpha n>frac1log^alpha n$ ($n>2$), and the latter series diverges.
    – Bernard
    Jul 27 at 9:16





    It's much simpler than that: $;fracloglog nlog^alpha n>frac1log^alpha n$ ($n>2$), and the latter series diverges.
    – Bernard
    Jul 27 at 9:16













    yes for $alpha lt 1$
    – J.Dane
    Jul 27 at 9:17




    yes for $alpha lt 1$
    – J.Dane
    Jul 27 at 9:17












    @J.Dane No, for every $alpha$.
    – Did
    Jul 27 at 11:48




    @J.Dane No, for every $alpha$.
    – Did
    Jul 27 at 11:48










    up vote
    2
    down vote













    We have that eventually (notably for $n>e^e$)



    $$fraclog(logn)log^alphange frac1log^alphan$$



    and for $alpha>0$



    $$sum_n=2^inftyfrac1log^alphan$$



    diverges by limit comparison test with $sum_n=2^infty frac1n$ indeed



    $$fracfrac1log^alphanfrac1n=fracnlog^alphanto infty$$






    share|cite|improve this answer



























      up vote
      2
      down vote













      We have that eventually (notably for $n>e^e$)



      $$fraclog(logn)log^alphange frac1log^alphan$$



      and for $alpha>0$



      $$sum_n=2^inftyfrac1log^alphan$$



      diverges by limit comparison test with $sum_n=2^infty frac1n$ indeed



      $$fracfrac1log^alphanfrac1n=fracnlog^alphanto infty$$






      share|cite|improve this answer

























        up vote
        2
        down vote










        up vote
        2
        down vote









        We have that eventually (notably for $n>e^e$)



        $$fraclog(logn)log^alphange frac1log^alphan$$



        and for $alpha>0$



        $$sum_n=2^inftyfrac1log^alphan$$



        diverges by limit comparison test with $sum_n=2^infty frac1n$ indeed



        $$fracfrac1log^alphanfrac1n=fracnlog^alphanto infty$$






        share|cite|improve this answer















        We have that eventually (notably for $n>e^e$)



        $$fraclog(logn)log^alphange frac1log^alphan$$



        and for $alpha>0$



        $$sum_n=2^inftyfrac1log^alphan$$



        diverges by limit comparison test with $sum_n=2^infty frac1n$ indeed



        $$fracfrac1log^alphanfrac1n=fracnlog^alphanto infty$$







        share|cite|improve this answer















        share|cite|improve this answer



        share|cite|improve this answer








        edited Jul 27 at 14:21


























        answered Jul 27 at 13:49









        gimusi

        65k73583




        65k73583




















            up vote
            1
            down vote













            For all $xgt0$, $log(x)lt x$. Therefore, for all $xgt1$ and $alphagt0$,
            $$
            beginalign
            log(x)^alpha
            &=alpha^alphalog!left(x^1/alpharight)^alpha\
            &ltalpha^alpha x^1/alphacdotalpha\[3pt]
            &=alpha^alpha x
            endalign
            $$
            Therefore, since $log(log(n))ge1$ for $nge16$, it suffices to compare
            $$
            sum_n=2^inftyfrac1log(n)^alphagefrac1alpha^alphasum_n=2^inftyfrac1n
            $$






            share|cite|improve this answer





















            • Very nice and elegant!
              – gimusi
              Jul 27 at 8:01














            up vote
            1
            down vote













            For all $xgt0$, $log(x)lt x$. Therefore, for all $xgt1$ and $alphagt0$,
            $$
            beginalign
            log(x)^alpha
            &=alpha^alphalog!left(x^1/alpharight)^alpha\
            &ltalpha^alpha x^1/alphacdotalpha\[3pt]
            &=alpha^alpha x
            endalign
            $$
            Therefore, since $log(log(n))ge1$ for $nge16$, it suffices to compare
            $$
            sum_n=2^inftyfrac1log(n)^alphagefrac1alpha^alphasum_n=2^inftyfrac1n
            $$






            share|cite|improve this answer





















            • Very nice and elegant!
              – gimusi
              Jul 27 at 8:01












            up vote
            1
            down vote










            up vote
            1
            down vote









            For all $xgt0$, $log(x)lt x$. Therefore, for all $xgt1$ and $alphagt0$,
            $$
            beginalign
            log(x)^alpha
            &=alpha^alphalog!left(x^1/alpharight)^alpha\
            &ltalpha^alpha x^1/alphacdotalpha\[3pt]
            &=alpha^alpha x
            endalign
            $$
            Therefore, since $log(log(n))ge1$ for $nge16$, it suffices to compare
            $$
            sum_n=2^inftyfrac1log(n)^alphagefrac1alpha^alphasum_n=2^inftyfrac1n
            $$






            share|cite|improve this answer













            For all $xgt0$, $log(x)lt x$. Therefore, for all $xgt1$ and $alphagt0$,
            $$
            beginalign
            log(x)^alpha
            &=alpha^alphalog!left(x^1/alpharight)^alpha\
            &ltalpha^alpha x^1/alphacdotalpha\[3pt]
            &=alpha^alpha x
            endalign
            $$
            Therefore, since $log(log(n))ge1$ for $nge16$, it suffices to compare
            $$
            sum_n=2^inftyfrac1log(n)^alphagefrac1alpha^alphasum_n=2^inftyfrac1n
            $$







            share|cite|improve this answer













            share|cite|improve this answer



            share|cite|improve this answer











            answered Jul 27 at 7:10









            robjohn♦

            258k25297612




            258k25297612











            • Very nice and elegant!
              – gimusi
              Jul 27 at 8:01
















            • Very nice and elegant!
              – gimusi
              Jul 27 at 8:01















            Very nice and elegant!
            – gimusi
            Jul 27 at 8:01




            Very nice and elegant!
            – gimusi
            Jul 27 at 8:01












             

            draft saved


            draft discarded


























             


            draft saved


            draft discarded














            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2864111%2fdepending-on-the-parameter-alpha-study-the-convergence-of-the-series-sum-n%23new-answer', 'question_page');

            );

            Post as a guest













































































            Comments

            Popular posts from this blog

            What is the equation of a 3D cone with generalised tilt?

            Color the edges and diagonals of a regular polygon

            Relationship between determinant of matrix and determinant of adjoint?