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












1












$begingroup$


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









$endgroup$








  • 1




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










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










  • $begingroup$
    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.$
    $endgroup$
    – coffeemath
    Dec 10 '18 at 5:33


















1












$begingroup$


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









$endgroup$








  • 1




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










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










  • $begingroup$
    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.$
    $endgroup$
    – coffeemath
    Dec 10 '18 at 5:33
















1












1








1


0



$begingroup$


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









$endgroup$




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









cosmicbrowniecosmicbrownie

1016




1016








  • 1




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










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










  • $begingroup$
    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.$
    $endgroup$
    – coffeemath
    Dec 10 '18 at 5:33
















  • 1




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










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










  • $begingroup$
    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.$
    $endgroup$
    – coffeemath
    Dec 10 '18 at 5:33










1




1




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




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












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




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












$begingroup$
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.$
$endgroup$
– coffeemath
Dec 10 '18 at 5:33






$begingroup$
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.$
$endgroup$
– coffeemath
Dec 10 '18 at 5:33












3 Answers
3






active

oldest

votes


















1












$begingroup$

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









$endgroup$





















    0












    $begingroup$

    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









    $endgroup$





















      0












      $begingroup$

      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









      $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%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












        $begingroup$

        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









        $endgroup$


















          1












          $begingroup$

          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









          $endgroup$
















            1












            1








            1





            $begingroup$

            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









            $endgroup$



            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 bhattacharjeelab bhattacharjee

            226k15157275




            226k15157275























                0












                $begingroup$

                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









                $endgroup$


















                  0












                  $begingroup$

                  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









                  $endgroup$
















                    0












                    0








                    0





                    $begingroup$

                    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









                    $endgroup$



                    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









                    OmGOmG

                    2,502822




                    2,502822























                        0












                        $begingroup$

                        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









                        $endgroup$


















                          0












                          $begingroup$

                          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









                          $endgroup$
















                            0












                            0








                            0





                            $begingroup$

                            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









                            $endgroup$



                            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









                            bruderjakob17bruderjakob17

                            416110




                            416110






























                                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%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

                                Plaza Victoria

                                Image
                                Plaza Victoria Plaza Victoria en 2017 Otros nombres Plaza de La Victoria Localización El Almendral, Valparaíso, Chile Vías adyacentes Chacabuco, Molina, Plaza Victoria y Edwards Creación 1841 Metro Bellavista Ubicación 33°02′46″S 71°37′11″O  /  -33.04624167, -71.61980833 Coordenadas: 33°02′46″S 71°37′11″O  /  -33.04624167, -71.61980833 [editar datos en Wikidata] La Plaza Victoria , también llamada Plaza de la Victoria , [ 1 ] ​ es una plaza ubicada en el sector El Almendral del plan de la ciudad de Valparaíso, Chile, de importancia patrimonial, que incluye valiosas estatuas y especies vegetales. [ 2 ] ​ La plaza se creó como tal en la primera mitad del siglo XIX, tomando previamente los nombres de Plaza Nueva y Plaza de Orrego . Si bien desde sus inicios tuvo relevancia histórica, no fue sino a partir de fines de los años 1860 cuando comenzó a cobrar mayor importancia y se convirtió en uno de los principales centros sociales de l...
                                Read more

                                Puebla de Zaragoza

                                Image
                                Para otros usos de este término, véase Puebla (desambiguación). Heroica Puebla de Zaragoza Localidad De arriba a abajo de izquierda a derecha: Estrella de Puebla, Volcán Popocatépetl, Catedral de Puebla, Monumento a Ignacio Zaragoza, Estadio Cuauhtémoc, Angelópolis y Vista panorámica de la ciudad. Escudo Otros nombres: El relicario de América/ La ciudad de los Ángeles/ La Angelópolis Lema: Muy noble y muy leal ciudad de Puebla de los Ángeles Heroica Puebla de Zaragoza Localización de Heroica Puebla de Zaragoza en México Heroica Puebla de Zaragoza Localización de Heroica Puebla de Zaragoza en Puebla Mapa interactivo Coordenadas 19°03′05″N 98°13′04″O  /  19.051388888889, -98.217777777778 Coordenadas: 19°03′05″N 98°13′04″O  /  19.051388888889, -98.217777777778 Idioma oficial Español Entidad Localidad  • País   México  • Estado Puebla  • Municipio Puebla Presidente municipal Claudia Rivera Vivanc...
                                Read more

                                Musa

                                Image
                                Para el género de plantas, véase Musa (planta). Apolo y la Nueve Musas En la mitología griega, las musas (en griego antiguo μοῦσαι « mousai» ) son, según los escritores más antiguos, las divinidades inspiradoras de las Artes: cada una de ellas está relacionada con ramas artísticas y del conocimiento. Son hijas de Zeus y de Mnemósine, compañeras del séquito de Apolo, dios olímpico de la música y patrón de las bellas artes, quien tuvo romances con cada una de ellas, dejando descendientes. Bajaban a la tierra a susurrar ideas e inspirar a aquellos mortales que las invocaran. En la época más arcaica eran las ninfas inspiradoras de las fuentes, en las cuales eran adoradas. Finalmente, alrededor de los siglos VIII-VII a. C. [ 1 ] ​ prevaleció en todo el territorio de la Hélade la adoración de las nueve Musas, que son Calíope, Clío, Erato, Euterpe, Melpómene, Polimnia, Talía, Terpsícore y Urania. El culto a las musas era originalmente de Tracia y Beocia, y fueron de vital impo...
                                Read more