Recurrence Relation: $B(n) = 5cdot B(n/3) + c(n^2)$ Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)Recurrence relation practice problem that I can't figure outfind the recurrence relation (homework)Help proving this recurrence relation?Solve the recurrence relation $T(n) = nT^2(n/2)$Create a recurrence relation for number of ways to construct something of length nHow to solve the recurrence relationnon-homogeneous Recurrence Relation for f(x) = n^2Solving (non-linear) recurrence relationSolving a recurrence relation problem, am I doing it correctly?Recurrence Relation, Compound Annually
Project Euler #1 in C++
Solve equation for value of x:
How to force a browser when connecting to a specific domain to be https only using only the client machine?
Test print coming out spongy
Google .dev domain strangely redirects to https
What is the difference between CTSS and ITS?
Why are vacuum tubes still used in amateur radios?
Sally's older brother
RSA find public exponent
License to disallow distribution in closed source software, but allow exceptions made by owner?
Cut your dress down to your length/size
What does 丫 mean? 丫是什么意思?
Why is it faster to reheat something than it is to cook it?
How does light 'choose' between wave and particle behaviour?
A term for a woman complaining about things/begging in a cute/childish way
Co-worker has annoying ringtone
Random body shuffle every night—can we still function?
What does it mean that physics no longer uses mechanical models to describe phenomena?
"klopfte jemand" or "jemand klopfte"?
What initially awakened the Balrog?
Does the Mueller report show a conspiracy between Russia and the Trump Campaign?
New Order #6: Easter Egg
Understanding p-Values using an example
Positioning dot before text in math mode
Recurrence Relation: $B(n) = 5cdot B(n/3) + c(n^2)$
Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)Recurrence relation practice problem that I can't figure outfind the recurrence relation (homework)Help proving this recurrence relation?Solve the recurrence relation $T(n) = nT^2(n/2)$Create a recurrence relation for number of ways to construct something of length nHow to solve the recurrence relationnon-homogeneous Recurrence Relation for f(x) = n^2Solving (non-linear) recurrence relationSolving a recurrence relation problem, am I doing it correctly?Recurrence Relation, Compound Annually
$begingroup$
I'm working on deriving this recurrence relation in the form $O(n^d)$ for some value of d:
$B(n) = 5cdot B(fracn3) + cn^2$
The initial condition is:
$B(1) = c$
I'm having trouble incorporating the n^2 into my derivation. This is what I have so far:
We set $n = 3^k$
$5^k(1 + frac53 + (frac53)^2 + ... + (frac53)^k$
Which leads to $3^kcdot (frac103)^k$ -> $5^k = 5^log_3n$ -> $log_3n = k$
Not sure how to derive the final running time to be $O(n^d)$. Any help would be appreciated!
analysis recurrence-relations
$endgroup$
add a comment |
$begingroup$
I'm working on deriving this recurrence relation in the form $O(n^d)$ for some value of d:
$B(n) = 5cdot B(fracn3) + cn^2$
The initial condition is:
$B(1) = c$
I'm having trouble incorporating the n^2 into my derivation. This is what I have so far:
We set $n = 3^k$
$5^k(1 + frac53 + (frac53)^2 + ... + (frac53)^k$
Which leads to $3^kcdot (frac103)^k$ -> $5^k = 5^log_3n$ -> $log_3n = k$
Not sure how to derive the final running time to be $O(n^d)$. Any help would be appreciated!
analysis recurrence-relations
$endgroup$
add a comment |
$begingroup$
I'm working on deriving this recurrence relation in the form $O(n^d)$ for some value of d:
$B(n) = 5cdot B(fracn3) + cn^2$
The initial condition is:
$B(1) = c$
I'm having trouble incorporating the n^2 into my derivation. This is what I have so far:
We set $n = 3^k$
$5^k(1 + frac53 + (frac53)^2 + ... + (frac53)^k$
Which leads to $3^kcdot (frac103)^k$ -> $5^k = 5^log_3n$ -> $log_3n = k$
Not sure how to derive the final running time to be $O(n^d)$. Any help would be appreciated!
analysis recurrence-relations
$endgroup$
I'm working on deriving this recurrence relation in the form $O(n^d)$ for some value of d:
$B(n) = 5cdot B(fracn3) + cn^2$
The initial condition is:
$B(1) = c$
I'm having trouble incorporating the n^2 into my derivation. This is what I have so far:
We set $n = 3^k$
$5^k(1 + frac53 + (frac53)^2 + ... + (frac53)^k$
Which leads to $3^kcdot (frac103)^k$ -> $5^k = 5^log_3n$ -> $log_3n = k$
Not sure how to derive the final running time to be $O(n^d)$. Any help would be appreciated!
analysis recurrence-relations
analysis recurrence-relations
edited Apr 2 at 8:06
idriskameni
749321
749321
asked Apr 2 at 7:04
user7339685user7339685
62
62
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
beginequation
beginsplit
B(n) &= 5B(fracn3) + cn^2 \
&= 5(5B(fracn3^2) + c(fracn3)^2) + cn^2 \
&= 5^2B(fracn3^2) + c[5(fracn3)^2 + n^2] \
&= 5^2(5B(fracn3^3) + c(fracn3^2)^2) + c[5(fracn3)^2 + n^2] \
&= 5^3B(fracn3^3) + c[5^2(fracn3^2)^2 +5(fracn3)^2 + n^2] \
&= vdots \
&= 5^kB(fracn3^k) + c[5^k-1(fracn3^k-1)^2 + ldots +5(fracn3)^2 + n^2]\
&= 5^kB(fracn3^k) + cn^2 sum_i=0^k-1 5^i(frac13^i)^2 \
&= 5^kB(fracn3^k) + cn^2 sum_i=0^k-1 (frac53^2)^i \
&= 5^kB(fracn3^k) + cn^2 frac1-(frac59)^k1- frac59
endsplit
endequation
But $B(1) = c$ hence for $k=log_3 n$
$$B(n) = 5^log_3 nc + frac94 cn^2 (1-(frac59)^log_3 n)$$
It seems that the dominating term is $O(n^2)$.
$endgroup$
add a comment |
$begingroup$
$$
B(3^log_3 n)-5B(3^log_3 frac n3)=c n^2
$$
now calling $B'(u) = B(3^u)$ with $u = log_3 n$ we have
$$
B'(u)-5B'(u-1) = c 9^u
$$
this is a linear recurrence with solution
$$
B'(u) = B'(u)_h + B'_p(u)\
B'_h(u)-5B'_h(u-1) = 0\
B'_p(u)-5B'_p(u-1) = c 9^u
$$
with $B'_h(u) = C_0 5^u-1$ Now making $B'_p(u) = C_0(u)5^u-1$ and substituting into the particular we get the recurrence
$$
C_0(u)-C_0(u-1) = c 9^u5^u-1
$$
with solution
$$
C_0(u) = cleft(frac454left(frac 95right)^u-1right)
$$
then
$$
B'(u) = C_0 5^u-1 + cleft(frac454left(frac 95right)^u-1right)5^u-1
$$
hence
$$
B(n) = frac120left((4C_0-45c)5^log_3 n+45 c n^2right)
$$
and after incorporating the initial conditions we have
$$
B(n) = frac c4left(9n^2-5^log_3 (3n)right)
$$
$endgroup$
add a comment |
Your Answer
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
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3171538%2frecurrence-relation-bn-5-cdot-bn-3-cn2%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
beginequation
beginsplit
B(n) &= 5B(fracn3) + cn^2 \
&= 5(5B(fracn3^2) + c(fracn3)^2) + cn^2 \
&= 5^2B(fracn3^2) + c[5(fracn3)^2 + n^2] \
&= 5^2(5B(fracn3^3) + c(fracn3^2)^2) + c[5(fracn3)^2 + n^2] \
&= 5^3B(fracn3^3) + c[5^2(fracn3^2)^2 +5(fracn3)^2 + n^2] \
&= vdots \
&= 5^kB(fracn3^k) + c[5^k-1(fracn3^k-1)^2 + ldots +5(fracn3)^2 + n^2]\
&= 5^kB(fracn3^k) + cn^2 sum_i=0^k-1 5^i(frac13^i)^2 \
&= 5^kB(fracn3^k) + cn^2 sum_i=0^k-1 (frac53^2)^i \
&= 5^kB(fracn3^k) + cn^2 frac1-(frac59)^k1- frac59
endsplit
endequation
But $B(1) = c$ hence for $k=log_3 n$
$$B(n) = 5^log_3 nc + frac94 cn^2 (1-(frac59)^log_3 n)$$
It seems that the dominating term is $O(n^2)$.
$endgroup$
add a comment |
$begingroup$
beginequation
beginsplit
B(n) &= 5B(fracn3) + cn^2 \
&= 5(5B(fracn3^2) + c(fracn3)^2) + cn^2 \
&= 5^2B(fracn3^2) + c[5(fracn3)^2 + n^2] \
&= 5^2(5B(fracn3^3) + c(fracn3^2)^2) + c[5(fracn3)^2 + n^2] \
&= 5^3B(fracn3^3) + c[5^2(fracn3^2)^2 +5(fracn3)^2 + n^2] \
&= vdots \
&= 5^kB(fracn3^k) + c[5^k-1(fracn3^k-1)^2 + ldots +5(fracn3)^2 + n^2]\
&= 5^kB(fracn3^k) + cn^2 sum_i=0^k-1 5^i(frac13^i)^2 \
&= 5^kB(fracn3^k) + cn^2 sum_i=0^k-1 (frac53^2)^i \
&= 5^kB(fracn3^k) + cn^2 frac1-(frac59)^k1- frac59
endsplit
endequation
But $B(1) = c$ hence for $k=log_3 n$
$$B(n) = 5^log_3 nc + frac94 cn^2 (1-(frac59)^log_3 n)$$
It seems that the dominating term is $O(n^2)$.
$endgroup$
add a comment |
$begingroup$
beginequation
beginsplit
B(n) &= 5B(fracn3) + cn^2 \
&= 5(5B(fracn3^2) + c(fracn3)^2) + cn^2 \
&= 5^2B(fracn3^2) + c[5(fracn3)^2 + n^2] \
&= 5^2(5B(fracn3^3) + c(fracn3^2)^2) + c[5(fracn3)^2 + n^2] \
&= 5^3B(fracn3^3) + c[5^2(fracn3^2)^2 +5(fracn3)^2 + n^2] \
&= vdots \
&= 5^kB(fracn3^k) + c[5^k-1(fracn3^k-1)^2 + ldots +5(fracn3)^2 + n^2]\
&= 5^kB(fracn3^k) + cn^2 sum_i=0^k-1 5^i(frac13^i)^2 \
&= 5^kB(fracn3^k) + cn^2 sum_i=0^k-1 (frac53^2)^i \
&= 5^kB(fracn3^k) + cn^2 frac1-(frac59)^k1- frac59
endsplit
endequation
But $B(1) = c$ hence for $k=log_3 n$
$$B(n) = 5^log_3 nc + frac94 cn^2 (1-(frac59)^log_3 n)$$
It seems that the dominating term is $O(n^2)$.
$endgroup$
beginequation
beginsplit
B(n) &= 5B(fracn3) + cn^2 \
&= 5(5B(fracn3^2) + c(fracn3)^2) + cn^2 \
&= 5^2B(fracn3^2) + c[5(fracn3)^2 + n^2] \
&= 5^2(5B(fracn3^3) + c(fracn3^2)^2) + c[5(fracn3)^2 + n^2] \
&= 5^3B(fracn3^3) + c[5^2(fracn3^2)^2 +5(fracn3)^2 + n^2] \
&= vdots \
&= 5^kB(fracn3^k) + c[5^k-1(fracn3^k-1)^2 + ldots +5(fracn3)^2 + n^2]\
&= 5^kB(fracn3^k) + cn^2 sum_i=0^k-1 5^i(frac13^i)^2 \
&= 5^kB(fracn3^k) + cn^2 sum_i=0^k-1 (frac53^2)^i \
&= 5^kB(fracn3^k) + cn^2 frac1-(frac59)^k1- frac59
endsplit
endequation
But $B(1) = c$ hence for $k=log_3 n$
$$B(n) = 5^log_3 nc + frac94 cn^2 (1-(frac59)^log_3 n)$$
It seems that the dominating term is $O(n^2)$.
answered Apr 2 at 7:24
Ahmad BazziAhmad Bazzi
8,5212824
8,5212824
add a comment |
add a comment |
$begingroup$
$$
B(3^log_3 n)-5B(3^log_3 frac n3)=c n^2
$$
now calling $B'(u) = B(3^u)$ with $u = log_3 n$ we have
$$
B'(u)-5B'(u-1) = c 9^u
$$
this is a linear recurrence with solution
$$
B'(u) = B'(u)_h + B'_p(u)\
B'_h(u)-5B'_h(u-1) = 0\
B'_p(u)-5B'_p(u-1) = c 9^u
$$
with $B'_h(u) = C_0 5^u-1$ Now making $B'_p(u) = C_0(u)5^u-1$ and substituting into the particular we get the recurrence
$$
C_0(u)-C_0(u-1) = c 9^u5^u-1
$$
with solution
$$
C_0(u) = cleft(frac454left(frac 95right)^u-1right)
$$
then
$$
B'(u) = C_0 5^u-1 + cleft(frac454left(frac 95right)^u-1right)5^u-1
$$
hence
$$
B(n) = frac120left((4C_0-45c)5^log_3 n+45 c n^2right)
$$
and after incorporating the initial conditions we have
$$
B(n) = frac c4left(9n^2-5^log_3 (3n)right)
$$
$endgroup$
add a comment |
$begingroup$
$$
B(3^log_3 n)-5B(3^log_3 frac n3)=c n^2
$$
now calling $B'(u) = B(3^u)$ with $u = log_3 n$ we have
$$
B'(u)-5B'(u-1) = c 9^u
$$
this is a linear recurrence with solution
$$
B'(u) = B'(u)_h + B'_p(u)\
B'_h(u)-5B'_h(u-1) = 0\
B'_p(u)-5B'_p(u-1) = c 9^u
$$
with $B'_h(u) = C_0 5^u-1$ Now making $B'_p(u) = C_0(u)5^u-1$ and substituting into the particular we get the recurrence
$$
C_0(u)-C_0(u-1) = c 9^u5^u-1
$$
with solution
$$
C_0(u) = cleft(frac454left(frac 95right)^u-1right)
$$
then
$$
B'(u) = C_0 5^u-1 + cleft(frac454left(frac 95right)^u-1right)5^u-1
$$
hence
$$
B(n) = frac120left((4C_0-45c)5^log_3 n+45 c n^2right)
$$
and after incorporating the initial conditions we have
$$
B(n) = frac c4left(9n^2-5^log_3 (3n)right)
$$
$endgroup$
add a comment |
$begingroup$
$$
B(3^log_3 n)-5B(3^log_3 frac n3)=c n^2
$$
now calling $B'(u) = B(3^u)$ with $u = log_3 n$ we have
$$
B'(u)-5B'(u-1) = c 9^u
$$
this is a linear recurrence with solution
$$
B'(u) = B'(u)_h + B'_p(u)\
B'_h(u)-5B'_h(u-1) = 0\
B'_p(u)-5B'_p(u-1) = c 9^u
$$
with $B'_h(u) = C_0 5^u-1$ Now making $B'_p(u) = C_0(u)5^u-1$ and substituting into the particular we get the recurrence
$$
C_0(u)-C_0(u-1) = c 9^u5^u-1
$$
with solution
$$
C_0(u) = cleft(frac454left(frac 95right)^u-1right)
$$
then
$$
B'(u) = C_0 5^u-1 + cleft(frac454left(frac 95right)^u-1right)5^u-1
$$
hence
$$
B(n) = frac120left((4C_0-45c)5^log_3 n+45 c n^2right)
$$
and after incorporating the initial conditions we have
$$
B(n) = frac c4left(9n^2-5^log_3 (3n)right)
$$
$endgroup$
$$
B(3^log_3 n)-5B(3^log_3 frac n3)=c n^2
$$
now calling $B'(u) = B(3^u)$ with $u = log_3 n$ we have
$$
B'(u)-5B'(u-1) = c 9^u
$$
this is a linear recurrence with solution
$$
B'(u) = B'(u)_h + B'_p(u)\
B'_h(u)-5B'_h(u-1) = 0\
B'_p(u)-5B'_p(u-1) = c 9^u
$$
with $B'_h(u) = C_0 5^u-1$ Now making $B'_p(u) = C_0(u)5^u-1$ and substituting into the particular we get the recurrence
$$
C_0(u)-C_0(u-1) = c 9^u5^u-1
$$
with solution
$$
C_0(u) = cleft(frac454left(frac 95right)^u-1right)
$$
then
$$
B'(u) = C_0 5^u-1 + cleft(frac454left(frac 95right)^u-1right)5^u-1
$$
hence
$$
B(n) = frac120left((4C_0-45c)5^log_3 n+45 c n^2right)
$$
and after incorporating the initial conditions we have
$$
B(n) = frac c4left(9n^2-5^log_3 (3n)right)
$$
answered Apr 2 at 10:54
CesareoCesareo
10k3518
10k3518
add a comment |
add a comment |
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.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3171538%2frecurrence-relation-bn-5-cdot-bn-3-cn2%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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