Can $a(n) = frac{n}{n+1}$ be written recursively?












1












$begingroup$


Take the sequence $$frac{1}{2}, frac{2}{3}, frac{3}{4}, frac{4}{5}, frac{5}{6}, frac{6}{7}, dots$$



Algebraically it can be written as $$a(n) = frac{n}{n + 1}$$



Can you write this as a recursive function as well?



A pattern I have noticed:




  • Take $A_{n-1}$ and then inverse it. All you have to do is add two to the denominator. However, it is the denominator increase that causes a problem here.


I am currently in Algebra II Honors and learning sequences










share|cite|improve this question









New contributor




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







$endgroup$

















    1












    $begingroup$


    Take the sequence $$frac{1}{2}, frac{2}{3}, frac{3}{4}, frac{4}{5}, frac{5}{6}, frac{6}{7}, dots$$



    Algebraically it can be written as $$a(n) = frac{n}{n + 1}$$



    Can you write this as a recursive function as well?



    A pattern I have noticed:




    • Take $A_{n-1}$ and then inverse it. All you have to do is add two to the denominator. However, it is the denominator increase that causes a problem here.


    I am currently in Algebra II Honors and learning sequences










    share|cite|improve this question









    New contributor




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







    $endgroup$















      1












      1








      1





      $begingroup$


      Take the sequence $$frac{1}{2}, frac{2}{3}, frac{3}{4}, frac{4}{5}, frac{5}{6}, frac{6}{7}, dots$$



      Algebraically it can be written as $$a(n) = frac{n}{n + 1}$$



      Can you write this as a recursive function as well?



      A pattern I have noticed:




      • Take $A_{n-1}$ and then inverse it. All you have to do is add two to the denominator. However, it is the denominator increase that causes a problem here.


      I am currently in Algebra II Honors and learning sequences










      share|cite|improve this question









      New contributor




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







      $endgroup$




      Take the sequence $$frac{1}{2}, frac{2}{3}, frac{3}{4}, frac{4}{5}, frac{5}{6}, frac{6}{7}, dots$$



      Algebraically it can be written as $$a(n) = frac{n}{n + 1}$$



      Can you write this as a recursive function as well?



      A pattern I have noticed:




      • Take $A_{n-1}$ and then inverse it. All you have to do is add two to the denominator. However, it is the denominator increase that causes a problem here.


      I am currently in Algebra II Honors and learning sequences







      sequences-and-series number-theory recursion






      share|cite|improve this question









      New contributor




      Levi K 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









      New contributor




      Levi K 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 1 min ago









      user1952500

      829712




      829712






      New contributor




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









      asked 1 hour ago









      Levi KLevi K

      262




      262




      New contributor




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





      New contributor





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






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






















          3 Answers
          3






          active

          oldest

          votes


















          2












          $begingroup$

          After some further solving, I was able to come up with an answer



          It can be written $${A_{n + 1}} = ({2 - A_{n}})^{-1}$$ where $${A_1 = 1/2}$$






          share|cite








          New contributor




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






          $endgroup$





















            2












            $begingroup$

            begin{align*}
            a_{n+1} &= frac{n+1}{n+2} \
            &= frac{n+2-1}{n+2} \
            &= 1 - frac{1}{n+2} text{, so } \
            1 - a_{n+1} &= frac{1}{n+2} text{, } \
            frac{1}{1 - a_{n+1}} &= n+2 &[text{and so } frac{1}{1 - a_n} = n+1]\
            &= n+1+1 \
            &= frac{1}{1- a_n} +1 \
            &= frac{1}{1- a_n} + frac{1-a_n}{1-a_n} \
            &= frac{2-a_n}{1- a_n} text{, then } \
            1 - a_{n+1} &= frac{1-a_n}{2- a_n} text{, and finally } \
            a_{n+1} &= 1 - frac{1-a_n}{2- a_n} \
            &= frac{2-a_n}{2- a_n} - frac{1-a_n}{2- a_n} \
            &= frac{1}{2- a_n} text{.}
            end{align*}






            share|cite|improve this answer









            $endgroup$





















              0












              $begingroup$

              Just by playing around with some numbers, I determined a recursive relation to be



              $$a_n = frac{na_{n-1} + 1}{n+1}$$



              with $a_1 = 1/2$. I mostly derived this by noticing developing this would be easier if I negated the denominator of the previous term (thus multiplying by $n$), adding $1$ to the result (giving the increase in $1$ in the denominator), and then dividing again by the desired denominator ($n+1$).






              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
                });


                }
                });






                Levi K 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%2f3176633%2fcan-an-fracnn1-be-written-recursively%23new-answer', 'question_page');
                }
                );

                Post as a guest















                Required, but never shown

























                3 Answers
                3






                active

                oldest

                votes








                3 Answers
                3






                active

                oldest

                votes









                active

                oldest

                votes






                active

                oldest

                votes









                2












                $begingroup$

                After some further solving, I was able to come up with an answer



                It can be written $${A_{n + 1}} = ({2 - A_{n}})^{-1}$$ where $${A_1 = 1/2}$$






                share|cite








                New contributor




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






                $endgroup$


















                  2












                  $begingroup$

                  After some further solving, I was able to come up with an answer



                  It can be written $${A_{n + 1}} = ({2 - A_{n}})^{-1}$$ where $${A_1 = 1/2}$$






                  share|cite








                  New contributor




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






                  $endgroup$
















                    2












                    2








                    2





                    $begingroup$

                    After some further solving, I was able to come up with an answer



                    It can be written $${A_{n + 1}} = ({2 - A_{n}})^{-1}$$ where $${A_1 = 1/2}$$






                    share|cite








                    New contributor




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






                    $endgroup$



                    After some further solving, I was able to come up with an answer



                    It can be written $${A_{n + 1}} = ({2 - A_{n}})^{-1}$$ where $${A_1 = 1/2}$$







                    share|cite








                    New contributor




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









                    share|cite



                    share|cite






                    New contributor




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









                    answered 54 mins ago









                    Levi KLevi K

                    262




                    262




                    New contributor




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





                    New contributor





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






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























                        2












                        $begingroup$

                        begin{align*}
                        a_{n+1} &= frac{n+1}{n+2} \
                        &= frac{n+2-1}{n+2} \
                        &= 1 - frac{1}{n+2} text{, so } \
                        1 - a_{n+1} &= frac{1}{n+2} text{, } \
                        frac{1}{1 - a_{n+1}} &= n+2 &[text{and so } frac{1}{1 - a_n} = n+1]\
                        &= n+1+1 \
                        &= frac{1}{1- a_n} +1 \
                        &= frac{1}{1- a_n} + frac{1-a_n}{1-a_n} \
                        &= frac{2-a_n}{1- a_n} text{, then } \
                        1 - a_{n+1} &= frac{1-a_n}{2- a_n} text{, and finally } \
                        a_{n+1} &= 1 - frac{1-a_n}{2- a_n} \
                        &= frac{2-a_n}{2- a_n} - frac{1-a_n}{2- a_n} \
                        &= frac{1}{2- a_n} text{.}
                        end{align*}






                        share|cite|improve this answer









                        $endgroup$


















                          2












                          $begingroup$

                          begin{align*}
                          a_{n+1} &= frac{n+1}{n+2} \
                          &= frac{n+2-1}{n+2} \
                          &= 1 - frac{1}{n+2} text{, so } \
                          1 - a_{n+1} &= frac{1}{n+2} text{, } \
                          frac{1}{1 - a_{n+1}} &= n+2 &[text{and so } frac{1}{1 - a_n} = n+1]\
                          &= n+1+1 \
                          &= frac{1}{1- a_n} +1 \
                          &= frac{1}{1- a_n} + frac{1-a_n}{1-a_n} \
                          &= frac{2-a_n}{1- a_n} text{, then } \
                          1 - a_{n+1} &= frac{1-a_n}{2- a_n} text{, and finally } \
                          a_{n+1} &= 1 - frac{1-a_n}{2- a_n} \
                          &= frac{2-a_n}{2- a_n} - frac{1-a_n}{2- a_n} \
                          &= frac{1}{2- a_n} text{.}
                          end{align*}






                          share|cite|improve this answer









                          $endgroup$
















                            2












                            2








                            2





                            $begingroup$

                            begin{align*}
                            a_{n+1} &= frac{n+1}{n+2} \
                            &= frac{n+2-1}{n+2} \
                            &= 1 - frac{1}{n+2} text{, so } \
                            1 - a_{n+1} &= frac{1}{n+2} text{, } \
                            frac{1}{1 - a_{n+1}} &= n+2 &[text{and so } frac{1}{1 - a_n} = n+1]\
                            &= n+1+1 \
                            &= frac{1}{1- a_n} +1 \
                            &= frac{1}{1- a_n} + frac{1-a_n}{1-a_n} \
                            &= frac{2-a_n}{1- a_n} text{, then } \
                            1 - a_{n+1} &= frac{1-a_n}{2- a_n} text{, and finally } \
                            a_{n+1} &= 1 - frac{1-a_n}{2- a_n} \
                            &= frac{2-a_n}{2- a_n} - frac{1-a_n}{2- a_n} \
                            &= frac{1}{2- a_n} text{.}
                            end{align*}






                            share|cite|improve this answer









                            $endgroup$



                            begin{align*}
                            a_{n+1} &= frac{n+1}{n+2} \
                            &= frac{n+2-1}{n+2} \
                            &= 1 - frac{1}{n+2} text{, so } \
                            1 - a_{n+1} &= frac{1}{n+2} text{, } \
                            frac{1}{1 - a_{n+1}} &= n+2 &[text{and so } frac{1}{1 - a_n} = n+1]\
                            &= n+1+1 \
                            &= frac{1}{1- a_n} +1 \
                            &= frac{1}{1- a_n} + frac{1-a_n}{1-a_n} \
                            &= frac{2-a_n}{1- a_n} text{, then } \
                            1 - a_{n+1} &= frac{1-a_n}{2- a_n} text{, and finally } \
                            a_{n+1} &= 1 - frac{1-a_n}{2- a_n} \
                            &= frac{2-a_n}{2- a_n} - frac{1-a_n}{2- a_n} \
                            &= frac{1}{2- a_n} text{.}
                            end{align*}







                            share|cite|improve this answer












                            share|cite|improve this answer



                            share|cite|improve this answer










                            answered 36 mins ago









                            Eric TowersEric Towers

                            33.5k22370




                            33.5k22370























                                0












                                $begingroup$

                                Just by playing around with some numbers, I determined a recursive relation to be



                                $$a_n = frac{na_{n-1} + 1}{n+1}$$



                                with $a_1 = 1/2$. I mostly derived this by noticing developing this would be easier if I negated the denominator of the previous term (thus multiplying by $n$), adding $1$ to the result (giving the increase in $1$ in the denominator), and then dividing again by the desired denominator ($n+1$).






                                share|cite|improve this answer









                                $endgroup$


















                                  0












                                  $begingroup$

                                  Just by playing around with some numbers, I determined a recursive relation to be



                                  $$a_n = frac{na_{n-1} + 1}{n+1}$$



                                  with $a_1 = 1/2$. I mostly derived this by noticing developing this would be easier if I negated the denominator of the previous term (thus multiplying by $n$), adding $1$ to the result (giving the increase in $1$ in the denominator), and then dividing again by the desired denominator ($n+1$).






                                  share|cite|improve this answer









                                  $endgroup$
















                                    0












                                    0








                                    0





                                    $begingroup$

                                    Just by playing around with some numbers, I determined a recursive relation to be



                                    $$a_n = frac{na_{n-1} + 1}{n+1}$$



                                    with $a_1 = 1/2$. I mostly derived this by noticing developing this would be easier if I negated the denominator of the previous term (thus multiplying by $n$), adding $1$ to the result (giving the increase in $1$ in the denominator), and then dividing again by the desired denominator ($n+1$).






                                    share|cite|improve this answer









                                    $endgroup$



                                    Just by playing around with some numbers, I determined a recursive relation to be



                                    $$a_n = frac{na_{n-1} + 1}{n+1}$$



                                    with $a_1 = 1/2$. I mostly derived this by noticing developing this would be easier if I negated the denominator of the previous term (thus multiplying by $n$), adding $1$ to the result (giving the increase in $1$ in the denominator), and then dividing again by the desired denominator ($n+1$).







                                    share|cite|improve this answer












                                    share|cite|improve this answer



                                    share|cite|improve this answer










                                    answered 56 mins ago









                                    Eevee TrainerEevee Trainer

                                    9,91631740




                                    9,91631740






















                                        Levi K is a new contributor. Be nice, and check out our Code of Conduct.










                                        draft saved

                                        draft discarded


















                                        Levi K is a new contributor. Be nice, and check out our Code of Conduct.













                                        Levi K is a new contributor. Be nice, and check out our Code of Conduct.












                                        Levi K is a new contributor. Be nice, and check out our Code of Conduct.
















                                        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%2f3176633%2fcan-an-fracnn1-be-written-recursively%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

                                        Liste der Baudenkmale in Friedland (Mecklenburg)

                                        Single-Malt-Whisky

                                        Czorneboh