Alternative proof for $ sum left(frac{k-2}{k}right)^k$ is divergent.












0














In an earlier question I asked help to prove that:
$$ sum left(frac{k-2}{k}right)^k$$ is divergent, using the fact the the general term converges to $frac{1}{e^2}$ and by the limit test the series diverges, is there a more straightforward method I am missing? One that does not use $e$ necessarily.




See original post: Series diverges






real-analysis sequences-and-series alternative-proof







share|cite|improve this question


















  • 10




    I would say that proving that the general term does not converge to zero is about as simple as it gets.
    – MisterRiemann
    Nov 28 '18 at 12:17
















0














In an earlier question I asked help to prove that:
$$ sum left(frac{k-2}{k}right)^k$$ is divergent, using the fact the the general term converges to $frac{1}{e^2}$ and by the limit test the series diverges, is there a more straightforward method I am missing? One that does not use $e$ necessarily.




See original post: Series diverges






real-analysis sequences-and-series alternative-proof







share|cite|improve this question


















  • 10




    I would say that proving that the general term does not converge to zero is about as simple as it gets.
    – MisterRiemann
    Nov 28 '18 at 12:17














0












0








0







In an earlier question I asked help to prove that:
$$ sum left(frac{k-2}{k}right)^k$$ is divergent, using the fact the the general term converges to $frac{1}{e^2}$ and by the limit test the series diverges, is there a more straightforward method I am missing? One that does not use $e$ necessarily.




See original post: Series diverges






real-analysis sequences-and-series alternative-proof







share|cite|improve this question













In an earlier question I asked help to prove that:
$$ sum left(frac{k-2}{k}right)^k$$ is divergent, using the fact the the general term converges to $frac{1}{e^2}$ and by the limit test the series diverges, is there a more straightforward method I am missing? One that does not use $e$ necessarily.




See original post: Series diverges






real-analysis sequences-and-series alternative-proof




real-analysis sequences-and-series alternative-proof






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Nov 28 '18 at 12:11









Wesley Strik

1,553422




1,553422








  • 10




    I would say that proving that the general term does not converge to zero is about as simple as it gets.
    – MisterRiemann
    Nov 28 '18 at 12:17














  • 10




    I would say that proving that the general term does not converge to zero is about as simple as it gets.
    – MisterRiemann
    Nov 28 '18 at 12:17








10




10




I would say that proving that the general term does not converge to zero is about as simple as it gets.
– MisterRiemann
Nov 28 '18 at 12:17




I would say that proving that the general term does not converge to zero is about as simple as it gets.
– MisterRiemann
Nov 28 '18 at 12:17










2 Answers
2






active

oldest

votes


















1














if $n>2$ then $Big(dfrac{n-2}{n}Big)^n>0$ and
$$
\lim_{nto+infty}{Big(frac{n-2}{n}Big)^n}=lim_{nto+infty}{Big(1-frac{2}{n}Big)^n}=e^{-2}>0
$$






share|cite|improve this answer





















  • This is the approach I used in that question, so it does not really answer my question.
    – Wesley Strik
    Nov 28 '18 at 20:06










  • Then why did you accept it?
    – marty cohen
    Nov 28 '18 at 21:18



















0














Suppose we don't know anything about $e$. We can still show that $(1-2/k)^knotto0$ as $ktoinfty$, using the fact that the (alternating) binomial expansion can be truncated after a few terms to give an inequality, since $2^k/k!lt1$ for $kge4$.



$$begin{align}
left(k-2over k right)^k
&=left(1-{2over k}right)^k\
&=1-{kchoose1}left(2over kright)+{kchoose2}left(2over kright)^2-{kchoose3}left(2over kright)^3+cdots\
&=1-2+2-{8over6}{(k-1)(k-2)over k^2}+{16over24}{(k-1)(k-2)(k-3)over k^3}-{32over120}{(k-1)(k-2)(k-3)(k-4)over k^4}+cdots\
&gt1-2+2-{4over3}+{2over3}left(1-{6over k}right)-{4over15}\
&={1over15}-{4over k}
end{align}$$



A nice way to wrap things up is now to note that, for $kge105$, we have



$$left(k-2over kright)^kgt{1over15}-{4over105}={1over35}$$



and therefore $(1-2/k)^knotto0$ as $ktoinfty$, which in turn implies $sum(1-2/k)^k$ diverges.



Remarks: In addition to $2^k/k!lt1$ for $kge4$, which permitted truncation after a subtraction, we used the crude inequalities $(k-1)(k-2)lt k^2$ and $(k-1)(k-2)(k-3)(k-4)lt k^4$ and the slightly less crude inequality $(k-1)(k-2)(k-3)=k^3-6k^2+11k-6gt k^3-6k^2$.






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%2f3017071%2falternative-proof-for-sum-left-frack-2k-rightk-is-divergent%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    2 Answers
    2






    active

    oldest

    votes








    2 Answers
    2






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    1














    if $n>2$ then $Big(dfrac{n-2}{n}Big)^n>0$ and
    $$
    \lim_{nto+infty}{Big(frac{n-2}{n}Big)^n}=lim_{nto+infty}{Big(1-frac{2}{n}Big)^n}=e^{-2}>0
    $$






    share|cite|improve this answer





















    • This is the approach I used in that question, so it does not really answer my question.
      – Wesley Strik
      Nov 28 '18 at 20:06










    • Then why did you accept it?
      – marty cohen
      Nov 28 '18 at 21:18
















    1














    if $n>2$ then $Big(dfrac{n-2}{n}Big)^n>0$ and
    $$
    \lim_{nto+infty}{Big(frac{n-2}{n}Big)^n}=lim_{nto+infty}{Big(1-frac{2}{n}Big)^n}=e^{-2}>0
    $$






    share|cite|improve this answer





















    • This is the approach I used in that question, so it does not really answer my question.
      – Wesley Strik
      Nov 28 '18 at 20:06










    • Then why did you accept it?
      – marty cohen
      Nov 28 '18 at 21:18














    1












    1








    1






    if $n>2$ then $Big(dfrac{n-2}{n}Big)^n>0$ and
    $$
    \lim_{nto+infty}{Big(frac{n-2}{n}Big)^n}=lim_{nto+infty}{Big(1-frac{2}{n}Big)^n}=e^{-2}>0
    $$






    share|cite|improve this answer












    if $n>2$ then $Big(dfrac{n-2}{n}Big)^n>0$ and
    $$
    \lim_{nto+infty}{Big(frac{n-2}{n}Big)^n}=lim_{nto+infty}{Big(1-frac{2}{n}Big)^n}=e^{-2}>0
    $$







    share|cite|improve this answer












    share|cite|improve this answer



    share|cite|improve this answer










    answered Nov 28 '18 at 20:01









    Samvel Safaryan

    511111




    511111












    • This is the approach I used in that question, so it does not really answer my question.
      – Wesley Strik
      Nov 28 '18 at 20:06










    • Then why did you accept it?
      – marty cohen
      Nov 28 '18 at 21:18


















    • This is the approach I used in that question, so it does not really answer my question.
      – Wesley Strik
      Nov 28 '18 at 20:06










    • Then why did you accept it?
      – marty cohen
      Nov 28 '18 at 21:18
















    This is the approach I used in that question, so it does not really answer my question.
    – Wesley Strik
    Nov 28 '18 at 20:06




    This is the approach I used in that question, so it does not really answer my question.
    – Wesley Strik
    Nov 28 '18 at 20:06












    Then why did you accept it?
    – marty cohen
    Nov 28 '18 at 21:18




    Then why did you accept it?
    – marty cohen
    Nov 28 '18 at 21:18











    0














    Suppose we don't know anything about $e$. We can still show that $(1-2/k)^knotto0$ as $ktoinfty$, using the fact that the (alternating) binomial expansion can be truncated after a few terms to give an inequality, since $2^k/k!lt1$ for $kge4$.



    $$begin{align}
    left(k-2over k right)^k
    &=left(1-{2over k}right)^k\
    &=1-{kchoose1}left(2over kright)+{kchoose2}left(2over kright)^2-{kchoose3}left(2over kright)^3+cdots\
    &=1-2+2-{8over6}{(k-1)(k-2)over k^2}+{16over24}{(k-1)(k-2)(k-3)over k^3}-{32over120}{(k-1)(k-2)(k-3)(k-4)over k^4}+cdots\
    &gt1-2+2-{4over3}+{2over3}left(1-{6over k}right)-{4over15}\
    &={1over15}-{4over k}
    end{align}$$



    A nice way to wrap things up is now to note that, for $kge105$, we have



    $$left(k-2over kright)^kgt{1over15}-{4over105}={1over35}$$



    and therefore $(1-2/k)^knotto0$ as $ktoinfty$, which in turn implies $sum(1-2/k)^k$ diverges.



    Remarks: In addition to $2^k/k!lt1$ for $kge4$, which permitted truncation after a subtraction, we used the crude inequalities $(k-1)(k-2)lt k^2$ and $(k-1)(k-2)(k-3)(k-4)lt k^4$ and the slightly less crude inequality $(k-1)(k-2)(k-3)=k^3-6k^2+11k-6gt k^3-6k^2$.






    share|cite|improve this answer


























      0














      Suppose we don't know anything about $e$. We can still show that $(1-2/k)^knotto0$ as $ktoinfty$, using the fact that the (alternating) binomial expansion can be truncated after a few terms to give an inequality, since $2^k/k!lt1$ for $kge4$.



      $$begin{align}
      left(k-2over k right)^k
      &=left(1-{2over k}right)^k\
      &=1-{kchoose1}left(2over kright)+{kchoose2}left(2over kright)^2-{kchoose3}left(2over kright)^3+cdots\
      &=1-2+2-{8over6}{(k-1)(k-2)over k^2}+{16over24}{(k-1)(k-2)(k-3)over k^3}-{32over120}{(k-1)(k-2)(k-3)(k-4)over k^4}+cdots\
      &gt1-2+2-{4over3}+{2over3}left(1-{6over k}right)-{4over15}\
      &={1over15}-{4over k}
      end{align}$$



      A nice way to wrap things up is now to note that, for $kge105$, we have



      $$left(k-2over kright)^kgt{1over15}-{4over105}={1over35}$$



      and therefore $(1-2/k)^knotto0$ as $ktoinfty$, which in turn implies $sum(1-2/k)^k$ diverges.



      Remarks: In addition to $2^k/k!lt1$ for $kge4$, which permitted truncation after a subtraction, we used the crude inequalities $(k-1)(k-2)lt k^2$ and $(k-1)(k-2)(k-3)(k-4)lt k^4$ and the slightly less crude inequality $(k-1)(k-2)(k-3)=k^3-6k^2+11k-6gt k^3-6k^2$.






      share|cite|improve this answer
























        0












        0








        0






        Suppose we don't know anything about $e$. We can still show that $(1-2/k)^knotto0$ as $ktoinfty$, using the fact that the (alternating) binomial expansion can be truncated after a few terms to give an inequality, since $2^k/k!lt1$ for $kge4$.



        $$begin{align}
        left(k-2over k right)^k
        &=left(1-{2over k}right)^k\
        &=1-{kchoose1}left(2over kright)+{kchoose2}left(2over kright)^2-{kchoose3}left(2over kright)^3+cdots\
        &=1-2+2-{8over6}{(k-1)(k-2)over k^2}+{16over24}{(k-1)(k-2)(k-3)over k^3}-{32over120}{(k-1)(k-2)(k-3)(k-4)over k^4}+cdots\
        &gt1-2+2-{4over3}+{2over3}left(1-{6over k}right)-{4over15}\
        &={1over15}-{4over k}
        end{align}$$



        A nice way to wrap things up is now to note that, for $kge105$, we have



        $$left(k-2over kright)^kgt{1over15}-{4over105}={1over35}$$



        and therefore $(1-2/k)^knotto0$ as $ktoinfty$, which in turn implies $sum(1-2/k)^k$ diverges.



        Remarks: In addition to $2^k/k!lt1$ for $kge4$, which permitted truncation after a subtraction, we used the crude inequalities $(k-1)(k-2)lt k^2$ and $(k-1)(k-2)(k-3)(k-4)lt k^4$ and the slightly less crude inequality $(k-1)(k-2)(k-3)=k^3-6k^2+11k-6gt k^3-6k^2$.






        share|cite|improve this answer












        Suppose we don't know anything about $e$. We can still show that $(1-2/k)^knotto0$ as $ktoinfty$, using the fact that the (alternating) binomial expansion can be truncated after a few terms to give an inequality, since $2^k/k!lt1$ for $kge4$.



        $$begin{align}
        left(k-2over k right)^k
        &=left(1-{2over k}right)^k\
        &=1-{kchoose1}left(2over kright)+{kchoose2}left(2over kright)^2-{kchoose3}left(2over kright)^3+cdots\
        &=1-2+2-{8over6}{(k-1)(k-2)over k^2}+{16over24}{(k-1)(k-2)(k-3)over k^3}-{32over120}{(k-1)(k-2)(k-3)(k-4)over k^4}+cdots\
        &gt1-2+2-{4over3}+{2over3}left(1-{6over k}right)-{4over15}\
        &={1over15}-{4over k}
        end{align}$$



        A nice way to wrap things up is now to note that, for $kge105$, we have



        $$left(k-2over kright)^kgt{1over15}-{4over105}={1over35}$$



        and therefore $(1-2/k)^knotto0$ as $ktoinfty$, which in turn implies $sum(1-2/k)^k$ diverges.



        Remarks: In addition to $2^k/k!lt1$ for $kge4$, which permitted truncation after a subtraction, we used the crude inequalities $(k-1)(k-2)lt k^2$ and $(k-1)(k-2)(k-3)(k-4)lt k^4$ and the slightly less crude inequality $(k-1)(k-2)(k-3)=k^3-6k^2+11k-6gt k^3-6k^2$.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Nov 28 '18 at 22:46









        Barry Cipra

        59.1k653124




        59.1k653124






























            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%2f3017071%2falternative-proof-for-sum-left-frack-2k-rightk-is-divergent%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

            Aardman Animations

            Image
            Aardman Animations, Ltd. Aardman Animations Tipo privada Atividade Animação em stop-motion , Animação em CGI Fundação 1972 Fundador(es) Peter Lord David Sproxton Sede Bristol, Inglaterra  Reino Unido Proprietário(s) Dreamworks Pessoas-chave Peter Lord David Sproxton Nick Park Divisões Aardman Features Aardman Digital Aardman Commercials Aardman Broadcast Aardman International Aardman Rights Aardman Effects Aardman 3-D Systems Aardman Nathan Love AardBoiled Website oficial aardman.com
            Read more

            Are they similar matrix

            Image
            0 $begingroup$ Do $begin{bmatrix} 0&i&0\0&0&1\0&0&0 end{bmatrix} $ and $begin{bmatrix} 0&0&0\-i&0&0\0&1&0 end{bmatrix} $ are similar.Is this True/false Clearly both are nilpotent and one is conjucate transpose of other but how to know if they are similar.i'm stuck. Please help me linear-algebra vector-spaces eigenvalues-eigenvectors generalizedeigenvector share | cite | improve this question edited Dec 10 '18 at 6:38 Vasanth Kris asked Dec 10 '18 at 6:19
            Read more

            “minimization” problem in Euclidean space related to orthonormal basis

            Image
            3 $begingroup$ I have stumbled upon an exercice for second year undegraduate student majoring in economics which I find quite demanding. I have an idea for the solution, but it seems awfully complicated, and I am wondering if there was a simpler way to solve it. This goes as follows: Let $(E, langle, rangle)$ be a euclidean space of dimension $n geq 2$ . 1) For any $x in E$ , show that $||x|| = sqrt{n}$ if and only if there exists $(e_1, dots, e_n)$ an orthonormal basis of $E$ such that $x =e_1+ ldots + e_n$ . 2) For any $(x,y) in E$ , show that $||x|| = sqrt{n}$ , $||y|| = sqrt{frac{n(n+1)(2n+1)}{6}}$ and $langle x,y rangle = frac{n(n+1)}{2}$ if and only if there eixsts $(e_1, ldots, e_n)$ an orthonormal basis of $E$ such that $x = e_1 + ldots + e_n$ and $y = e_1 + 2e_2 + ldots + ne_n$ The first q
            Read more