Assume $a_n$ is a positive sequence, and $ (1-frac {a_n} {a_{n+1}})n rightarrow a>1 $. Prove $a_n$...












0












$begingroup$


I have tried every technique I know; I can't solve this question, so I assume it's an algebraic trick. Any ideas?



Edit: [The question was written incorrectly, $a_n$ is supposed to be the divisor.]










share|cite|improve this question











$endgroup$








  • 3




    $begingroup$
    Are you sure the assumptions are correctly stated? The current version of your statement implies that $a_n$ is eventually strictly increasing. (To see this, notice that $1-frac{a_n}{a_{n+1}}$ must be eventually positive.) So there is no chance your sequence converges to $0$. Rather, one can prove sort of the opposite: $a_n$ diverges to $infty$.
    $endgroup$
    – Sangchul Lee
    Jan 23 at 7:45












  • $begingroup$
    Look at the sequence $a_n=2(n-1)$ then your given expression converges to 2. But $a_n$ obviously goes to infinity.
    $endgroup$
    – A. P
    Jan 23 at 8:33






  • 2




    $begingroup$
    @José: I wonder why you approved the last edit. The TeX is broken, and the fraction (which was originally $frac{a_n}{a_{n+1}}$) is reversed, so that an answer is invalidated.
    $endgroup$
    – Martin R
    Jan 23 at 9:42








  • 1




    $begingroup$
    This seems like the Raabe test of series, where the sign of the terms got reversed.
    $endgroup$
    – xbh
    Jan 23 at 12:18










  • $begingroup$
    I'm sorry, it was supposed to be $a_n$ at the bottom, the Latex confused me.
    $endgroup$
    – Amit Levy
    Jan 23 at 17:16
















0












$begingroup$


I have tried every technique I know; I can't solve this question, so I assume it's an algebraic trick. Any ideas?



Edit: [The question was written incorrectly, $a_n$ is supposed to be the divisor.]










share|cite|improve this question











$endgroup$








  • 3




    $begingroup$
    Are you sure the assumptions are correctly stated? The current version of your statement implies that $a_n$ is eventually strictly increasing. (To see this, notice that $1-frac{a_n}{a_{n+1}}$ must be eventually positive.) So there is no chance your sequence converges to $0$. Rather, one can prove sort of the opposite: $a_n$ diverges to $infty$.
    $endgroup$
    – Sangchul Lee
    Jan 23 at 7:45












  • $begingroup$
    Look at the sequence $a_n=2(n-1)$ then your given expression converges to 2. But $a_n$ obviously goes to infinity.
    $endgroup$
    – A. P
    Jan 23 at 8:33






  • 2




    $begingroup$
    @José: I wonder why you approved the last edit. The TeX is broken, and the fraction (which was originally $frac{a_n}{a_{n+1}}$) is reversed, so that an answer is invalidated.
    $endgroup$
    – Martin R
    Jan 23 at 9:42








  • 1




    $begingroup$
    This seems like the Raabe test of series, where the sign of the terms got reversed.
    $endgroup$
    – xbh
    Jan 23 at 12:18










  • $begingroup$
    I'm sorry, it was supposed to be $a_n$ at the bottom, the Latex confused me.
    $endgroup$
    – Amit Levy
    Jan 23 at 17:16














0












0








0





$begingroup$


I have tried every technique I know; I can't solve this question, so I assume it's an algebraic trick. Any ideas?



Edit: [The question was written incorrectly, $a_n$ is supposed to be the divisor.]










share|cite|improve this question











$endgroup$




I have tried every technique I know; I can't solve this question, so I assume it's an algebraic trick. Any ideas?



Edit: [The question was written incorrectly, $a_n$ is supposed to be the divisor.]







calculus sequences-and-series






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 23 at 17:18







Amit Levy

















asked Jan 23 at 7:15









Amit LevyAmit Levy

747




747








  • 3




    $begingroup$
    Are you sure the assumptions are correctly stated? The current version of your statement implies that $a_n$ is eventually strictly increasing. (To see this, notice that $1-frac{a_n}{a_{n+1}}$ must be eventually positive.) So there is no chance your sequence converges to $0$. Rather, one can prove sort of the opposite: $a_n$ diverges to $infty$.
    $endgroup$
    – Sangchul Lee
    Jan 23 at 7:45












  • $begingroup$
    Look at the sequence $a_n=2(n-1)$ then your given expression converges to 2. But $a_n$ obviously goes to infinity.
    $endgroup$
    – A. P
    Jan 23 at 8:33






  • 2




    $begingroup$
    @José: I wonder why you approved the last edit. The TeX is broken, and the fraction (which was originally $frac{a_n}{a_{n+1}}$) is reversed, so that an answer is invalidated.
    $endgroup$
    – Martin R
    Jan 23 at 9:42








  • 1




    $begingroup$
    This seems like the Raabe test of series, where the sign of the terms got reversed.
    $endgroup$
    – xbh
    Jan 23 at 12:18










  • $begingroup$
    I'm sorry, it was supposed to be $a_n$ at the bottom, the Latex confused me.
    $endgroup$
    – Amit Levy
    Jan 23 at 17:16














  • 3




    $begingroup$
    Are you sure the assumptions are correctly stated? The current version of your statement implies that $a_n$ is eventually strictly increasing. (To see this, notice that $1-frac{a_n}{a_{n+1}}$ must be eventually positive.) So there is no chance your sequence converges to $0$. Rather, one can prove sort of the opposite: $a_n$ diverges to $infty$.
    $endgroup$
    – Sangchul Lee
    Jan 23 at 7:45












  • $begingroup$
    Look at the sequence $a_n=2(n-1)$ then your given expression converges to 2. But $a_n$ obviously goes to infinity.
    $endgroup$
    – A. P
    Jan 23 at 8:33






  • 2




    $begingroup$
    @José: I wonder why you approved the last edit. The TeX is broken, and the fraction (which was originally $frac{a_n}{a_{n+1}}$) is reversed, so that an answer is invalidated.
    $endgroup$
    – Martin R
    Jan 23 at 9:42








  • 1




    $begingroup$
    This seems like the Raabe test of series, where the sign of the terms got reversed.
    $endgroup$
    – xbh
    Jan 23 at 12:18










  • $begingroup$
    I'm sorry, it was supposed to be $a_n$ at the bottom, the Latex confused me.
    $endgroup$
    – Amit Levy
    Jan 23 at 17:16








3




3




$begingroup$
Are you sure the assumptions are correctly stated? The current version of your statement implies that $a_n$ is eventually strictly increasing. (To see this, notice that $1-frac{a_n}{a_{n+1}}$ must be eventually positive.) So there is no chance your sequence converges to $0$. Rather, one can prove sort of the opposite: $a_n$ diverges to $infty$.
$endgroup$
– Sangchul Lee
Jan 23 at 7:45






$begingroup$
Are you sure the assumptions are correctly stated? The current version of your statement implies that $a_n$ is eventually strictly increasing. (To see this, notice that $1-frac{a_n}{a_{n+1}}$ must be eventually positive.) So there is no chance your sequence converges to $0$. Rather, one can prove sort of the opposite: $a_n$ diverges to $infty$.
$endgroup$
– Sangchul Lee
Jan 23 at 7:45














$begingroup$
Look at the sequence $a_n=2(n-1)$ then your given expression converges to 2. But $a_n$ obviously goes to infinity.
$endgroup$
– A. P
Jan 23 at 8:33




$begingroup$
Look at the sequence $a_n=2(n-1)$ then your given expression converges to 2. But $a_n$ obviously goes to infinity.
$endgroup$
– A. P
Jan 23 at 8:33




2




2




$begingroup$
@José: I wonder why you approved the last edit. The TeX is broken, and the fraction (which was originally $frac{a_n}{a_{n+1}}$) is reversed, so that an answer is invalidated.
$endgroup$
– Martin R
Jan 23 at 9:42






$begingroup$
@José: I wonder why you approved the last edit. The TeX is broken, and the fraction (which was originally $frac{a_n}{a_{n+1}}$) is reversed, so that an answer is invalidated.
$endgroup$
– Martin R
Jan 23 at 9:42






1




1




$begingroup$
This seems like the Raabe test of series, where the sign of the terms got reversed.
$endgroup$
– xbh
Jan 23 at 12:18




$begingroup$
This seems like the Raabe test of series, where the sign of the terms got reversed.
$endgroup$
– xbh
Jan 23 at 12:18












$begingroup$
I'm sorry, it was supposed to be $a_n$ at the bottom, the Latex confused me.
$endgroup$
– Amit Levy
Jan 23 at 17:16




$begingroup$
I'm sorry, it was supposed to be $a_n$ at the bottom, the Latex confused me.
$endgroup$
– Amit Levy
Jan 23 at 17:16










1 Answer
1






active

oldest

votes


















0












$begingroup$

Actually $a_n to infty$!. There exist $b>1$ and $n_0$ such that $1-frac {a_n} {a_{n+1}} >frac b n$ for $n geq n_0$. This gives $frac {a_{n+1}} {a_n} >c_n$ where $c_n=frac 1 {1-frac b n}$. Iterating this gives $a_{n+n_0} >a_{n_0} prod_{k=n_0}^{n+n_0} c_k$. Hence it is enough to show that $prod_{k=n_0}^{infty} c_k=infty$. Equivalently we have to show that $sumlimits_{k=1}^{infty} log (c_k)= infty$. This follows from the divergence of harmonic series and the fact that $log(1-x)$ behaves like $x$ for $x$ near $0$.






share|cite|improve this answer











$endgroup$













    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%2f3084174%2fassume-a-n-is-a-positive-sequence-and-1-frac-a-n-a-n1n-rightarro%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









    0












    $begingroup$

    Actually $a_n to infty$!. There exist $b>1$ and $n_0$ such that $1-frac {a_n} {a_{n+1}} >frac b n$ for $n geq n_0$. This gives $frac {a_{n+1}} {a_n} >c_n$ where $c_n=frac 1 {1-frac b n}$. Iterating this gives $a_{n+n_0} >a_{n_0} prod_{k=n_0}^{n+n_0} c_k$. Hence it is enough to show that $prod_{k=n_0}^{infty} c_k=infty$. Equivalently we have to show that $sumlimits_{k=1}^{infty} log (c_k)= infty$. This follows from the divergence of harmonic series and the fact that $log(1-x)$ behaves like $x$ for $x$ near $0$.






    share|cite|improve this answer











    $endgroup$


















      0












      $begingroup$

      Actually $a_n to infty$!. There exist $b>1$ and $n_0$ such that $1-frac {a_n} {a_{n+1}} >frac b n$ for $n geq n_0$. This gives $frac {a_{n+1}} {a_n} >c_n$ where $c_n=frac 1 {1-frac b n}$. Iterating this gives $a_{n+n_0} >a_{n_0} prod_{k=n_0}^{n+n_0} c_k$. Hence it is enough to show that $prod_{k=n_0}^{infty} c_k=infty$. Equivalently we have to show that $sumlimits_{k=1}^{infty} log (c_k)= infty$. This follows from the divergence of harmonic series and the fact that $log(1-x)$ behaves like $x$ for $x$ near $0$.






      share|cite|improve this answer











      $endgroup$
















        0












        0








        0





        $begingroup$

        Actually $a_n to infty$!. There exist $b>1$ and $n_0$ such that $1-frac {a_n} {a_{n+1}} >frac b n$ for $n geq n_0$. This gives $frac {a_{n+1}} {a_n} >c_n$ where $c_n=frac 1 {1-frac b n}$. Iterating this gives $a_{n+n_0} >a_{n_0} prod_{k=n_0}^{n+n_0} c_k$. Hence it is enough to show that $prod_{k=n_0}^{infty} c_k=infty$. Equivalently we have to show that $sumlimits_{k=1}^{infty} log (c_k)= infty$. This follows from the divergence of harmonic series and the fact that $log(1-x)$ behaves like $x$ for $x$ near $0$.






        share|cite|improve this answer











        $endgroup$



        Actually $a_n to infty$!. There exist $b>1$ and $n_0$ such that $1-frac {a_n} {a_{n+1}} >frac b n$ for $n geq n_0$. This gives $frac {a_{n+1}} {a_n} >c_n$ where $c_n=frac 1 {1-frac b n}$. Iterating this gives $a_{n+n_0} >a_{n_0} prod_{k=n_0}^{n+n_0} c_k$. Hence it is enough to show that $prod_{k=n_0}^{infty} c_k=infty$. Equivalently we have to show that $sumlimits_{k=1}^{infty} log (c_k)= infty$. This follows from the divergence of harmonic series and the fact that $log(1-x)$ behaves like $x$ for $x$ near $0$.







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited Jan 23 at 8:06

























        answered Jan 23 at 7:46









        Kavi Rama MurthyKavi Rama Murthy

        64.1k42464




        64.1k42464






























            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%2f3084174%2fassume-a-n-is-a-positive-sequence-and-1-frac-a-n-a-n1n-rightarro%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

            Mario Kart Wii

            The Binding of Isaac: Rebirth/Afterbirth

            What does “Dominus providebit” mean?