How to solve $V(n) = 2 cdot V(n-1) + 2 cdot n$
$begingroup$
How to solve $V(n) = 2 cdot V(n-1) + 2cdot n$? I've tried using telescoping, but I'm not able to get correct solution. The textbook has a solution with homogeneous and particular solution and then gets the final solution but I don't know how to do that. Can I apply telescoping here and what is the proper way to do it?
recurrence-relations telescopic-series
$endgroup$
add a comment |
$begingroup$
How to solve $V(n) = 2 cdot V(n-1) + 2cdot n$? I've tried using telescoping, but I'm not able to get correct solution. The textbook has a solution with homogeneous and particular solution and then gets the final solution but I don't know how to do that. Can I apply telescoping here and what is the proper way to do it?
recurrence-relations telescopic-series
$endgroup$
$begingroup$
Can you solve W(n) = W(n-1) + (2n)/2^n ? Then relate the Ws to the Vs and you are done...
$endgroup$
– Did
Jan 20 at 11:03
$begingroup$
@user623855 2n ≠ 2^n.
$endgroup$
– Did
Jan 20 at 11:04
add a comment |
$begingroup$
How to solve $V(n) = 2 cdot V(n-1) + 2cdot n$? I've tried using telescoping, but I'm not able to get correct solution. The textbook has a solution with homogeneous and particular solution and then gets the final solution but I don't know how to do that. Can I apply telescoping here and what is the proper way to do it?
recurrence-relations telescopic-series
$endgroup$
How to solve $V(n) = 2 cdot V(n-1) + 2cdot n$? I've tried using telescoping, but I'm not able to get correct solution. The textbook has a solution with homogeneous and particular solution and then gets the final solution but I don't know how to do that. Can I apply telescoping here and what is the proper way to do it?
recurrence-relations telescopic-series
recurrence-relations telescopic-series
edited Jan 20 at 11:07
user289143
1,002313
1,002313
asked Jan 20 at 10:59
ponikoliponikoli
416
416
$begingroup$
Can you solve W(n) = W(n-1) + (2n)/2^n ? Then relate the Ws to the Vs and you are done...
$endgroup$
– Did
Jan 20 at 11:03
$begingroup$
@user623855 2n ≠ 2^n.
$endgroup$
– Did
Jan 20 at 11:04
add a comment |
$begingroup$
Can you solve W(n) = W(n-1) + (2n)/2^n ? Then relate the Ws to the Vs and you are done...
$endgroup$
– Did
Jan 20 at 11:03
$begingroup$
@user623855 2n ≠ 2^n.
$endgroup$
– Did
Jan 20 at 11:04
$begingroup$
Can you solve W(n) = W(n-1) + (2n)/2^n ? Then relate the Ws to the Vs and you are done...
$endgroup$
– Did
Jan 20 at 11:03
$begingroup$
Can you solve W(n) = W(n-1) + (2n)/2^n ? Then relate the Ws to the Vs and you are done...
$endgroup$
– Did
Jan 20 at 11:03
$begingroup$
@user623855 2n ≠ 2^n.
$endgroup$
– Did
Jan 20 at 11:04
$begingroup$
@user623855 2n ≠ 2^n.
$endgroup$
– Did
Jan 20 at 11:04
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Try to expand and generalize the case (by induction):
$$V(n) = 2times(2V(n-2) + 2(n-1)) + 2n = 2^2 V(n-2) + 2^2(n-1) + 2n = sum_{i=1}^{n}2^i(n-i+1)$$
Suppose $V(1) = 2$ in this case.
$endgroup$
add a comment |
$begingroup$
Let $V(m)=f(m)+am+b$
$$2n=V(n)-2V(n-1)=f(n)+an+b-2{f(m-1)+a(n-1)+b}$$
$$2n=f(n)-2f(n-1)-an+2a-b$$
Set $2a-b=0, -an=2$ so that $f(n)=2f(n-1)=2^rf(n-r),0le rle n$
$implies a=-2, b=2(-2)=?$
$endgroup$
add a comment |
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
});
}
});
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%2f3080437%2fhow-to-solve-vn-2-cdot-vn-1-2-cdot-n%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$
Try to expand and generalize the case (by induction):
$$V(n) = 2times(2V(n-2) + 2(n-1)) + 2n = 2^2 V(n-2) + 2^2(n-1) + 2n = sum_{i=1}^{n}2^i(n-i+1)$$
Suppose $V(1) = 2$ in this case.
$endgroup$
add a comment |
$begingroup$
Try to expand and generalize the case (by induction):
$$V(n) = 2times(2V(n-2) + 2(n-1)) + 2n = 2^2 V(n-2) + 2^2(n-1) + 2n = sum_{i=1}^{n}2^i(n-i+1)$$
Suppose $V(1) = 2$ in this case.
$endgroup$
add a comment |
$begingroup$
Try to expand and generalize the case (by induction):
$$V(n) = 2times(2V(n-2) + 2(n-1)) + 2n = 2^2 V(n-2) + 2^2(n-1) + 2n = sum_{i=1}^{n}2^i(n-i+1)$$
Suppose $V(1) = 2$ in this case.
$endgroup$
Try to expand and generalize the case (by induction):
$$V(n) = 2times(2V(n-2) + 2(n-1)) + 2n = 2^2 V(n-2) + 2^2(n-1) + 2n = sum_{i=1}^{n}2^i(n-i+1)$$
Suppose $V(1) = 2$ in this case.
answered Jan 20 at 11:05
OmGOmG
2,502822
2,502822
add a comment |
add a comment |
$begingroup$
Let $V(m)=f(m)+am+b$
$$2n=V(n)-2V(n-1)=f(n)+an+b-2{f(m-1)+a(n-1)+b}$$
$$2n=f(n)-2f(n-1)-an+2a-b$$
Set $2a-b=0, -an=2$ so that $f(n)=2f(n-1)=2^rf(n-r),0le rle n$
$implies a=-2, b=2(-2)=?$
$endgroup$
add a comment |
$begingroup$
Let $V(m)=f(m)+am+b$
$$2n=V(n)-2V(n-1)=f(n)+an+b-2{f(m-1)+a(n-1)+b}$$
$$2n=f(n)-2f(n-1)-an+2a-b$$
Set $2a-b=0, -an=2$ so that $f(n)=2f(n-1)=2^rf(n-r),0le rle n$
$implies a=-2, b=2(-2)=?$
$endgroup$
add a comment |
$begingroup$
Let $V(m)=f(m)+am+b$
$$2n=V(n)-2V(n-1)=f(n)+an+b-2{f(m-1)+a(n-1)+b}$$
$$2n=f(n)-2f(n-1)-an+2a-b$$
Set $2a-b=0, -an=2$ so that $f(n)=2f(n-1)=2^rf(n-r),0le rle n$
$implies a=-2, b=2(-2)=?$
$endgroup$
Let $V(m)=f(m)+am+b$
$$2n=V(n)-2V(n-1)=f(n)+an+b-2{f(m-1)+a(n-1)+b}$$
$$2n=f(n)-2f(n-1)-an+2a-b$$
Set $2a-b=0, -an=2$ so that $f(n)=2f(n-1)=2^rf(n-r),0le rle n$
$implies a=-2, b=2(-2)=?$
answered Jan 20 at 12:42
lab bhattacharjeelab bhattacharjee
226k15157275
226k15157275
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%2f3080437%2fhow-to-solve-vn-2-cdot-vn-1-2-cdot-n%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

$begingroup$
Can you solve W(n) = W(n-1) + (2n)/2^n ? Then relate the Ws to the Vs and you are done...
$endgroup$
– Did
Jan 20 at 11:03
$begingroup$
@user623855 2n ≠ 2^n.
$endgroup$
– Did
Jan 20 at 11:04