Recurrence $k$-th pattern by substitution












2














The recurrence is $T(n) = 9 T(frac{n}{3}) + {n^2}$.
Simplified to ${3^2} T(frac{n}{3}) + {n^2}$. Then



$$begin{align}
T(n)&= 3^4T(frac{n}{3^2}) + 4n\
&= 3^6T(frac{n}{3^3}) + 10n\
&= 3^8T(frac{n}{3^4}) + 28 n.
end{align}$$



I am trying to find the $k$-th pattern of this recurrence.










share|cite|improve this question




















  • 1




    How did you determine these were equivalent expressions?
    – David Peterson
    Nov 24 at 6:33










  • What if $3nmid n$? Or do you need only $T_k=T(3^k)$? (In the latter case, you get a first-order linear recurrence $T_k=9T_{k-1}+9^k$ which is easily solved: $T_k=(T_0+k)9^k$.)
    – metamorphy
    Nov 24 at 6:43
















2














The recurrence is $T(n) = 9 T(frac{n}{3}) + {n^2}$.
Simplified to ${3^2} T(frac{n}{3}) + {n^2}$. Then



$$begin{align}
T(n)&= 3^4T(frac{n}{3^2}) + 4n\
&= 3^6T(frac{n}{3^3}) + 10n\
&= 3^8T(frac{n}{3^4}) + 28 n.
end{align}$$



I am trying to find the $k$-th pattern of this recurrence.










share|cite|improve this question




















  • 1




    How did you determine these were equivalent expressions?
    – David Peterson
    Nov 24 at 6:33










  • What if $3nmid n$? Or do you need only $T_k=T(3^k)$? (In the latter case, you get a first-order linear recurrence $T_k=9T_{k-1}+9^k$ which is easily solved: $T_k=(T_0+k)9^k$.)
    – metamorphy
    Nov 24 at 6:43














2












2








2







The recurrence is $T(n) = 9 T(frac{n}{3}) + {n^2}$.
Simplified to ${3^2} T(frac{n}{3}) + {n^2}$. Then



$$begin{align}
T(n)&= 3^4T(frac{n}{3^2}) + 4n\
&= 3^6T(frac{n}{3^3}) + 10n\
&= 3^8T(frac{n}{3^4}) + 28 n.
end{align}$$



I am trying to find the $k$-th pattern of this recurrence.










share|cite|improve this question















The recurrence is $T(n) = 9 T(frac{n}{3}) + {n^2}$.
Simplified to ${3^2} T(frac{n}{3}) + {n^2}$. Then



$$begin{align}
T(n)&= 3^4T(frac{n}{3^2}) + 4n\
&= 3^6T(frac{n}{3^3}) + 10n\
&= 3^8T(frac{n}{3^4}) + 28 n.
end{align}$$



I am trying to find the $k$-th pattern of this recurrence.







combinatorics recurrence-relations






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 24 at 7:23









Robert Z

93.2k1061132




93.2k1061132










asked Nov 24 at 6:23









aryamank

466




466








  • 1




    How did you determine these were equivalent expressions?
    – David Peterson
    Nov 24 at 6:33










  • What if $3nmid n$? Or do you need only $T_k=T(3^k)$? (In the latter case, you get a first-order linear recurrence $T_k=9T_{k-1}+9^k$ which is easily solved: $T_k=(T_0+k)9^k$.)
    – metamorphy
    Nov 24 at 6:43














  • 1




    How did you determine these were equivalent expressions?
    – David Peterson
    Nov 24 at 6:33










  • What if $3nmid n$? Or do you need only $T_k=T(3^k)$? (In the latter case, you get a first-order linear recurrence $T_k=9T_{k-1}+9^k$ which is easily solved: $T_k=(T_0+k)9^k$.)
    – metamorphy
    Nov 24 at 6:43








1




1




How did you determine these were equivalent expressions?
– David Peterson
Nov 24 at 6:33




How did you determine these were equivalent expressions?
– David Peterson
Nov 24 at 6:33












What if $3nmid n$? Or do you need only $T_k=T(3^k)$? (In the latter case, you get a first-order linear recurrence $T_k=9T_{k-1}+9^k$ which is easily solved: $T_k=(T_0+k)9^k$.)
– metamorphy
Nov 24 at 6:43




What if $3nmid n$? Or do you need only $T_k=T(3^k)$? (In the latter case, you get a first-order linear recurrence $T_k=9T_{k-1}+9^k$ which is easily solved: $T_k=(T_0+k)9^k$.)
– metamorphy
Nov 24 at 6:43










1 Answer
1






active

oldest

votes


















1














In my opinion something is wrong in your approach.



If $T(n)={3^2} T(frac{n}{3}) + {n^2}$, then $T(frac{n}{3^k})={3^2} T(frac{n}{3^{k+1}}) + (frac{n}{3^k})^2$ and
$$begin{align}T(n)&={3^2} T(frac{n}{3}) + {n^2}={3^2} left({3^2} T(frac{n}{3^2}) + frac{n^2}{3^2}right) + n^2\
&={3^4} T(frac{n}{3^2}) + 2n^2
={3^4} left({3^2} T(frac{n}{3^3}) + frac{n^2}{3^4}right) + 2n^2\
&={3^6} T(frac{n}{3^3}) + 3n^2=dots={9^k} T(frac{n}{3^k}) + kn^2.\
end{align}$$



P.S. Do you know the Master Theorem?






share|cite|improve this answer























  • I don't, but I understand where I went wrong - thanks!
    – aryamank
    Nov 24 at 17:19











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%2f3011256%2frecurrence-k-th-pattern-by-substitution%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









1














In my opinion something is wrong in your approach.



If $T(n)={3^2} T(frac{n}{3}) + {n^2}$, then $T(frac{n}{3^k})={3^2} T(frac{n}{3^{k+1}}) + (frac{n}{3^k})^2$ and
$$begin{align}T(n)&={3^2} T(frac{n}{3}) + {n^2}={3^2} left({3^2} T(frac{n}{3^2}) + frac{n^2}{3^2}right) + n^2\
&={3^4} T(frac{n}{3^2}) + 2n^2
={3^4} left({3^2} T(frac{n}{3^3}) + frac{n^2}{3^4}right) + 2n^2\
&={3^6} T(frac{n}{3^3}) + 3n^2=dots={9^k} T(frac{n}{3^k}) + kn^2.\
end{align}$$



P.S. Do you know the Master Theorem?






share|cite|improve this answer























  • I don't, but I understand where I went wrong - thanks!
    – aryamank
    Nov 24 at 17:19
















1














In my opinion something is wrong in your approach.



If $T(n)={3^2} T(frac{n}{3}) + {n^2}$, then $T(frac{n}{3^k})={3^2} T(frac{n}{3^{k+1}}) + (frac{n}{3^k})^2$ and
$$begin{align}T(n)&={3^2} T(frac{n}{3}) + {n^2}={3^2} left({3^2} T(frac{n}{3^2}) + frac{n^2}{3^2}right) + n^2\
&={3^4} T(frac{n}{3^2}) + 2n^2
={3^4} left({3^2} T(frac{n}{3^3}) + frac{n^2}{3^4}right) + 2n^2\
&={3^6} T(frac{n}{3^3}) + 3n^2=dots={9^k} T(frac{n}{3^k}) + kn^2.\
end{align}$$



P.S. Do you know the Master Theorem?






share|cite|improve this answer























  • I don't, but I understand where I went wrong - thanks!
    – aryamank
    Nov 24 at 17:19














1












1








1






In my opinion something is wrong in your approach.



If $T(n)={3^2} T(frac{n}{3}) + {n^2}$, then $T(frac{n}{3^k})={3^2} T(frac{n}{3^{k+1}}) + (frac{n}{3^k})^2$ and
$$begin{align}T(n)&={3^2} T(frac{n}{3}) + {n^2}={3^2} left({3^2} T(frac{n}{3^2}) + frac{n^2}{3^2}right) + n^2\
&={3^4} T(frac{n}{3^2}) + 2n^2
={3^4} left({3^2} T(frac{n}{3^3}) + frac{n^2}{3^4}right) + 2n^2\
&={3^6} T(frac{n}{3^3}) + 3n^2=dots={9^k} T(frac{n}{3^k}) + kn^2.\
end{align}$$



P.S. Do you know the Master Theorem?






share|cite|improve this answer














In my opinion something is wrong in your approach.



If $T(n)={3^2} T(frac{n}{3}) + {n^2}$, then $T(frac{n}{3^k})={3^2} T(frac{n}{3^{k+1}}) + (frac{n}{3^k})^2$ and
$$begin{align}T(n)&={3^2} T(frac{n}{3}) + {n^2}={3^2} left({3^2} T(frac{n}{3^2}) + frac{n^2}{3^2}right) + n^2\
&={3^4} T(frac{n}{3^2}) + 2n^2
={3^4} left({3^2} T(frac{n}{3^3}) + frac{n^2}{3^4}right) + 2n^2\
&={3^6} T(frac{n}{3^3}) + 3n^2=dots={9^k} T(frac{n}{3^k}) + kn^2.\
end{align}$$



P.S. Do you know the Master Theorem?







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Nov 24 at 7:19

























answered Nov 24 at 6:51









Robert Z

93.2k1061132




93.2k1061132












  • I don't, but I understand where I went wrong - thanks!
    – aryamank
    Nov 24 at 17:19


















  • I don't, but I understand where I went wrong - thanks!
    – aryamank
    Nov 24 at 17:19
















I don't, but I understand where I went wrong - thanks!
– aryamank
Nov 24 at 17:19




I don't, but I understand where I went wrong - thanks!
– aryamank
Nov 24 at 17:19


















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%2f3011256%2frecurrence-k-th-pattern-by-substitution%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

Puebla de Zaragoza

Musa