Prove by mathematical induction that $sum_{i=0}^n (n-i)2^i = 2^{n+1}-n-2$











up vote
0
down vote

favorite
1












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?










share|cite|improve this question




























    up vote
    0
    down vote

    favorite
    1












    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?










    share|cite|improve this question


























      up vote
      0
      down vote

      favorite
      1









      up vote
      0
      down vote

      favorite
      1






      1





      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?










      share|cite|improve this question















      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






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Nov 23 at 4:14









      Tianlalu

      2,8811935




      2,8811935










      asked Nov 23 at 4:03









      pythonprogrammer12

      31




      31






















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






          share|cite|improve this answer




























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






            share|cite|improve this answer























            • (+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













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

























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






            share|cite|improve this answer

























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






              share|cite|improve this answer























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






                share|cite|improve this answer












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







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Nov 23 at 12:14









                farruhota

                18k2736




                18k2736






















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






                    share|cite|improve this answer























                    • (+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

















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






                    share|cite|improve this answer























                    • (+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















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






                    share|cite|improve this answer














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







                    share|cite|improve this answer














                    share|cite|improve this answer



                    share|cite|improve this answer








                    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




















                    • (+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




















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





















































                    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

                    Wiesbaden

                    Marschland

                    Dieringhausen