limsup of a series












0












$begingroup$


The series is from Rudin's *Principles of Mathematical Analysis$ ("Baby Rudin"), p.67.



$$frac{1}{2}+frac{1}{3}+frac{1}{2^2}+frac{1}{3^2}+... $$



and Rudin claims that
$$limsup_{nto infty} (a_n)^frac{1}{n} = frac{1}{sqrt{2}}.$$



I do not get why this is the case. Can't we pick
$$frac{1}{2^3}, frac{1}{2^6},frac{1}{2^9}ldots $$
or higher powers of $frac{1}{2}$ in which case we get $$limsup (a_{n_k})^{1/n} = frac{1}{3^frac{1}{3}} > frac{1}{sqrt2}.$$






real-analysis sequences-and-series real-numbers







share|cite|improve this question











$endgroup$








  • 2




    $begingroup$
    Because each $3^{-3n}$ is $a_{6n}$ but you apply the root test as if $3^{-3n}=a_{9n}$.
    $endgroup$
    – Did
    Dec 31 '18 at 21:40












  • $begingroup$
    @Did makes a lot of sense. thanks!
    $endgroup$
    – Kaan Yolsever
    Dec 31 '18 at 21:41






  • 3




    $begingroup$
    Reatedly, note that, in your post, $$limsup (a_{n_k})^{1/n}$$ is intrinsically faulty, one should consider $$limsup (a_{n_k})^{1/n_k}$$
    $endgroup$
    – Did
    Dec 31 '18 at 21:42








  • 1




    $begingroup$
    Please do not change thoroughly your post after you received comments (especially when, as here, basically the same idea applies).
    $endgroup$
    – Did
    Dec 31 '18 at 21:47






  • 1




    $begingroup$
    Yu could first and foremost "make sure" to cancel the unfortunate edit on this very page.
    $endgroup$
    – Did
    Dec 31 '18 at 21:48
















0












$begingroup$


The series is from Rudin's *Principles of Mathematical Analysis$ ("Baby Rudin"), p.67.



$$frac{1}{2}+frac{1}{3}+frac{1}{2^2}+frac{1}{3^2}+... $$



and Rudin claims that
$$limsup_{nto infty} (a_n)^frac{1}{n} = frac{1}{sqrt{2}}.$$



I do not get why this is the case. Can't we pick
$$frac{1}{2^3}, frac{1}{2^6},frac{1}{2^9}ldots $$
or higher powers of $frac{1}{2}$ in which case we get $$limsup (a_{n_k})^{1/n} = frac{1}{3^frac{1}{3}} > frac{1}{sqrt2}.$$






real-analysis sequences-and-series real-numbers







share|cite|improve this question











$endgroup$








  • 2




    $begingroup$
    Because each $3^{-3n}$ is $a_{6n}$ but you apply the root test as if $3^{-3n}=a_{9n}$.
    $endgroup$
    – Did
    Dec 31 '18 at 21:40












  • $begingroup$
    @Did makes a lot of sense. thanks!
    $endgroup$
    – Kaan Yolsever
    Dec 31 '18 at 21:41






  • 3




    $begingroup$
    Reatedly, note that, in your post, $$limsup (a_{n_k})^{1/n}$$ is intrinsically faulty, one should consider $$limsup (a_{n_k})^{1/n_k}$$
    $endgroup$
    – Did
    Dec 31 '18 at 21:42








  • 1




    $begingroup$
    Please do not change thoroughly your post after you received comments (especially when, as here, basically the same idea applies).
    $endgroup$
    – Did
    Dec 31 '18 at 21:47






  • 1




    $begingroup$
    Yu could first and foremost "make sure" to cancel the unfortunate edit on this very page.
    $endgroup$
    – Did
    Dec 31 '18 at 21:48














0












0








0





$begingroup$


The series is from Rudin's *Principles of Mathematical Analysis$ ("Baby Rudin"), p.67.



$$frac{1}{2}+frac{1}{3}+frac{1}{2^2}+frac{1}{3^2}+... $$



and Rudin claims that
$$limsup_{nto infty} (a_n)^frac{1}{n} = frac{1}{sqrt{2}}.$$



I do not get why this is the case. Can't we pick
$$frac{1}{2^3}, frac{1}{2^6},frac{1}{2^9}ldots $$
or higher powers of $frac{1}{2}$ in which case we get $$limsup (a_{n_k})^{1/n} = frac{1}{3^frac{1}{3}} > frac{1}{sqrt2}.$$






real-analysis sequences-and-series real-numbers







share|cite|improve this question











$endgroup$




The series is from Rudin's *Principles of Mathematical Analysis$ ("Baby Rudin"), p.67.



$$frac{1}{2}+frac{1}{3}+frac{1}{2^2}+frac{1}{3^2}+... $$



and Rudin claims that
$$limsup_{nto infty} (a_n)^frac{1}{n} = frac{1}{sqrt{2}}.$$



I do not get why this is the case. Can't we pick
$$frac{1}{2^3}, frac{1}{2^6},frac{1}{2^9}ldots $$
or higher powers of $frac{1}{2}$ in which case we get $$limsup (a_{n_k})^{1/n} = frac{1}{3^frac{1}{3}} > frac{1}{sqrt2}.$$






real-analysis sequences-and-series real-numbers




real-analysis sequences-and-series real-numbers






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 31 '18 at 21:49







Kaan Yolsever

















asked Dec 31 '18 at 21:26









Kaan YolseverKaan Yolsever

13710




13710








  • 2




    $begingroup$
    Because each $3^{-3n}$ is $a_{6n}$ but you apply the root test as if $3^{-3n}=a_{9n}$.
    $endgroup$
    – Did
    Dec 31 '18 at 21:40












  • $begingroup$
    @Did makes a lot of sense. thanks!
    $endgroup$
    – Kaan Yolsever
    Dec 31 '18 at 21:41






  • 3




    $begingroup$
    Reatedly, note that, in your post, $$limsup (a_{n_k})^{1/n}$$ is intrinsically faulty, one should consider $$limsup (a_{n_k})^{1/n_k}$$
    $endgroup$
    – Did
    Dec 31 '18 at 21:42








  • 1




    $begingroup$
    Please do not change thoroughly your post after you received comments (especially when, as here, basically the same idea applies).
    $endgroup$
    – Did
    Dec 31 '18 at 21:47






  • 1




    $begingroup$
    Yu could first and foremost "make sure" to cancel the unfortunate edit on this very page.
    $endgroup$
    – Did
    Dec 31 '18 at 21:48














  • 2




    $begingroup$
    Because each $3^{-3n}$ is $a_{6n}$ but you apply the root test as if $3^{-3n}=a_{9n}$.
    $endgroup$
    – Did
    Dec 31 '18 at 21:40












  • $begingroup$
    @Did makes a lot of sense. thanks!
    $endgroup$
    – Kaan Yolsever
    Dec 31 '18 at 21:41






  • 3




    $begingroup$
    Reatedly, note that, in your post, $$limsup (a_{n_k})^{1/n}$$ is intrinsically faulty, one should consider $$limsup (a_{n_k})^{1/n_k}$$
    $endgroup$
    – Did
    Dec 31 '18 at 21:42








  • 1




    $begingroup$
    Please do not change thoroughly your post after you received comments (especially when, as here, basically the same idea applies).
    $endgroup$
    – Did
    Dec 31 '18 at 21:47






  • 1




    $begingroup$
    Yu could first and foremost "make sure" to cancel the unfortunate edit on this very page.
    $endgroup$
    – Did
    Dec 31 '18 at 21:48








2




2




$begingroup$
Because each $3^{-3n}$ is $a_{6n}$ but you apply the root test as if $3^{-3n}=a_{9n}$.
$endgroup$
– Did
Dec 31 '18 at 21:40






$begingroup$
Because each $3^{-3n}$ is $a_{6n}$ but you apply the root test as if $3^{-3n}=a_{9n}$.
$endgroup$
– Did
Dec 31 '18 at 21:40














$begingroup$
@Did makes a lot of sense. thanks!
$endgroup$
– Kaan Yolsever
Dec 31 '18 at 21:41




$begingroup$
@Did makes a lot of sense. thanks!
$endgroup$
– Kaan Yolsever
Dec 31 '18 at 21:41




3




3




$begingroup$
Reatedly, note that, in your post, $$limsup (a_{n_k})^{1/n}$$ is intrinsically faulty, one should consider $$limsup (a_{n_k})^{1/n_k}$$
$endgroup$
– Did
Dec 31 '18 at 21:42






$begingroup$
Reatedly, note that, in your post, $$limsup (a_{n_k})^{1/n}$$ is intrinsically faulty, one should consider $$limsup (a_{n_k})^{1/n_k}$$
$endgroup$
– Did
Dec 31 '18 at 21:42






1




1




$begingroup$
Please do not change thoroughly your post after you received comments (especially when, as here, basically the same idea applies).
$endgroup$
– Did
Dec 31 '18 at 21:47




$begingroup$
Please do not change thoroughly your post after you received comments (especially when, as here, basically the same idea applies).
$endgroup$
– Did
Dec 31 '18 at 21:47




1




1




$begingroup$
Yu could first and foremost "make sure" to cancel the unfortunate edit on this very page.
$endgroup$
– Did
Dec 31 '18 at 21:48




$begingroup$
Yu could first and foremost "make sure" to cancel the unfortunate edit on this very page.
$endgroup$
– Did
Dec 31 '18 at 21:48










1 Answer
1






active

oldest

votes


















1












$begingroup$

One way, perhaps easier, to see what's going on, is to observe that:0



$$a_1=frac12;,;a_2=frac13;,;a_3=frac1{2^2};,;a_4=frac1{3^2};...$$



Clearly, to get the supremum of the above we have to take the odd numbered elements:



$$a_1,,a_3,,a_5,,....implies limsup_{ntoinfty}sqrt[n]{a_n}=limsup_{ntoinfty}sqrt[2n-1]{frac1{2^n}}=frac1{sqrt2}$$



Because at index $;1=2cdot1-1;$, we have $;frac12;$ , at index $;2cdot2-1=3;$, we have $;frac1{2^2};$, ...at index $;2n-1;$ , we have $;frac1{2^n};$ ...



or taking $;k;$ to be a general odd index, the corresponding element here is $;cfrac1{2^{frac{k+1}2}};$ , so again



$$limsup_{ktoinfty}sqrt[k]{frac1{2^{frac k2+frac12}}}=limsup_{ktoinfty}frac1{2^{1/2}sqrt[k]{sqrt2}}=frac1{sqrt2}$$






share|cite|improve this answer









$endgroup$














    Your Answer








    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%2f3058051%2flimsup-of-a-series%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












    $begingroup$

    One way, perhaps easier, to see what's going on, is to observe that:0



    $$a_1=frac12;,;a_2=frac13;,;a_3=frac1{2^2};,;a_4=frac1{3^2};...$$



    Clearly, to get the supremum of the above we have to take the odd numbered elements:



    $$a_1,,a_3,,a_5,,....implies limsup_{ntoinfty}sqrt[n]{a_n}=limsup_{ntoinfty}sqrt[2n-1]{frac1{2^n}}=frac1{sqrt2}$$



    Because at index $;1=2cdot1-1;$, we have $;frac12;$ , at index $;2cdot2-1=3;$, we have $;frac1{2^2};$, ...at index $;2n-1;$ , we have $;frac1{2^n};$ ...



    or taking $;k;$ to be a general odd index, the corresponding element here is $;cfrac1{2^{frac{k+1}2}};$ , so again



    $$limsup_{ktoinfty}sqrt[k]{frac1{2^{frac k2+frac12}}}=limsup_{ktoinfty}frac1{2^{1/2}sqrt[k]{sqrt2}}=frac1{sqrt2}$$






    share|cite|improve this answer









    $endgroup$


















      1












      $begingroup$

      One way, perhaps easier, to see what's going on, is to observe that:0



      $$a_1=frac12;,;a_2=frac13;,;a_3=frac1{2^2};,;a_4=frac1{3^2};...$$



      Clearly, to get the supremum of the above we have to take the odd numbered elements:



      $$a_1,,a_3,,a_5,,....implies limsup_{ntoinfty}sqrt[n]{a_n}=limsup_{ntoinfty}sqrt[2n-1]{frac1{2^n}}=frac1{sqrt2}$$



      Because at index $;1=2cdot1-1;$, we have $;frac12;$ , at index $;2cdot2-1=3;$, we have $;frac1{2^2};$, ...at index $;2n-1;$ , we have $;frac1{2^n};$ ...



      or taking $;k;$ to be a general odd index, the corresponding element here is $;cfrac1{2^{frac{k+1}2}};$ , so again



      $$limsup_{ktoinfty}sqrt[k]{frac1{2^{frac k2+frac12}}}=limsup_{ktoinfty}frac1{2^{1/2}sqrt[k]{sqrt2}}=frac1{sqrt2}$$






      share|cite|improve this answer









      $endgroup$
















        1












        1








        1





        $begingroup$

        One way, perhaps easier, to see what's going on, is to observe that:0



        $$a_1=frac12;,;a_2=frac13;,;a_3=frac1{2^2};,;a_4=frac1{3^2};...$$



        Clearly, to get the supremum of the above we have to take the odd numbered elements:



        $$a_1,,a_3,,a_5,,....implies limsup_{ntoinfty}sqrt[n]{a_n}=limsup_{ntoinfty}sqrt[2n-1]{frac1{2^n}}=frac1{sqrt2}$$



        Because at index $;1=2cdot1-1;$, we have $;frac12;$ , at index $;2cdot2-1=3;$, we have $;frac1{2^2};$, ...at index $;2n-1;$ , we have $;frac1{2^n};$ ...



        or taking $;k;$ to be a general odd index, the corresponding element here is $;cfrac1{2^{frac{k+1}2}};$ , so again



        $$limsup_{ktoinfty}sqrt[k]{frac1{2^{frac k2+frac12}}}=limsup_{ktoinfty}frac1{2^{1/2}sqrt[k]{sqrt2}}=frac1{sqrt2}$$






        share|cite|improve this answer









        $endgroup$



        One way, perhaps easier, to see what's going on, is to observe that:0



        $$a_1=frac12;,;a_2=frac13;,;a_3=frac1{2^2};,;a_4=frac1{3^2};...$$



        Clearly, to get the supremum of the above we have to take the odd numbered elements:



        $$a_1,,a_3,,a_5,,....implies limsup_{ntoinfty}sqrt[n]{a_n}=limsup_{ntoinfty}sqrt[2n-1]{frac1{2^n}}=frac1{sqrt2}$$



        Because at index $;1=2cdot1-1;$, we have $;frac12;$ , at index $;2cdot2-1=3;$, we have $;frac1{2^2};$, ...at index $;2n-1;$ , we have $;frac1{2^n};$ ...



        or taking $;k;$ to be a general odd index, the corresponding element here is $;cfrac1{2^{frac{k+1}2}};$ , so again



        $$limsup_{ktoinfty}sqrt[k]{frac1{2^{frac k2+frac12}}}=limsup_{ktoinfty}frac1{2^{1/2}sqrt[k]{sqrt2}}=frac1{sqrt2}$$







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Dec 31 '18 at 22:38









        DonAntonioDonAntonio

        180k1495233




        180k1495233






























            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%2f3058051%2flimsup-of-a-series%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

            mysqli_query(): Empty query in /home/lucindabrummitt/public_html/blog/wp-includes/wp-db.php on line 1924

            Image
            0 I just uploaded a new plugin to my wordpress site and I got this warning: mysqli_query(): Empty query in /home/lucindabrummitt/public_html/blog/wp-includes/wp-db.php on line 1924 Usually if I have a problem, I can find answers on google but this one seems pretty particular and I'm not finding any info on it except for this forum. I'm not terribly techie but if someone can tell me how to read this and how to change it I can follow directions pretty well. Thanks All! PS If I don't have the proper tags here could someone add the appropriate tags? php mysql wordpress share | improve this question asked Nov 16 '18 at 20:41 ...
            Read more

            How to change which sound is reproduced for terminal bell?

            Image
            3 Recently upgrade to 18.10 from 18.04, and using the terminal is becoming annoying: the new alert sound is a drip ( /usr/share/sounds/gnome/default/alerts/drip.ogg ), and the previous one is still located at ( /usr/share/sounds/ubuntu/stereo/bell.ogg ). My issue is that at the gnome-terminal, when autocompleting or pressing left BOTH sounds are reproduced, at the same time. I want to just have ubuntu/stereo/bell.ogg active, not both . At the moment I have been only able to reduce the volume of the alerts (but still both are played), or turn the alerts down (but I dislike both "solutions"). gnome-terminal 18.10 teminal-bell share | improve this question ...
            Read more

            Can I use Tabulator js library in my java Spring + Thymeleaf project?

            Image
            0 I want to add Tabulator js to my java project. I added tabulator.min.js, tabulator.min.css to resources folder. After that added to my html page these dependencies as recommending in readme.md. <link rel="stylesheet" th:href="@{/css/tabulator.min.css}"> <script type="text/javascript" th:src="@{/js/tabulator.min.js}"></script> Now my tables view all elements, that I have in the html page, but not correct. In the documentation of Tabulator is example how to create header and table, var table = new Tabulator("#example-table", { columns:[ {title:"Name", field:"name", sorter:"string", width:200, editor:true}, {title:"Age", field:"age", sorter:"...
            Read more