Prove by mathematical induction that $sum_{i=0}^n (n-i)2^i = 2^{n+1}-n-2$
up vote
0
down vote
favorite
I'm trying to prove this by mathematical induction, but I just can't seem to get the answer that I should be getting. Here's what I have so far:
Let $P(n)$ be the statement (this is the equation that I'm supposed to prove by induction): $$sum_{i=0}^n (n-i)2^i = 2^{n+1}-n-2,$$
Basis step: $(n=0)$: $$P(0) = (0-0)2^0 = 2^{0+1}-0-2 = 0 = 0.$$
Inductive step:
Assume that $P(n)$ is true, that is, $$sum_{i=0}^n (n-i)2^i = 2^{n+1}-n-2.$$
Showing that $P(n+1)$ is also true, that is:
$$sum_{i=0}^{n+1} (n-i)2^i = 2^{n+2}-(n+1)-2 $$
$$ = 2^{n+2}-n-3 $$
$P(n+1) ={}$ $$sum_{i=0}^{n+1} (n-i)2^i + n-(n+1)2^{n+1}$$
$$ = 2^{n+1}-n-2+(n-n-1)2^{n+1} $$
$$ = 2^{n+1}-n-2-(1)2^{n+1}$$
As can be seen, I am not getting back the result I'm supposed to be getting for $P(n+1)$. Can someone assist me here, please?
induction
add a comment |
up vote
0
down vote
favorite
I'm trying to prove this by mathematical induction, but I just can't seem to get the answer that I should be getting. Here's what I have so far:
Let $P(n)$ be the statement (this is the equation that I'm supposed to prove by induction): $$sum_{i=0}^n (n-i)2^i = 2^{n+1}-n-2,$$
Basis step: $(n=0)$: $$P(0) = (0-0)2^0 = 2^{0+1}-0-2 = 0 = 0.$$
Inductive step:
Assume that $P(n)$ is true, that is, $$sum_{i=0}^n (n-i)2^i = 2^{n+1}-n-2.$$
Showing that $P(n+1)$ is also true, that is:
$$sum_{i=0}^{n+1} (n-i)2^i = 2^{n+2}-(n+1)-2 $$
$$ = 2^{n+2}-n-3 $$
$P(n+1) ={}$ $$sum_{i=0}^{n+1} (n-i)2^i + n-(n+1)2^{n+1}$$
$$ = 2^{n+1}-n-2+(n-n-1)2^{n+1} $$
$$ = 2^{n+1}-n-2-(1)2^{n+1}$$
As can be seen, I am not getting back the result I'm supposed to be getting for $P(n+1)$. Can someone assist me here, please?
induction
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
I'm trying to prove this by mathematical induction, but I just can't seem to get the answer that I should be getting. Here's what I have so far:
Let $P(n)$ be the statement (this is the equation that I'm supposed to prove by induction): $$sum_{i=0}^n (n-i)2^i = 2^{n+1}-n-2,$$
Basis step: $(n=0)$: $$P(0) = (0-0)2^0 = 2^{0+1}-0-2 = 0 = 0.$$
Inductive step:
Assume that $P(n)$ is true, that is, $$sum_{i=0}^n (n-i)2^i = 2^{n+1}-n-2.$$
Showing that $P(n+1)$ is also true, that is:
$$sum_{i=0}^{n+1} (n-i)2^i = 2^{n+2}-(n+1)-2 $$
$$ = 2^{n+2}-n-3 $$
$P(n+1) ={}$ $$sum_{i=0}^{n+1} (n-i)2^i + n-(n+1)2^{n+1}$$
$$ = 2^{n+1}-n-2+(n-n-1)2^{n+1} $$
$$ = 2^{n+1}-n-2-(1)2^{n+1}$$
As can be seen, I am not getting back the result I'm supposed to be getting for $P(n+1)$. Can someone assist me here, please?
induction
I'm trying to prove this by mathematical induction, but I just can't seem to get the answer that I should be getting. Here's what I have so far:
Let $P(n)$ be the statement (this is the equation that I'm supposed to prove by induction): $$sum_{i=0}^n (n-i)2^i = 2^{n+1}-n-2,$$
Basis step: $(n=0)$: $$P(0) = (0-0)2^0 = 2^{0+1}-0-2 = 0 = 0.$$
Inductive step:
Assume that $P(n)$ is true, that is, $$sum_{i=0}^n (n-i)2^i = 2^{n+1}-n-2.$$
Showing that $P(n+1)$ is also true, that is:
$$sum_{i=0}^{n+1} (n-i)2^i = 2^{n+2}-(n+1)-2 $$
$$ = 2^{n+2}-n-3 $$
$P(n+1) ={}$ $$sum_{i=0}^{n+1} (n-i)2^i + n-(n+1)2^{n+1}$$
$$ = 2^{n+1}-n-2+(n-n-1)2^{n+1} $$
$$ = 2^{n+1}-n-2-(1)2^{n+1}$$
As can be seen, I am not getting back the result I'm supposed to be getting for $P(n+1)$. Can someone assist me here, please?
induction
induction
edited Nov 23 at 4:14
Tianlalu
2,8811935
2,8811935
asked Nov 23 at 4:03
pythonprogrammer12
31
31
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
up vote
0
down vote
accepted
Given $$P(color{red}n)=sum_{i=0}^color{red}n (color{red}n-i)2^i,$$ note:
$$begin{align}P(color{red}0)=&sum_{i=0}^color{red}0 (color{red}0-i)2^i = (color{red}0-0)2^0=0=2^{color{red}0+1}-color{red}0-2; text{(base step)}\
P(color{red}1)=&sum_{i=0}^color{red}1 (color{red}1-i)2^i = (color{red}1-0)2^0+(color{red}1-1)2^1=1;\
vdots\
P(color{red}{n})=&sum_{i=0}^{color{red}{n}} (color{red}{n}-i)2^i=color{blue}{2^{n+1}-n-2}; text{(inductive hypothesis)}\
P(color{red}{n+1})=&sum_{i=0}^{color{red}{n+1}} (color{red}{n+1}-i)2^i =\
=&sum_{i=0}^n (n+1-i)2^i+require{cancel} cancel{(n+1-(color{red}{n+1}))2^{n+1}}=\
=&sum_{i=0}^n(n-i)2^i+sum_{i=0}^n2^i=\
=&color{blue}{2^{n+1}-n-2}+2^{n+1}-1=\
=&2^{n+2}-(n+1)-2.end{align}$$
add a comment |
up vote
3
down vote
Your $P(n+1)$ is missing a $+1$ (as in, for "$n+1$") inside the sum parenthesis.
Hint:
begin{align}
sum_{i=0}^{n+1} (n+1-i)2^i &=sum_{i=0}^{n+1} (n-i)2^i +sum_{i=0}^{n+1}2^i \
&=(n-(n+1))2^{n+1} +color{blue}{sum_{i=0}^{n} (n-i)2^i} +sum_{i=0}^{n+1}2^i \
end{align}
Now you can use $color{blue}{P(n)}$. Also, you need $displaystyle sum_{i=0}^{n+1} 2^i = 2^{n+2} -1$.
(+1) What great use of colour!
– Shaun
Nov 23 at 4:59
Hmm, I'm not quite understanding why there are 3 terms in the equation for P(n+1). I thought that we're supposed to go up to P(n) then substitute (n+1) for n in the next term in the sequence?
– pythonprogrammer12
Nov 23 at 6:21
Look at your $color{blue}{P(n)}$: you have $color{blue}{displaystylesum_{i=0}^n (n-i)2^i}$ on the left-hand side. For $P(n+1)$, you would have $$sum_{i=0}^{n+1} ((n+1)-i)2^i =color{blue}{sum_{i=0}^n ((nbbox[yellow]{+1})-i)2^i} +((n+1)-(n+1))2^{n+1}$$ on the left-hand side, but you can't just use $color{blue}{P(n)}$ there, because of the $bbox[yellow]{+1}$. You have to take that $bbox[yellow]{+1}$ out of the sum for it to resemble that of $color{blue}{P(n)}$.
– Rócherz
Nov 23 at 8:06
add a comment |
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
0
down vote
accepted
Given $$P(color{red}n)=sum_{i=0}^color{red}n (color{red}n-i)2^i,$$ note:
$$begin{align}P(color{red}0)=&sum_{i=0}^color{red}0 (color{red}0-i)2^i = (color{red}0-0)2^0=0=2^{color{red}0+1}-color{red}0-2; text{(base step)}\
P(color{red}1)=&sum_{i=0}^color{red}1 (color{red}1-i)2^i = (color{red}1-0)2^0+(color{red}1-1)2^1=1;\
vdots\
P(color{red}{n})=&sum_{i=0}^{color{red}{n}} (color{red}{n}-i)2^i=color{blue}{2^{n+1}-n-2}; text{(inductive hypothesis)}\
P(color{red}{n+1})=&sum_{i=0}^{color{red}{n+1}} (color{red}{n+1}-i)2^i =\
=&sum_{i=0}^n (n+1-i)2^i+require{cancel} cancel{(n+1-(color{red}{n+1}))2^{n+1}}=\
=&sum_{i=0}^n(n-i)2^i+sum_{i=0}^n2^i=\
=&color{blue}{2^{n+1}-n-2}+2^{n+1}-1=\
=&2^{n+2}-(n+1)-2.end{align}$$
add a comment |
up vote
0
down vote
accepted
Given $$P(color{red}n)=sum_{i=0}^color{red}n (color{red}n-i)2^i,$$ note:
$$begin{align}P(color{red}0)=&sum_{i=0}^color{red}0 (color{red}0-i)2^i = (color{red}0-0)2^0=0=2^{color{red}0+1}-color{red}0-2; text{(base step)}\
P(color{red}1)=&sum_{i=0}^color{red}1 (color{red}1-i)2^i = (color{red}1-0)2^0+(color{red}1-1)2^1=1;\
vdots\
P(color{red}{n})=&sum_{i=0}^{color{red}{n}} (color{red}{n}-i)2^i=color{blue}{2^{n+1}-n-2}; text{(inductive hypothesis)}\
P(color{red}{n+1})=&sum_{i=0}^{color{red}{n+1}} (color{red}{n+1}-i)2^i =\
=&sum_{i=0}^n (n+1-i)2^i+require{cancel} cancel{(n+1-(color{red}{n+1}))2^{n+1}}=\
=&sum_{i=0}^n(n-i)2^i+sum_{i=0}^n2^i=\
=&color{blue}{2^{n+1}-n-2}+2^{n+1}-1=\
=&2^{n+2}-(n+1)-2.end{align}$$
add a comment |
up vote
0
down vote
accepted
up vote
0
down vote
accepted
Given $$P(color{red}n)=sum_{i=0}^color{red}n (color{red}n-i)2^i,$$ note:
$$begin{align}P(color{red}0)=&sum_{i=0}^color{red}0 (color{red}0-i)2^i = (color{red}0-0)2^0=0=2^{color{red}0+1}-color{red}0-2; text{(base step)}\
P(color{red}1)=&sum_{i=0}^color{red}1 (color{red}1-i)2^i = (color{red}1-0)2^0+(color{red}1-1)2^1=1;\
vdots\
P(color{red}{n})=&sum_{i=0}^{color{red}{n}} (color{red}{n}-i)2^i=color{blue}{2^{n+1}-n-2}; text{(inductive hypothesis)}\
P(color{red}{n+1})=&sum_{i=0}^{color{red}{n+1}} (color{red}{n+1}-i)2^i =\
=&sum_{i=0}^n (n+1-i)2^i+require{cancel} cancel{(n+1-(color{red}{n+1}))2^{n+1}}=\
=&sum_{i=0}^n(n-i)2^i+sum_{i=0}^n2^i=\
=&color{blue}{2^{n+1}-n-2}+2^{n+1}-1=\
=&2^{n+2}-(n+1)-2.end{align}$$
Given $$P(color{red}n)=sum_{i=0}^color{red}n (color{red}n-i)2^i,$$ note:
$$begin{align}P(color{red}0)=&sum_{i=0}^color{red}0 (color{red}0-i)2^i = (color{red}0-0)2^0=0=2^{color{red}0+1}-color{red}0-2; text{(base step)}\
P(color{red}1)=&sum_{i=0}^color{red}1 (color{red}1-i)2^i = (color{red}1-0)2^0+(color{red}1-1)2^1=1;\
vdots\
P(color{red}{n})=&sum_{i=0}^{color{red}{n}} (color{red}{n}-i)2^i=color{blue}{2^{n+1}-n-2}; text{(inductive hypothesis)}\
P(color{red}{n+1})=&sum_{i=0}^{color{red}{n+1}} (color{red}{n+1}-i)2^i =\
=&sum_{i=0}^n (n+1-i)2^i+require{cancel} cancel{(n+1-(color{red}{n+1}))2^{n+1}}=\
=&sum_{i=0}^n(n-i)2^i+sum_{i=0}^n2^i=\
=&color{blue}{2^{n+1}-n-2}+2^{n+1}-1=\
=&2^{n+2}-(n+1)-2.end{align}$$
answered Nov 23 at 12:14
farruhota
18k2736
18k2736
add a comment |
add a comment |
up vote
3
down vote
Your $P(n+1)$ is missing a $+1$ (as in, for "$n+1$") inside the sum parenthesis.
Hint:
begin{align}
sum_{i=0}^{n+1} (n+1-i)2^i &=sum_{i=0}^{n+1} (n-i)2^i +sum_{i=0}^{n+1}2^i \
&=(n-(n+1))2^{n+1} +color{blue}{sum_{i=0}^{n} (n-i)2^i} +sum_{i=0}^{n+1}2^i \
end{align}
Now you can use $color{blue}{P(n)}$. Also, you need $displaystyle sum_{i=0}^{n+1} 2^i = 2^{n+2} -1$.
(+1) What great use of colour!
– Shaun
Nov 23 at 4:59
Hmm, I'm not quite understanding why there are 3 terms in the equation for P(n+1). I thought that we're supposed to go up to P(n) then substitute (n+1) for n in the next term in the sequence?
– pythonprogrammer12
Nov 23 at 6:21
Look at your $color{blue}{P(n)}$: you have $color{blue}{displaystylesum_{i=0}^n (n-i)2^i}$ on the left-hand side. For $P(n+1)$, you would have $$sum_{i=0}^{n+1} ((n+1)-i)2^i =color{blue}{sum_{i=0}^n ((nbbox[yellow]{+1})-i)2^i} +((n+1)-(n+1))2^{n+1}$$ on the left-hand side, but you can't just use $color{blue}{P(n)}$ there, because of the $bbox[yellow]{+1}$. You have to take that $bbox[yellow]{+1}$ out of the sum for it to resemble that of $color{blue}{P(n)}$.
– Rócherz
Nov 23 at 8:06
add a comment |
up vote
3
down vote
Your $P(n+1)$ is missing a $+1$ (as in, for "$n+1$") inside the sum parenthesis.
Hint:
begin{align}
sum_{i=0}^{n+1} (n+1-i)2^i &=sum_{i=0}^{n+1} (n-i)2^i +sum_{i=0}^{n+1}2^i \
&=(n-(n+1))2^{n+1} +color{blue}{sum_{i=0}^{n} (n-i)2^i} +sum_{i=0}^{n+1}2^i \
end{align}
Now you can use $color{blue}{P(n)}$. Also, you need $displaystyle sum_{i=0}^{n+1} 2^i = 2^{n+2} -1$.
(+1) What great use of colour!
– Shaun
Nov 23 at 4:59
Hmm, I'm not quite understanding why there are 3 terms in the equation for P(n+1). I thought that we're supposed to go up to P(n) then substitute (n+1) for n in the next term in the sequence?
– pythonprogrammer12
Nov 23 at 6:21
Look at your $color{blue}{P(n)}$: you have $color{blue}{displaystylesum_{i=0}^n (n-i)2^i}$ on the left-hand side. For $P(n+1)$, you would have $$sum_{i=0}^{n+1} ((n+1)-i)2^i =color{blue}{sum_{i=0}^n ((nbbox[yellow]{+1})-i)2^i} +((n+1)-(n+1))2^{n+1}$$ on the left-hand side, but you can't just use $color{blue}{P(n)}$ there, because of the $bbox[yellow]{+1}$. You have to take that $bbox[yellow]{+1}$ out of the sum for it to resemble that of $color{blue}{P(n)}$.
– Rócherz
Nov 23 at 8:06
add a comment |
up vote
3
down vote
up vote
3
down vote
Your $P(n+1)$ is missing a $+1$ (as in, for "$n+1$") inside the sum parenthesis.
Hint:
begin{align}
sum_{i=0}^{n+1} (n+1-i)2^i &=sum_{i=0}^{n+1} (n-i)2^i +sum_{i=0}^{n+1}2^i \
&=(n-(n+1))2^{n+1} +color{blue}{sum_{i=0}^{n} (n-i)2^i} +sum_{i=0}^{n+1}2^i \
end{align}
Now you can use $color{blue}{P(n)}$. Also, you need $displaystyle sum_{i=0}^{n+1} 2^i = 2^{n+2} -1$.
Your $P(n+1)$ is missing a $+1$ (as in, for "$n+1$") inside the sum parenthesis.
Hint:
begin{align}
sum_{i=0}^{n+1} (n+1-i)2^i &=sum_{i=0}^{n+1} (n-i)2^i +sum_{i=0}^{n+1}2^i \
&=(n-(n+1))2^{n+1} +color{blue}{sum_{i=0}^{n} (n-i)2^i} +sum_{i=0}^{n+1}2^i \
end{align}
Now you can use $color{blue}{P(n)}$. Also, you need $displaystyle sum_{i=0}^{n+1} 2^i = 2^{n+2} -1$.
edited Nov 23 at 4:24
answered Nov 23 at 4:11
Rócherz
2,6612721
2,6612721
(+1) What great use of colour!
– Shaun
Nov 23 at 4:59
Hmm, I'm not quite understanding why there are 3 terms in the equation for P(n+1). I thought that we're supposed to go up to P(n) then substitute (n+1) for n in the next term in the sequence?
– pythonprogrammer12
Nov 23 at 6:21
Look at your $color{blue}{P(n)}$: you have $color{blue}{displaystylesum_{i=0}^n (n-i)2^i}$ on the left-hand side. For $P(n+1)$, you would have $$sum_{i=0}^{n+1} ((n+1)-i)2^i =color{blue}{sum_{i=0}^n ((nbbox[yellow]{+1})-i)2^i} +((n+1)-(n+1))2^{n+1}$$ on the left-hand side, but you can't just use $color{blue}{P(n)}$ there, because of the $bbox[yellow]{+1}$. You have to take that $bbox[yellow]{+1}$ out of the sum for it to resemble that of $color{blue}{P(n)}$.
– Rócherz
Nov 23 at 8:06
add a comment |
(+1) What great use of colour!
– Shaun
Nov 23 at 4:59
Hmm, I'm not quite understanding why there are 3 terms in the equation for P(n+1). I thought that we're supposed to go up to P(n) then substitute (n+1) for n in the next term in the sequence?
– pythonprogrammer12
Nov 23 at 6:21
Look at your $color{blue}{P(n)}$: you have $color{blue}{displaystylesum_{i=0}^n (n-i)2^i}$ on the left-hand side. For $P(n+1)$, you would have $$sum_{i=0}^{n+1} ((n+1)-i)2^i =color{blue}{sum_{i=0}^n ((nbbox[yellow]{+1})-i)2^i} +((n+1)-(n+1))2^{n+1}$$ on the left-hand side, but you can't just use $color{blue}{P(n)}$ there, because of the $bbox[yellow]{+1}$. You have to take that $bbox[yellow]{+1}$ out of the sum for it to resemble that of $color{blue}{P(n)}$.
– Rócherz
Nov 23 at 8:06
(+1) What great use of colour!
– Shaun
Nov 23 at 4:59
(+1) What great use of colour!
– Shaun
Nov 23 at 4:59
Hmm, I'm not quite understanding why there are 3 terms in the equation for P(n+1). I thought that we're supposed to go up to P(n) then substitute (n+1) for n in the next term in the sequence?
– pythonprogrammer12
Nov 23 at 6:21
Hmm, I'm not quite understanding why there are 3 terms in the equation for P(n+1). I thought that we're supposed to go up to P(n) then substitute (n+1) for n in the next term in the sequence?
– pythonprogrammer12
Nov 23 at 6:21
Look at your $color{blue}{P(n)}$: you have $color{blue}{displaystylesum_{i=0}^n (n-i)2^i}$ on the left-hand side. For $P(n+1)$, you would have $$sum_{i=0}^{n+1} ((n+1)-i)2^i =color{blue}{sum_{i=0}^n ((nbbox[yellow]{+1})-i)2^i} +((n+1)-(n+1))2^{n+1}$$ on the left-hand side, but you can't just use $color{blue}{P(n)}$ there, because of the $bbox[yellow]{+1}$. You have to take that $bbox[yellow]{+1}$ out of the sum for it to resemble that of $color{blue}{P(n)}$.
– Rócherz
Nov 23 at 8:06
Look at your $color{blue}{P(n)}$: you have $color{blue}{displaystylesum_{i=0}^n (n-i)2^i}$ on the left-hand side. For $P(n+1)$, you would have $$sum_{i=0}^{n+1} ((n+1)-i)2^i =color{blue}{sum_{i=0}^n ((nbbox[yellow]{+1})-i)2^i} +((n+1)-(n+1))2^{n+1}$$ on the left-hand side, but you can't just use $color{blue}{P(n)}$ there, because of the $bbox[yellow]{+1}$. You have to take that $bbox[yellow]{+1}$ out of the sum for it to resemble that of $color{blue}{P(n)}$.
– Rócherz
Nov 23 at 8:06
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.
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.
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%2f3009960%2fprove-by-mathematical-induction-that-sum-i-0n-n-i2i-2n1-n-2%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