$sum_{i=1}^{infty}frac{1}{a_i}$ converges.,prove that $lim_{n to infty}frac{b_n}{n}=0$.












3














Help: Let $a_1,a_2,...$ be positive integers such that $sum_{i=1}^{infty}frac{1}{a_i}$ converges. For each $n$, let $b_n$ denote the number of positive integers $i$ for which $a_i leq n$. prove that $lim_{n to infty}frac{b_n}{n}=0$.



Intuitively, $a_i$ should grow large fast enough for $1/a_i$ to converge. so gap between $a_i$ should be bigger and bigger? Is this the right idea?










share|cite|improve this question




















  • 1




    You have tagged this "contest-math". Which contest, please?
    – Gerry Myerson
    Nov 23 at 6:30






  • 1




    Putnam contest 1964 B1
    – mathnoob
    Nov 23 at 6:31










  • I was thinking on using the squeeze, but upon reading the question more carefully, it is actually tricky.
    – Jimmy Sabater
    Nov 23 at 6:32
















3














Help: Let $a_1,a_2,...$ be positive integers such that $sum_{i=1}^{infty}frac{1}{a_i}$ converges. For each $n$, let $b_n$ denote the number of positive integers $i$ for which $a_i leq n$. prove that $lim_{n to infty}frac{b_n}{n}=0$.



Intuitively, $a_i$ should grow large fast enough for $1/a_i$ to converge. so gap between $a_i$ should be bigger and bigger? Is this the right idea?










share|cite|improve this question




















  • 1




    You have tagged this "contest-math". Which contest, please?
    – Gerry Myerson
    Nov 23 at 6:30






  • 1




    Putnam contest 1964 B1
    – mathnoob
    Nov 23 at 6:31










  • I was thinking on using the squeeze, but upon reading the question more carefully, it is actually tricky.
    – Jimmy Sabater
    Nov 23 at 6:32














3












3








3


1





Help: Let $a_1,a_2,...$ be positive integers such that $sum_{i=1}^{infty}frac{1}{a_i}$ converges. For each $n$, let $b_n$ denote the number of positive integers $i$ for which $a_i leq n$. prove that $lim_{n to infty}frac{b_n}{n}=0$.



Intuitively, $a_i$ should grow large fast enough for $1/a_i$ to converge. so gap between $a_i$ should be bigger and bigger? Is this the right idea?










share|cite|improve this question















Help: Let $a_1,a_2,...$ be positive integers such that $sum_{i=1}^{infty}frac{1}{a_i}$ converges. For each $n$, let $b_n$ denote the number of positive integers $i$ for which $a_i leq n$. prove that $lim_{n to infty}frac{b_n}{n}=0$.



Intuitively, $a_i$ should grow large fast enough for $1/a_i$ to converge. so gap between $a_i$ should be bigger and bigger? Is this the right idea?







calculus summation contest-math






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 23 at 6:33

























asked Nov 23 at 6:22









mathnoob

1,761422




1,761422








  • 1




    You have tagged this "contest-math". Which contest, please?
    – Gerry Myerson
    Nov 23 at 6:30






  • 1




    Putnam contest 1964 B1
    – mathnoob
    Nov 23 at 6:31










  • I was thinking on using the squeeze, but upon reading the question more carefully, it is actually tricky.
    – Jimmy Sabater
    Nov 23 at 6:32














  • 1




    You have tagged this "contest-math". Which contest, please?
    – Gerry Myerson
    Nov 23 at 6:30






  • 1




    Putnam contest 1964 B1
    – mathnoob
    Nov 23 at 6:31










  • I was thinking on using the squeeze, but upon reading the question more carefully, it is actually tricky.
    – Jimmy Sabater
    Nov 23 at 6:32








1




1




You have tagged this "contest-math". Which contest, please?
– Gerry Myerson
Nov 23 at 6:30




You have tagged this "contest-math". Which contest, please?
– Gerry Myerson
Nov 23 at 6:30




1




1




Putnam contest 1964 B1
– mathnoob
Nov 23 at 6:31




Putnam contest 1964 B1
– mathnoob
Nov 23 at 6:31












I was thinking on using the squeeze, but upon reading the question more carefully, it is actually tricky.
– Jimmy Sabater
Nov 23 at 6:32




I was thinking on using the squeeze, but upon reading the question more carefully, it is actually tricky.
– Jimmy Sabater
Nov 23 at 6:32










1 Answer
1






active

oldest

votes


















4














Let $epsilon >0$ and choose $N$ such that $sum_{i=N}^{infty} frac 1 {a_i} <epsilon$. Let $J_n={i>N:a_i leq n}$. Then $sum_{iin J_n} frac 1 nleq sum_{iin J_n} frac 1 {a_i} <epsilon$. Hence $frac {card(J_n)} n <epsilon$ for all $n$. Now $b_n leq N+card(J_n)$ so $frac {b_n} n leq epsilon +frac N n to epsilon $ as $n to infty$.






share|cite|improve this answer





















    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%2f3010034%2fsum-i-1-infty-frac1a-i-converges-prove-that-lim-n-to-infty-fr%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









    4














    Let $epsilon >0$ and choose $N$ such that $sum_{i=N}^{infty} frac 1 {a_i} <epsilon$. Let $J_n={i>N:a_i leq n}$. Then $sum_{iin J_n} frac 1 nleq sum_{iin J_n} frac 1 {a_i} <epsilon$. Hence $frac {card(J_n)} n <epsilon$ for all $n$. Now $b_n leq N+card(J_n)$ so $frac {b_n} n leq epsilon +frac N n to epsilon $ as $n to infty$.






    share|cite|improve this answer


























      4














      Let $epsilon >0$ and choose $N$ such that $sum_{i=N}^{infty} frac 1 {a_i} <epsilon$. Let $J_n={i>N:a_i leq n}$. Then $sum_{iin J_n} frac 1 nleq sum_{iin J_n} frac 1 {a_i} <epsilon$. Hence $frac {card(J_n)} n <epsilon$ for all $n$. Now $b_n leq N+card(J_n)$ so $frac {b_n} n leq epsilon +frac N n to epsilon $ as $n to infty$.






      share|cite|improve this answer
























        4












        4








        4






        Let $epsilon >0$ and choose $N$ such that $sum_{i=N}^{infty} frac 1 {a_i} <epsilon$. Let $J_n={i>N:a_i leq n}$. Then $sum_{iin J_n} frac 1 nleq sum_{iin J_n} frac 1 {a_i} <epsilon$. Hence $frac {card(J_n)} n <epsilon$ for all $n$. Now $b_n leq N+card(J_n)$ so $frac {b_n} n leq epsilon +frac N n to epsilon $ as $n to infty$.






        share|cite|improve this answer












        Let $epsilon >0$ and choose $N$ such that $sum_{i=N}^{infty} frac 1 {a_i} <epsilon$. Let $J_n={i>N:a_i leq n}$. Then $sum_{iin J_n} frac 1 nleq sum_{iin J_n} frac 1 {a_i} <epsilon$. Hence $frac {card(J_n)} n <epsilon$ for all $n$. Now $b_n leq N+card(J_n)$ so $frac {b_n} n leq epsilon +frac N n to epsilon $ as $n to infty$.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Nov 23 at 6:36









        Kavi Rama Murthy

        48.9k31854




        48.9k31854






























            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.





            Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


            Please pay close attention to the following guidance:


            • 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.


            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%2f3010034%2fsum-i-1-infty-frac1a-i-converges-prove-that-lim-n-to-infty-fr%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

            Plaza Victoria

            In PowerPoint, is there a keyboard shortcut for bulleted / numbered list?

            How to put 3 figures in Latex with 2 figures side by side and 1 below these side by side images but in...