Solve the recurrence relation $f(n) = 4f(n/3)+5$ where $n=3^k, k=1,2,3…$ and $f(1)=5$












1














Solve the recurrence relation:



$f(n) = 4f(n/3)+5$ where $n=3^k, k=1,2,3...$ and $f(1)=5$



I never seen a recurrence relation like this before. What would I need to use or do to solve this?






combinatorics discrete-mathematics recurrence-relations







share|cite|improve this question


















  • 1




    You could, as usual, try induction.
    – Lucas Henrique
    Dec 10 '18 at 5:28










  • If you are only looking for an asymptotic bound, you can use master theorem.
    – platty
    Dec 10 '18 at 5:32










  • If $n=3^k$ then $n/3=3^{k-1}$ and it becomes a usual recurrence, provided know $f(1)$ and only want it for $f(3^k),$ $k ge 0.$
    – coffeemath
    Dec 10 '18 at 5:33


















1














Solve the recurrence relation:



$f(n) = 4f(n/3)+5$ where $n=3^k, k=1,2,3...$ and $f(1)=5$



I never seen a recurrence relation like this before. What would I need to use or do to solve this?






combinatorics discrete-mathematics recurrence-relations







share|cite|improve this question


















  • 1




    You could, as usual, try induction.
    – Lucas Henrique
    Dec 10 '18 at 5:28










  • If you are only looking for an asymptotic bound, you can use master theorem.
    – platty
    Dec 10 '18 at 5:32










  • If $n=3^k$ then $n/3=3^{k-1}$ and it becomes a usual recurrence, provided know $f(1)$ and only want it for $f(3^k),$ $k ge 0.$
    – coffeemath
    Dec 10 '18 at 5:33
















1












1








1


1





Solve the recurrence relation:



$f(n) = 4f(n/3)+5$ where $n=3^k, k=1,2,3...$ and $f(1)=5$



I never seen a recurrence relation like this before. What would I need to use or do to solve this?






combinatorics discrete-mathematics recurrence-relations







share|cite|improve this question













Solve the recurrence relation:



$f(n) = 4f(n/3)+5$ where $n=3^k, k=1,2,3...$ and $f(1)=5$



I never seen a recurrence relation like this before. What would I need to use or do to solve this?






combinatorics discrete-mathematics recurrence-relations




combinatorics discrete-mathematics recurrence-relations






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Dec 10 '18 at 5:26









cosmicbrownie

1016




1016








  • 1




    You could, as usual, try induction.
    – Lucas Henrique
    Dec 10 '18 at 5:28










  • If you are only looking for an asymptotic bound, you can use master theorem.
    – platty
    Dec 10 '18 at 5:32










  • If $n=3^k$ then $n/3=3^{k-1}$ and it becomes a usual recurrence, provided know $f(1)$ and only want it for $f(3^k),$ $k ge 0.$
    – coffeemath
    Dec 10 '18 at 5:33
















  • 1




    You could, as usual, try induction.
    – Lucas Henrique
    Dec 10 '18 at 5:28










  • If you are only looking for an asymptotic bound, you can use master theorem.
    – platty
    Dec 10 '18 at 5:32










  • If $n=3^k$ then $n/3=3^{k-1}$ and it becomes a usual recurrence, provided know $f(1)$ and only want it for $f(3^k),$ $k ge 0.$
    – coffeemath
    Dec 10 '18 at 5:33










1




1




You could, as usual, try induction.
– Lucas Henrique
Dec 10 '18 at 5:28




You could, as usual, try induction.
– Lucas Henrique
Dec 10 '18 at 5:28












If you are only looking for an asymptotic bound, you can use master theorem.
– platty
Dec 10 '18 at 5:32




If you are only looking for an asymptotic bound, you can use master theorem.
– platty
Dec 10 '18 at 5:32












If $n=3^k$ then $n/3=3^{k-1}$ and it becomes a usual recurrence, provided know $f(1)$ and only want it for $f(3^k),$ $k ge 0.$
– coffeemath
Dec 10 '18 at 5:33






If $n=3^k$ then $n/3=3^{k-1}$ and it becomes a usual recurrence, provided know $f(1)$ and only want it for $f(3^k),$ $k ge 0.$
– coffeemath
Dec 10 '18 at 5:33












3 Answers
3






active

oldest

votes


















1














Let $f(3^k)=g(k)+c,k=0implies?$



$5=g(k)-4g(k-1)+c-4c$



Set $c-4c=5$ so that $g(k)=4g(k-1)=4^rg(k-r)=4^kg(0)$






share|cite|improve this answer





























    0














    Also, you can find a tight result from the mater theorem and we can say $f(n) = Theta(n^{log_34})$, and as $n = 3^k$, $f(n) sim (3^k)^{log_34} = 4^k$.






    share|cite|improve this answer





























      0














      One approach which I find useful is the following:



      As already mentioned by Lucas Henrique, you can first of all define $a_k := f(3^k)$. This gives you the relation
      $$
      a_k = 4a_{k-1} + 5, quad quad a_0 = 5
      $$
      From here on, you have several options. You can use generating functions, just plug in some values and try to find a pattern or assume you have a "big" $k$ and use the above formula several times:
      begin{eqnarray}
      a_k &=& 4a_{k-1} +5\
      & = & 4 (4a_{k-2}+5)+5 = 4^2 a_{k-2} + (4+1)cdot 5\
      & = & 4^2 (4a_{k-3} +5)+(4+1) cdot5 = 4^3 a_{k-3} + (4^2 + 4 + 1)cdot 5\
      & = & dots
      end{eqnarray}
      Now you may already derive a formula from that.



      Hint: for $q neq -1$, one has $sum_{k=0}^n q^k = frac{1-q^{n+1}}{1-q}$






      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%2f3033489%2fsolve-the-recurrence-relation-fn-4fn-35-where-n-3k-k-1-2-3-and%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









        1














        Let $f(3^k)=g(k)+c,k=0implies?$



        $5=g(k)-4g(k-1)+c-4c$



        Set $c-4c=5$ so that $g(k)=4g(k-1)=4^rg(k-r)=4^kg(0)$






        share|cite|improve this answer


























          1














          Let $f(3^k)=g(k)+c,k=0implies?$



          $5=g(k)-4g(k-1)+c-4c$



          Set $c-4c=5$ so that $g(k)=4g(k-1)=4^rg(k-r)=4^kg(0)$






          share|cite|improve this answer
























            1












            1








            1






            Let $f(3^k)=g(k)+c,k=0implies?$



            $5=g(k)-4g(k-1)+c-4c$



            Set $c-4c=5$ so that $g(k)=4g(k-1)=4^rg(k-r)=4^kg(0)$






            share|cite|improve this answer












            Let $f(3^k)=g(k)+c,k=0implies?$



            $5=g(k)-4g(k-1)+c-4c$



            Set $c-4c=5$ so that $g(k)=4g(k-1)=4^rg(k-r)=4^kg(0)$







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered Dec 10 '18 at 5:53









            lab bhattacharjee

            223k15156274




            223k15156274























                0














                Also, you can find a tight result from the mater theorem and we can say $f(n) = Theta(n^{log_34})$, and as $n = 3^k$, $f(n) sim (3^k)^{log_34} = 4^k$.






                share|cite|improve this answer


























                  0














                  Also, you can find a tight result from the mater theorem and we can say $f(n) = Theta(n^{log_34})$, and as $n = 3^k$, $f(n) sim (3^k)^{log_34} = 4^k$.






                  share|cite|improve this answer
























                    0












                    0








                    0






                    Also, you can find a tight result from the mater theorem and we can say $f(n) = Theta(n^{log_34})$, and as $n = 3^k$, $f(n) sim (3^k)^{log_34} = 4^k$.






                    share|cite|improve this answer












                    Also, you can find a tight result from the mater theorem and we can say $f(n) = Theta(n^{log_34})$, and as $n = 3^k$, $f(n) sim (3^k)^{log_34} = 4^k$.







                    share|cite|improve this answer












                    share|cite|improve this answer



                    share|cite|improve this answer










                    answered Dec 10 '18 at 10:09









                    OmG

                    2,190620




                    2,190620























                        0














                        One approach which I find useful is the following:



                        As already mentioned by Lucas Henrique, you can first of all define $a_k := f(3^k)$. This gives you the relation
                        $$
                        a_k = 4a_{k-1} + 5, quad quad a_0 = 5
                        $$
                        From here on, you have several options. You can use generating functions, just plug in some values and try to find a pattern or assume you have a "big" $k$ and use the above formula several times:
                        begin{eqnarray}
                        a_k &=& 4a_{k-1} +5\
                        & = & 4 (4a_{k-2}+5)+5 = 4^2 a_{k-2} + (4+1)cdot 5\
                        & = & 4^2 (4a_{k-3} +5)+(4+1) cdot5 = 4^3 a_{k-3} + (4^2 + 4 + 1)cdot 5\
                        & = & dots
                        end{eqnarray}
                        Now you may already derive a formula from that.



                        Hint: for $q neq -1$, one has $sum_{k=0}^n q^k = frac{1-q^{n+1}}{1-q}$






                        share|cite|improve this answer


























                          0














                          One approach which I find useful is the following:



                          As already mentioned by Lucas Henrique, you can first of all define $a_k := f(3^k)$. This gives you the relation
                          $$
                          a_k = 4a_{k-1} + 5, quad quad a_0 = 5
                          $$
                          From here on, you have several options. You can use generating functions, just plug in some values and try to find a pattern or assume you have a "big" $k$ and use the above formula several times:
                          begin{eqnarray}
                          a_k &=& 4a_{k-1} +5\
                          & = & 4 (4a_{k-2}+5)+5 = 4^2 a_{k-2} + (4+1)cdot 5\
                          & = & 4^2 (4a_{k-3} +5)+(4+1) cdot5 = 4^3 a_{k-3} + (4^2 + 4 + 1)cdot 5\
                          & = & dots
                          end{eqnarray}
                          Now you may already derive a formula from that.



                          Hint: for $q neq -1$, one has $sum_{k=0}^n q^k = frac{1-q^{n+1}}{1-q}$






                          share|cite|improve this answer
























                            0












                            0








                            0






                            One approach which I find useful is the following:



                            As already mentioned by Lucas Henrique, you can first of all define $a_k := f(3^k)$. This gives you the relation
                            $$
                            a_k = 4a_{k-1} + 5, quad quad a_0 = 5
                            $$
                            From here on, you have several options. You can use generating functions, just plug in some values and try to find a pattern or assume you have a "big" $k$ and use the above formula several times:
                            begin{eqnarray}
                            a_k &=& 4a_{k-1} +5\
                            & = & 4 (4a_{k-2}+5)+5 = 4^2 a_{k-2} + (4+1)cdot 5\
                            & = & 4^2 (4a_{k-3} +5)+(4+1) cdot5 = 4^3 a_{k-3} + (4^2 + 4 + 1)cdot 5\
                            & = & dots
                            end{eqnarray}
                            Now you may already derive a formula from that.



                            Hint: for $q neq -1$, one has $sum_{k=0}^n q^k = frac{1-q^{n+1}}{1-q}$






                            share|cite|improve this answer












                            One approach which I find useful is the following:



                            As already mentioned by Lucas Henrique, you can first of all define $a_k := f(3^k)$. This gives you the relation
                            $$
                            a_k = 4a_{k-1} + 5, quad quad a_0 = 5
                            $$
                            From here on, you have several options. You can use generating functions, just plug in some values and try to find a pattern or assume you have a "big" $k$ and use the above formula several times:
                            begin{eqnarray}
                            a_k &=& 4a_{k-1} +5\
                            & = & 4 (4a_{k-2}+5)+5 = 4^2 a_{k-2} + (4+1)cdot 5\
                            & = & 4^2 (4a_{k-3} +5)+(4+1) cdot5 = 4^3 a_{k-3} + (4^2 + 4 + 1)cdot 5\
                            & = & dots
                            end{eqnarray}
                            Now you may already derive a formula from that.



                            Hint: for $q neq -1$, one has $sum_{k=0}^n q^k = frac{1-q^{n+1}}{1-q}$







                            share|cite|improve this answer












                            share|cite|improve this answer



                            share|cite|improve this answer










                            answered Dec 10 '18 at 10:34









                            bruderjakob17

                            1587




                            1587






























                                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%2f3033489%2fsolve-the-recurrence-relation-fn-4fn-35-where-n-3k-k-1-2-3-and%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

                                Bressuire

                                Image
                                .mw-parser-output .infobox{border:1px solid #aaa;background-color:#f9f9f9;color:black;margin:.5em 0 .5em 1em;padding:.2em;float:right;clear:right;width:22em;text-align:left;font-size:88%;line-height:1.6em}.mw-parser-output .infobox td,.mw-parser-output .infobox th{vertical-align:top;padding:0 .2em}.mw-parser-output .infobox caption{font-size:larger}.mw-parser-output .infobox.bordered{border-collapse:collapse}.mw-parser-output .infobox.bordered td,.mw-parser-output .infobox.bordered th{border:1px solid #aaa}.mw-parser-output .infobox.bordered .borderless td,.mw-parser-output .infobox.bordered .borderless th{border:0}.mw-parser-output .infobox-showbutton .mw-collapsible-text{color:inherit}.mw-parser-output .infobox.bordered .mergedtoprow td,.mw-parser-output .infobox.bordered .mergedtoprow th{border:0;border-top:1px solid #aaa;border-right:1px solid #aaa}.mw-parser-output .infobox.bordered .mergedrow td,.mw-parser-output .infobox.bordered .mergedrow th{border:0;border-right:1px solid ...
                                Read more

                                Cabo Verde

                                Image
                                  Nota: Cabo-verdiano redireciona para este artigo. Para a língua falada em Cabo Verde, veja crioulo cabo-verdiano. Para outros significados, veja Cabo Verde (desambiguação). Coordenadas: 14° 55' N 23° 31' O Cabo Verde República de Cabo Verde Bandeira Brasão de Armas Lema: Unidade, Trabalho, Progresso Hino nacional: Cântico da Liberdade Gentílico: cabo-verdiano [ 1 ] Capital Praia 14° 55' N 23° 31' O Cidade mais populosa Praia Língua oficial Português Governo República unitária semipresidencialista [ 2 ]  - Presidente Jorge Carlos Fonseca  - Primeiro-ministro Ulisses Correia e Silva História    - Descoberta 1460   - Independência 00 • de Portugal 5 de Julho de 1975   - Multipartidarismo 13 de Janeiro de 1990  Área    - Total 4 033 km² (146.º)  - Água (%) 0,08 População    - Estimativa para 2017 560 899 [ 3 ] hab. (173.º) ...
                                Read more

                                Gyllenstierna

                                Image
                                .mw-parser-output .infobox{border:1px solid #aaa;background-color:#f9f9f9;color:black;margin:.5em 0 .5em 1em;padding:.2em;float:right;clear:right;width:22em;text-align:left;font-size:88%;line-height:1.6em}.mw-parser-output .infobox td,.mw-parser-output .infobox th{vertical-align:top;padding:0 .2em}.mw-parser-output .infobox caption{font-size:larger}.mw-parser-output .infobox.bordered{border-collapse:collapse}.mw-parser-output .infobox.bordered td,.mw-parser-output .infobox.bordered th{border:1px solid #aaa}.mw-parser-output .infobox.bordered .borderless td,.mw-parser-output .infobox.bordered .borderless th{border:0}.mw-parser-output .infobox-showbutton .mw-collapsible-text{color:inherit}.mw-parser-output .infobox.bordered .mergedtoprow td,.mw-parser-output .infobox.bordered .mergedtoprow th{border:0;border-top:1px solid #aaa;border-right:1px solid #aaa}.mw-parser-output .infobox.bordered .mergedrow td,.mw-parser-output .infobox.bordered .mergedrow th{border:0;border-right:1px solid ...
                                Read more