Complicated linear recursion relations












0












$begingroup$


Is it possible to obtain a solution for $a_n$ for the following recursion relation?



$$a_n = -frac{1}{epsilon}(n+1)a_{n+1}+Rleft(frac{n+2}{n+1}right)a_{n+2}+frac{R}{epsilon}left(frac{(n+3)(n+2)}{n+1}right)a_{n+3}$$



If not, any other methods and hints on how to get rid of the recursion will be appreciated.










share|cite|improve this question









$endgroup$

















    0












    $begingroup$


    Is it possible to obtain a solution for $a_n$ for the following recursion relation?



    $$a_n = -frac{1}{epsilon}(n+1)a_{n+1}+Rleft(frac{n+2}{n+1}right)a_{n+2}+frac{R}{epsilon}left(frac{(n+3)(n+2)}{n+1}right)a_{n+3}$$



    If not, any other methods and hints on how to get rid of the recursion will be appreciated.










    share|cite|improve this question









    $endgroup$















      0












      0








      0





      $begingroup$


      Is it possible to obtain a solution for $a_n$ for the following recursion relation?



      $$a_n = -frac{1}{epsilon}(n+1)a_{n+1}+Rleft(frac{n+2}{n+1}right)a_{n+2}+frac{R}{epsilon}left(frac{(n+3)(n+2)}{n+1}right)a_{n+3}$$



      If not, any other methods and hints on how to get rid of the recursion will be appreciated.










      share|cite|improve this question









      $endgroup$




      Is it possible to obtain a solution for $a_n$ for the following recursion relation?



      $$a_n = -frac{1}{epsilon}(n+1)a_{n+1}+Rleft(frac{n+2}{n+1}right)a_{n+2}+frac{R}{epsilon}left(frac{(n+3)(n+2)}{n+1}right)a_{n+3}$$



      If not, any other methods and hints on how to get rid of the recursion will be appreciated.







      recurrence-relations recursion






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Dec 16 '18 at 16:29









      jarheadjarhead

      1308




      1308






















          1 Answer
          1






          active

          oldest

          votes


















          0












          $begingroup$

          Maple gives:



          $$a_n=frac{(-epsilon)^n}{Gamma(n+1)}left(a_0+sum_{i=0}^{n-1}tright)$$



          $$t=-frac{1}{piepsilon}frac{4}{epsilon^2R}^frac{i}{2}(a_0epsilon+a_1)Gammaleft(frac{i+1}{2}right)^2 icolon even$$



          $$t=frac{4}{epsilon^2R}^frac{i-1}{2}Gammaleft(frac{i+1}{2}right)^2left(frac{2a_2}{epsilon^2}+frac{a_1}{epsilon}right) icolon odd$$






          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%2f3042794%2fcomplicated-linear-recursion-relations%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$

            Maple gives:



            $$a_n=frac{(-epsilon)^n}{Gamma(n+1)}left(a_0+sum_{i=0}^{n-1}tright)$$



            $$t=-frac{1}{piepsilon}frac{4}{epsilon^2R}^frac{i}{2}(a_0epsilon+a_1)Gammaleft(frac{i+1}{2}right)^2 icolon even$$



            $$t=frac{4}{epsilon^2R}^frac{i-1}{2}Gammaleft(frac{i+1}{2}right)^2left(frac{2a_2}{epsilon^2}+frac{a_1}{epsilon}right) icolon odd$$






            share|cite|improve this answer









            $endgroup$


















              0












              $begingroup$

              Maple gives:



              $$a_n=frac{(-epsilon)^n}{Gamma(n+1)}left(a_0+sum_{i=0}^{n-1}tright)$$



              $$t=-frac{1}{piepsilon}frac{4}{epsilon^2R}^frac{i}{2}(a_0epsilon+a_1)Gammaleft(frac{i+1}{2}right)^2 icolon even$$



              $$t=frac{4}{epsilon^2R}^frac{i-1}{2}Gammaleft(frac{i+1}{2}right)^2left(frac{2a_2}{epsilon^2}+frac{a_1}{epsilon}right) icolon odd$$






              share|cite|improve this answer









              $endgroup$
















                0












                0








                0





                $begingroup$

                Maple gives:



                $$a_n=frac{(-epsilon)^n}{Gamma(n+1)}left(a_0+sum_{i=0}^{n-1}tright)$$



                $$t=-frac{1}{piepsilon}frac{4}{epsilon^2R}^frac{i}{2}(a_0epsilon+a_1)Gammaleft(frac{i+1}{2}right)^2 icolon even$$



                $$t=frac{4}{epsilon^2R}^frac{i-1}{2}Gammaleft(frac{i+1}{2}right)^2left(frac{2a_2}{epsilon^2}+frac{a_1}{epsilon}right) icolon odd$$






                share|cite|improve this answer









                $endgroup$



                Maple gives:



                $$a_n=frac{(-epsilon)^n}{Gamma(n+1)}left(a_0+sum_{i=0}^{n-1}tright)$$



                $$t=-frac{1}{piepsilon}frac{4}{epsilon^2R}^frac{i}{2}(a_0epsilon+a_1)Gammaleft(frac{i+1}{2}right)^2 icolon even$$



                $$t=frac{4}{epsilon^2R}^frac{i-1}{2}Gammaleft(frac{i+1}{2}right)^2left(frac{2a_2}{epsilon^2}+frac{a_1}{epsilon}right) icolon odd$$







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Dec 16 '18 at 19:03









                IV_IV_

                1,511525




                1,511525






























                    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%2f3042794%2fcomplicated-linear-recursion-relations%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

                    Brian Clough

                    Cáceres