Trouble understanding the $ε$-$N$ proof for limit of sequence

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











up vote
3
down vote

favorite
1












I'm currently stuck on a math problem proposed by my teacher.




For $varepsilon=0,001$, find $N=N_0$ such that $|a_n-L|lt varepsilon$ if $ngeqslant N$



$$a_n = frac(n+1)3n-1, rm and , L=1/3$$




According to him, the answer could be any $N_0$ greater than $left[frac23varepsilonright]+1$. I have an idea of how the proof works, but I can't figure out how he came up with that specific value for N$_0$. And why the final value has a $+1$.







share|cite|improve this question









New contributor




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


















  • In general, the purpose of a formula for $N_0$ is so that when you use that formula in the proof, the proof will work. The formula your teacher used gives a much larger than minimal value of $N_0,$ which is fine (you can never go wrong by setting $N_0$ larger than needed), but to know the reason for choosing that particular formula it might help to see the specific steps of the proof.
    – David K
    Sep 4 at 19:52










  • Note that the standard in the English speaking world is to use the period to denote decimals ($epsilon =.001$).
    – Acccumulation
    Sep 5 at 0:09










  • @Acccumulation Note that the standard is not to skip the leading zero as well, $epsilon = 0.001$.
    – Roman Odaisky
    Sep 5 at 1:32














up vote
3
down vote

favorite
1












I'm currently stuck on a math problem proposed by my teacher.




For $varepsilon=0,001$, find $N=N_0$ such that $|a_n-L|lt varepsilon$ if $ngeqslant N$



$$a_n = frac(n+1)3n-1, rm and , L=1/3$$




According to him, the answer could be any $N_0$ greater than $left[frac23varepsilonright]+1$. I have an idea of how the proof works, but I can't figure out how he came up with that specific value for N$_0$. And why the final value has a $+1$.







share|cite|improve this question









New contributor




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


















  • In general, the purpose of a formula for $N_0$ is so that when you use that formula in the proof, the proof will work. The formula your teacher used gives a much larger than minimal value of $N_0,$ which is fine (you can never go wrong by setting $N_0$ larger than needed), but to know the reason for choosing that particular formula it might help to see the specific steps of the proof.
    – David K
    Sep 4 at 19:52










  • Note that the standard in the English speaking world is to use the period to denote decimals ($epsilon =.001$).
    – Acccumulation
    Sep 5 at 0:09










  • @Acccumulation Note that the standard is not to skip the leading zero as well, $epsilon = 0.001$.
    – Roman Odaisky
    Sep 5 at 1:32












up vote
3
down vote

favorite
1









up vote
3
down vote

favorite
1






1





I'm currently stuck on a math problem proposed by my teacher.




For $varepsilon=0,001$, find $N=N_0$ such that $|a_n-L|lt varepsilon$ if $ngeqslant N$



$$a_n = frac(n+1)3n-1, rm and , L=1/3$$




According to him, the answer could be any $N_0$ greater than $left[frac23varepsilonright]+1$. I have an idea of how the proof works, but I can't figure out how he came up with that specific value for N$_0$. And why the final value has a $+1$.







share|cite|improve this question









New contributor




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










I'm currently stuck on a math problem proposed by my teacher.




For $varepsilon=0,001$, find $N=N_0$ such that $|a_n-L|lt varepsilon$ if $ngeqslant N$



$$a_n = frac(n+1)3n-1, rm and , L=1/3$$




According to him, the answer could be any $N_0$ greater than $left[frac23varepsilonright]+1$. I have an idea of how the proof works, but I can't figure out how he came up with that specific value for N$_0$. And why the final value has a $+1$.









share|cite|improve this question









New contributor




Vinicius Alexandre Zonta 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 question




share|cite|improve this question








edited Sep 5 at 2:43









user21820

36.2k440140




36.2k440140






New contributor




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









asked Sep 4 at 19:24









Vinicius Alexandre Zonta

161




161




New contributor




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





New contributor





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






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











  • In general, the purpose of a formula for $N_0$ is so that when you use that formula in the proof, the proof will work. The formula your teacher used gives a much larger than minimal value of $N_0,$ which is fine (you can never go wrong by setting $N_0$ larger than needed), but to know the reason for choosing that particular formula it might help to see the specific steps of the proof.
    – David K
    Sep 4 at 19:52










  • Note that the standard in the English speaking world is to use the period to denote decimals ($epsilon =.001$).
    – Acccumulation
    Sep 5 at 0:09










  • @Acccumulation Note that the standard is not to skip the leading zero as well, $epsilon = 0.001$.
    – Roman Odaisky
    Sep 5 at 1:32
















  • In general, the purpose of a formula for $N_0$ is so that when you use that formula in the proof, the proof will work. The formula your teacher used gives a much larger than minimal value of $N_0,$ which is fine (you can never go wrong by setting $N_0$ larger than needed), but to know the reason for choosing that particular formula it might help to see the specific steps of the proof.
    – David K
    Sep 4 at 19:52










  • Note that the standard in the English speaking world is to use the period to denote decimals ($epsilon =.001$).
    – Acccumulation
    Sep 5 at 0:09










  • @Acccumulation Note that the standard is not to skip the leading zero as well, $epsilon = 0.001$.
    – Roman Odaisky
    Sep 5 at 1:32















In general, the purpose of a formula for $N_0$ is so that when you use that formula in the proof, the proof will work. The formula your teacher used gives a much larger than minimal value of $N_0,$ which is fine (you can never go wrong by setting $N_0$ larger than needed), but to know the reason for choosing that particular formula it might help to see the specific steps of the proof.
– David K
Sep 4 at 19:52




In general, the purpose of a formula for $N_0$ is so that when you use that formula in the proof, the proof will work. The formula your teacher used gives a much larger than minimal value of $N_0,$ which is fine (you can never go wrong by setting $N_0$ larger than needed), but to know the reason for choosing that particular formula it might help to see the specific steps of the proof.
– David K
Sep 4 at 19:52












Note that the standard in the English speaking world is to use the period to denote decimals ($epsilon =.001$).
– Acccumulation
Sep 5 at 0:09




Note that the standard in the English speaking world is to use the period to denote decimals ($epsilon =.001$).
– Acccumulation
Sep 5 at 0:09












@Acccumulation Note that the standard is not to skip the leading zero as well, $epsilon = 0.001$.
– Roman Odaisky
Sep 5 at 1:32




@Acccumulation Note that the standard is not to skip the leading zero as well, $epsilon = 0.001$.
– Roman Odaisky
Sep 5 at 1:32










2 Answers
2






active

oldest

votes

















up vote
6
down vote













We have that



$$left|fracn+13n-1-frac13right|<epsilon iff frac43(3n-1)<epsilon. $$



Now



$$frac43(3n-1)<epsiloniff 9n-3>frac4epsiloniff 9n>frac4epsilon+3.$$ So we need



$$n>frac49epsilon+frac13.$$ So it is enough to have



$$n>left[frac49epsilonright]+left[frac13right]=left[frac49epsilonright]+1.$$






share|cite|improve this answer




















  • Almost identical answers! You were quicker though. =)
    – Sobi
    Sep 4 at 19:37


















up vote
6
down vote













We have
$$ a_n - L = fracn+13n-1- frac13 = frac3(n+1)-(3n-1)3(3n-1) = frac43(3n-1). $$
So we want
$$ frac43(3n-1) < epsilon quadLeftrightarrowquad 3n-1 > frac43epsilon quad Leftrightarrow quad n > frac49epsilon+frac13, $$
so we can take
$$ n_0 = left[ frac49epsilonright] + 1. $$
We have $+1$ here to be on the safe side, since we want the previous inequality to be strict.



In particular, if $epsilon = 0.001 = 10^-3$ this becomes
$$ n_0 = left[ frac40009right]+1 = left[ frac40009right]+1 = 445. $$






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',
    convertImagesToLinks: true,
    noModals: false,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    noCode: true, onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    );



    );






    Vinicius Alexandre Zonta is a new contributor. Be nice, and check out our Code of Conduct.









     

    draft saved


    draft discarded


















    StackExchange.ready(
    function ()
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2905460%2ftrouble-understanding-the-%25ce%25b5-n-proof-for-limit-of-sequence%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
    6
    down vote













    We have that



    $$left|fracn+13n-1-frac13right|<epsilon iff frac43(3n-1)<epsilon. $$



    Now



    $$frac43(3n-1)<epsiloniff 9n-3>frac4epsiloniff 9n>frac4epsilon+3.$$ So we need



    $$n>frac49epsilon+frac13.$$ So it is enough to have



    $$n>left[frac49epsilonright]+left[frac13right]=left[frac49epsilonright]+1.$$






    share|cite|improve this answer




















    • Almost identical answers! You were quicker though. =)
      – Sobi
      Sep 4 at 19:37















    up vote
    6
    down vote













    We have that



    $$left|fracn+13n-1-frac13right|<epsilon iff frac43(3n-1)<epsilon. $$



    Now



    $$frac43(3n-1)<epsiloniff 9n-3>frac4epsiloniff 9n>frac4epsilon+3.$$ So we need



    $$n>frac49epsilon+frac13.$$ So it is enough to have



    $$n>left[frac49epsilonright]+left[frac13right]=left[frac49epsilonright]+1.$$






    share|cite|improve this answer




















    • Almost identical answers! You were quicker though. =)
      – Sobi
      Sep 4 at 19:37













    up vote
    6
    down vote










    up vote
    6
    down vote









    We have that



    $$left|fracn+13n-1-frac13right|<epsilon iff frac43(3n-1)<epsilon. $$



    Now



    $$frac43(3n-1)<epsiloniff 9n-3>frac4epsiloniff 9n>frac4epsilon+3.$$ So we need



    $$n>frac49epsilon+frac13.$$ So it is enough to have



    $$n>left[frac49epsilonright]+left[frac13right]=left[frac49epsilonright]+1.$$






    share|cite|improve this answer












    We have that



    $$left|fracn+13n-1-frac13right|<epsilon iff frac43(3n-1)<epsilon. $$



    Now



    $$frac43(3n-1)<epsiloniff 9n-3>frac4epsiloniff 9n>frac4epsilon+3.$$ So we need



    $$n>frac49epsilon+frac13.$$ So it is enough to have



    $$n>left[frac49epsilonright]+left[frac13right]=left[frac49epsilonright]+1.$$







    share|cite|improve this answer












    share|cite|improve this answer



    share|cite|improve this answer










    answered Sep 4 at 19:35









    mfl

    25.2k12141




    25.2k12141











    • Almost identical answers! You were quicker though. =)
      – Sobi
      Sep 4 at 19:37

















    • Almost identical answers! You were quicker though. =)
      – Sobi
      Sep 4 at 19:37
















    Almost identical answers! You were quicker though. =)
    – Sobi
    Sep 4 at 19:37





    Almost identical answers! You were quicker though. =)
    – Sobi
    Sep 4 at 19:37











    up vote
    6
    down vote













    We have
    $$ a_n - L = fracn+13n-1- frac13 = frac3(n+1)-(3n-1)3(3n-1) = frac43(3n-1). $$
    So we want
    $$ frac43(3n-1) < epsilon quadLeftrightarrowquad 3n-1 > frac43epsilon quad Leftrightarrow quad n > frac49epsilon+frac13, $$
    so we can take
    $$ n_0 = left[ frac49epsilonright] + 1. $$
    We have $+1$ here to be on the safe side, since we want the previous inequality to be strict.



    In particular, if $epsilon = 0.001 = 10^-3$ this becomes
    $$ n_0 = left[ frac40009right]+1 = left[ frac40009right]+1 = 445. $$






    share|cite|improve this answer
























      up vote
      6
      down vote













      We have
      $$ a_n - L = fracn+13n-1- frac13 = frac3(n+1)-(3n-1)3(3n-1) = frac43(3n-1). $$
      So we want
      $$ frac43(3n-1) < epsilon quadLeftrightarrowquad 3n-1 > frac43epsilon quad Leftrightarrow quad n > frac49epsilon+frac13, $$
      so we can take
      $$ n_0 = left[ frac49epsilonright] + 1. $$
      We have $+1$ here to be on the safe side, since we want the previous inequality to be strict.



      In particular, if $epsilon = 0.001 = 10^-3$ this becomes
      $$ n_0 = left[ frac40009right]+1 = left[ frac40009right]+1 = 445. $$






      share|cite|improve this answer






















        up vote
        6
        down vote










        up vote
        6
        down vote









        We have
        $$ a_n - L = fracn+13n-1- frac13 = frac3(n+1)-(3n-1)3(3n-1) = frac43(3n-1). $$
        So we want
        $$ frac43(3n-1) < epsilon quadLeftrightarrowquad 3n-1 > frac43epsilon quad Leftrightarrow quad n > frac49epsilon+frac13, $$
        so we can take
        $$ n_0 = left[ frac49epsilonright] + 1. $$
        We have $+1$ here to be on the safe side, since we want the previous inequality to be strict.



        In particular, if $epsilon = 0.001 = 10^-3$ this becomes
        $$ n_0 = left[ frac40009right]+1 = left[ frac40009right]+1 = 445. $$






        share|cite|improve this answer












        We have
        $$ a_n - L = fracn+13n-1- frac13 = frac3(n+1)-(3n-1)3(3n-1) = frac43(3n-1). $$
        So we want
        $$ frac43(3n-1) < epsilon quadLeftrightarrowquad 3n-1 > frac43epsilon quad Leftrightarrow quad n > frac49epsilon+frac13, $$
        so we can take
        $$ n_0 = left[ frac49epsilonright] + 1. $$
        We have $+1$ here to be on the safe side, since we want the previous inequality to be strict.



        In particular, if $epsilon = 0.001 = 10^-3$ this becomes
        $$ n_0 = left[ frac40009right]+1 = left[ frac40009right]+1 = 445. $$







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Sep 4 at 19:36









        Sobi

        2,653415




        2,653415




















            Vinicius Alexandre Zonta is a new contributor. Be nice, and check out our Code of Conduct.









             

            draft saved


            draft discarded


















            Vinicius Alexandre Zonta is a new contributor. Be nice, and check out our Code of Conduct.












            Vinicius Alexandre Zonta is a new contributor. Be nice, and check out our Code of Conduct.











            Vinicius Alexandre Zonta is a new contributor. Be nice, and check out our Code of Conduct.













             


            draft saved


            draft discarded














            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2905460%2ftrouble-understanding-the-%25ce%25b5-n-proof-for-limit-of-sequence%23new-answer', 'question_page');

            );

            Post as a guest













































































            Comments

            Popular posts from this blog

            What does second last employer means? [closed]

            List of Gilmore Girls characters

            Confectionery