Prove $2times1!+5times2!+10times3!+…+(n^2+1)n!=n(n+1)!$ for all positive integers












0












$begingroup$


I am trying to prove by mathematical induction $2times1!+5times2!+10times3!+...+(n^2+1)n!=n(n+1)!$ for all positive integers $n$.



So far I have:




  • Solved in the first case possible - $1$


  • Assumed the function to be true for all positive integers


  • Subbed in $k+1$ for $n$ leaving me with the following
    $$((k+1)^2+1)(k+1)!=(k+1)(k+2)!$$


I am unsure where to go from here? Any help would be greatly appreciated!










share|cite|improve this question











$endgroup$












  • $begingroup$
    Trying to show that the equality is true
    $endgroup$
    – Holly Millican
    Dec 12 '18 at 23:26










  • $begingroup$
    Wait, the equality is false.
    $endgroup$
    – Mindlack
    Dec 12 '18 at 23:27






  • 1




    $begingroup$
    Shouldn't it be $(2 times 1!) + dots + ((k+1)^2 + 1)(k+1)!$?
    $endgroup$
    – platty
    Dec 12 '18 at 23:27










  • $begingroup$
    yes sorry that is my typo, will fix
    $endgroup$
    – Holly Millican
    Dec 12 '18 at 23:27
















0












$begingroup$


I am trying to prove by mathematical induction $2times1!+5times2!+10times3!+...+(n^2+1)n!=n(n+1)!$ for all positive integers $n$.



So far I have:




  • Solved in the first case possible - $1$


  • Assumed the function to be true for all positive integers


  • Subbed in $k+1$ for $n$ leaving me with the following
    $$((k+1)^2+1)(k+1)!=(k+1)(k+2)!$$


I am unsure where to go from here? Any help would be greatly appreciated!










share|cite|improve this question











$endgroup$












  • $begingroup$
    Trying to show that the equality is true
    $endgroup$
    – Holly Millican
    Dec 12 '18 at 23:26










  • $begingroup$
    Wait, the equality is false.
    $endgroup$
    – Mindlack
    Dec 12 '18 at 23:27






  • 1




    $begingroup$
    Shouldn't it be $(2 times 1!) + dots + ((k+1)^2 + 1)(k+1)!$?
    $endgroup$
    – platty
    Dec 12 '18 at 23:27










  • $begingroup$
    yes sorry that is my typo, will fix
    $endgroup$
    – Holly Millican
    Dec 12 '18 at 23:27














0












0








0


1



$begingroup$


I am trying to prove by mathematical induction $2times1!+5times2!+10times3!+...+(n^2+1)n!=n(n+1)!$ for all positive integers $n$.



So far I have:




  • Solved in the first case possible - $1$


  • Assumed the function to be true for all positive integers


  • Subbed in $k+1$ for $n$ leaving me with the following
    $$((k+1)^2+1)(k+1)!=(k+1)(k+2)!$$


I am unsure where to go from here? Any help would be greatly appreciated!










share|cite|improve this question











$endgroup$




I am trying to prove by mathematical induction $2times1!+5times2!+10times3!+...+(n^2+1)n!=n(n+1)!$ for all positive integers $n$.



So far I have:




  • Solved in the first case possible - $1$


  • Assumed the function to be true for all positive integers


  • Subbed in $k+1$ for $n$ leaving me with the following
    $$((k+1)^2+1)(k+1)!=(k+1)(k+2)!$$


I am unsure where to go from here? Any help would be greatly appreciated!







induction factorial






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 12 '18 at 23:28







Holly Millican

















asked Dec 12 '18 at 23:25









Holly MillicanHolly Millican

528




528












  • $begingroup$
    Trying to show that the equality is true
    $endgroup$
    – Holly Millican
    Dec 12 '18 at 23:26










  • $begingroup$
    Wait, the equality is false.
    $endgroup$
    – Mindlack
    Dec 12 '18 at 23:27






  • 1




    $begingroup$
    Shouldn't it be $(2 times 1!) + dots + ((k+1)^2 + 1)(k+1)!$?
    $endgroup$
    – platty
    Dec 12 '18 at 23:27










  • $begingroup$
    yes sorry that is my typo, will fix
    $endgroup$
    – Holly Millican
    Dec 12 '18 at 23:27


















  • $begingroup$
    Trying to show that the equality is true
    $endgroup$
    – Holly Millican
    Dec 12 '18 at 23:26










  • $begingroup$
    Wait, the equality is false.
    $endgroup$
    – Mindlack
    Dec 12 '18 at 23:27






  • 1




    $begingroup$
    Shouldn't it be $(2 times 1!) + dots + ((k+1)^2 + 1)(k+1)!$?
    $endgroup$
    – platty
    Dec 12 '18 at 23:27










  • $begingroup$
    yes sorry that is my typo, will fix
    $endgroup$
    – Holly Millican
    Dec 12 '18 at 23:27
















$begingroup$
Trying to show that the equality is true
$endgroup$
– Holly Millican
Dec 12 '18 at 23:26




$begingroup$
Trying to show that the equality is true
$endgroup$
– Holly Millican
Dec 12 '18 at 23:26












$begingroup$
Wait, the equality is false.
$endgroup$
– Mindlack
Dec 12 '18 at 23:27




$begingroup$
Wait, the equality is false.
$endgroup$
– Mindlack
Dec 12 '18 at 23:27




1




1




$begingroup$
Shouldn't it be $(2 times 1!) + dots + ((k+1)^2 + 1)(k+1)!$?
$endgroup$
– platty
Dec 12 '18 at 23:27




$begingroup$
Shouldn't it be $(2 times 1!) + dots + ((k+1)^2 + 1)(k+1)!$?
$endgroup$
– platty
Dec 12 '18 at 23:27












$begingroup$
yes sorry that is my typo, will fix
$endgroup$
– Holly Millican
Dec 12 '18 at 23:27




$begingroup$
yes sorry that is my typo, will fix
$endgroup$
– Holly Millican
Dec 12 '18 at 23:27










3 Answers
3






active

oldest

votes


















0












$begingroup$

you have your base case:



Assume:



$2times1!+5times2!+10times3!+...+(n^2+1)n!=n(n+1)!$



We must show that



$2times1!+cdots+(n^2+1)n! + ((n+1)^2 + 1)(n+1)!=(n+1)(n+2)!$



$n(n+1)! + ((n+1)^2 + 1)(n+1)!$



By the inductive hypothesis.



$((n+1)^2+ n + 1)(n+1)!\
(n^2 + 3n + 2)(n+1)!\
(n+1)(n+2)(n+1)!\
(n+1)(n+2)!$






share|cite|improve this answer









$endgroup$





















    0












    $begingroup$

    The Induction Hypothesis should give you $2 times 1! + dots + (k^2+1)k! = k(k+1)!$. In the Induction Step, you should start from one side of the equality and try to reach the other side. Here, it makes most sense to work with the summation side, as this will allow us to easily apply the Induction Hypothesis. Applying the Induction Hypothesis, we get:
    $$
    begin{align*}
    2 times 1! + dots + (k^2+1)k! + ((k+1)^2 + 1)(k+1)! &= k(k+1)! + ((k+1)^2 + 1)(k+1)! \
    &= ((k+1)^2 + k + 1) cdot (k+1)! \
    &= (k+1 + 1)(k+1) cdot (k+1)! \
    &= (k+1)(k+2)!
    end{align*}
    $$






    share|cite|improve this answer









    $endgroup$





















      0












      $begingroup$

      The key point is form the induction hypotesis



      $$2times1!+5times2!+10times3!+…+(k^2+1)k!=k(k+1)!$$



      is that



      $$2times1!+ldots+((k+1)^2+1)(k+1)!stackrel{Ind. Hyp.}=k(k+1)!+((k+1)^2+1)(k+1)!stackrel{?}=(k+1)(k+2)!$$



      and the latter is true indeed



      $$k(k+1)!+((k+1)^2+1)(k+1)!=(k+1)!(k^2+3k+2)=(k+1)!(k+1)(k+2)=(k+1)(k+2)!$$






      share|cite|improve this answer









      $endgroup$













        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%2f3037375%2fprove-2-times15-times210-times3-n21n-nn1-for-all-positive-in%23new-answer', 'question_page');
        }
        );

        Post as a guest















        Required, but never shown

























        3 Answers
        3






        active

        oldest

        votes








        3 Answers
        3






        active

        oldest

        votes









        active

        oldest

        votes






        active

        oldest

        votes









        0












        $begingroup$

        you have your base case:



        Assume:



        $2times1!+5times2!+10times3!+...+(n^2+1)n!=n(n+1)!$



        We must show that



        $2times1!+cdots+(n^2+1)n! + ((n+1)^2 + 1)(n+1)!=(n+1)(n+2)!$



        $n(n+1)! + ((n+1)^2 + 1)(n+1)!$



        By the inductive hypothesis.



        $((n+1)^2+ n + 1)(n+1)!\
        (n^2 + 3n + 2)(n+1)!\
        (n+1)(n+2)(n+1)!\
        (n+1)(n+2)!$






        share|cite|improve this answer









        $endgroup$


















          0












          $begingroup$

          you have your base case:



          Assume:



          $2times1!+5times2!+10times3!+...+(n^2+1)n!=n(n+1)!$



          We must show that



          $2times1!+cdots+(n^2+1)n! + ((n+1)^2 + 1)(n+1)!=(n+1)(n+2)!$



          $n(n+1)! + ((n+1)^2 + 1)(n+1)!$



          By the inductive hypothesis.



          $((n+1)^2+ n + 1)(n+1)!\
          (n^2 + 3n + 2)(n+1)!\
          (n+1)(n+2)(n+1)!\
          (n+1)(n+2)!$






          share|cite|improve this answer









          $endgroup$
















            0












            0








            0





            $begingroup$

            you have your base case:



            Assume:



            $2times1!+5times2!+10times3!+...+(n^2+1)n!=n(n+1)!$



            We must show that



            $2times1!+cdots+(n^2+1)n! + ((n+1)^2 + 1)(n+1)!=(n+1)(n+2)!$



            $n(n+1)! + ((n+1)^2 + 1)(n+1)!$



            By the inductive hypothesis.



            $((n+1)^2+ n + 1)(n+1)!\
            (n^2 + 3n + 2)(n+1)!\
            (n+1)(n+2)(n+1)!\
            (n+1)(n+2)!$






            share|cite|improve this answer









            $endgroup$



            you have your base case:



            Assume:



            $2times1!+5times2!+10times3!+...+(n^2+1)n!=n(n+1)!$



            We must show that



            $2times1!+cdots+(n^2+1)n! + ((n+1)^2 + 1)(n+1)!=(n+1)(n+2)!$



            $n(n+1)! + ((n+1)^2 + 1)(n+1)!$



            By the inductive hypothesis.



            $((n+1)^2+ n + 1)(n+1)!\
            (n^2 + 3n + 2)(n+1)!\
            (n+1)(n+2)(n+1)!\
            (n+1)(n+2)!$







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered Dec 12 '18 at 23:31









            Doug MDoug M

            45.2k31954




            45.2k31954























                0












                $begingroup$

                The Induction Hypothesis should give you $2 times 1! + dots + (k^2+1)k! = k(k+1)!$. In the Induction Step, you should start from one side of the equality and try to reach the other side. Here, it makes most sense to work with the summation side, as this will allow us to easily apply the Induction Hypothesis. Applying the Induction Hypothesis, we get:
                $$
                begin{align*}
                2 times 1! + dots + (k^2+1)k! + ((k+1)^2 + 1)(k+1)! &= k(k+1)! + ((k+1)^2 + 1)(k+1)! \
                &= ((k+1)^2 + k + 1) cdot (k+1)! \
                &= (k+1 + 1)(k+1) cdot (k+1)! \
                &= (k+1)(k+2)!
                end{align*}
                $$






                share|cite|improve this answer









                $endgroup$


















                  0












                  $begingroup$

                  The Induction Hypothesis should give you $2 times 1! + dots + (k^2+1)k! = k(k+1)!$. In the Induction Step, you should start from one side of the equality and try to reach the other side. Here, it makes most sense to work with the summation side, as this will allow us to easily apply the Induction Hypothesis. Applying the Induction Hypothesis, we get:
                  $$
                  begin{align*}
                  2 times 1! + dots + (k^2+1)k! + ((k+1)^2 + 1)(k+1)! &= k(k+1)! + ((k+1)^2 + 1)(k+1)! \
                  &= ((k+1)^2 + k + 1) cdot (k+1)! \
                  &= (k+1 + 1)(k+1) cdot (k+1)! \
                  &= (k+1)(k+2)!
                  end{align*}
                  $$






                  share|cite|improve this answer









                  $endgroup$
















                    0












                    0








                    0





                    $begingroup$

                    The Induction Hypothesis should give you $2 times 1! + dots + (k^2+1)k! = k(k+1)!$. In the Induction Step, you should start from one side of the equality and try to reach the other side. Here, it makes most sense to work with the summation side, as this will allow us to easily apply the Induction Hypothesis. Applying the Induction Hypothesis, we get:
                    $$
                    begin{align*}
                    2 times 1! + dots + (k^2+1)k! + ((k+1)^2 + 1)(k+1)! &= k(k+1)! + ((k+1)^2 + 1)(k+1)! \
                    &= ((k+1)^2 + k + 1) cdot (k+1)! \
                    &= (k+1 + 1)(k+1) cdot (k+1)! \
                    &= (k+1)(k+2)!
                    end{align*}
                    $$






                    share|cite|improve this answer









                    $endgroup$



                    The Induction Hypothesis should give you $2 times 1! + dots + (k^2+1)k! = k(k+1)!$. In the Induction Step, you should start from one side of the equality and try to reach the other side. Here, it makes most sense to work with the summation side, as this will allow us to easily apply the Induction Hypothesis. Applying the Induction Hypothesis, we get:
                    $$
                    begin{align*}
                    2 times 1! + dots + (k^2+1)k! + ((k+1)^2 + 1)(k+1)! &= k(k+1)! + ((k+1)^2 + 1)(k+1)! \
                    &= ((k+1)^2 + k + 1) cdot (k+1)! \
                    &= (k+1 + 1)(k+1) cdot (k+1)! \
                    &= (k+1)(k+2)!
                    end{align*}
                    $$







                    share|cite|improve this answer












                    share|cite|improve this answer



                    share|cite|improve this answer










                    answered Dec 12 '18 at 23:32









                    plattyplatty

                    3,370320




                    3,370320























                        0












                        $begingroup$

                        The key point is form the induction hypotesis



                        $$2times1!+5times2!+10times3!+…+(k^2+1)k!=k(k+1)!$$



                        is that



                        $$2times1!+ldots+((k+1)^2+1)(k+1)!stackrel{Ind. Hyp.}=k(k+1)!+((k+1)^2+1)(k+1)!stackrel{?}=(k+1)(k+2)!$$



                        and the latter is true indeed



                        $$k(k+1)!+((k+1)^2+1)(k+1)!=(k+1)!(k^2+3k+2)=(k+1)!(k+1)(k+2)=(k+1)(k+2)!$$






                        share|cite|improve this answer









                        $endgroup$


















                          0












                          $begingroup$

                          The key point is form the induction hypotesis



                          $$2times1!+5times2!+10times3!+…+(k^2+1)k!=k(k+1)!$$



                          is that



                          $$2times1!+ldots+((k+1)^2+1)(k+1)!stackrel{Ind. Hyp.}=k(k+1)!+((k+1)^2+1)(k+1)!stackrel{?}=(k+1)(k+2)!$$



                          and the latter is true indeed



                          $$k(k+1)!+((k+1)^2+1)(k+1)!=(k+1)!(k^2+3k+2)=(k+1)!(k+1)(k+2)=(k+1)(k+2)!$$






                          share|cite|improve this answer









                          $endgroup$
















                            0












                            0








                            0





                            $begingroup$

                            The key point is form the induction hypotesis



                            $$2times1!+5times2!+10times3!+…+(k^2+1)k!=k(k+1)!$$



                            is that



                            $$2times1!+ldots+((k+1)^2+1)(k+1)!stackrel{Ind. Hyp.}=k(k+1)!+((k+1)^2+1)(k+1)!stackrel{?}=(k+1)(k+2)!$$



                            and the latter is true indeed



                            $$k(k+1)!+((k+1)^2+1)(k+1)!=(k+1)!(k^2+3k+2)=(k+1)!(k+1)(k+2)=(k+1)(k+2)!$$






                            share|cite|improve this answer









                            $endgroup$



                            The key point is form the induction hypotesis



                            $$2times1!+5times2!+10times3!+…+(k^2+1)k!=k(k+1)!$$



                            is that



                            $$2times1!+ldots+((k+1)^2+1)(k+1)!stackrel{Ind. Hyp.}=k(k+1)!+((k+1)^2+1)(k+1)!stackrel{?}=(k+1)(k+2)!$$



                            and the latter is true indeed



                            $$k(k+1)!+((k+1)^2+1)(k+1)!=(k+1)!(k^2+3k+2)=(k+1)!(k+1)(k+2)=(k+1)(k+2)!$$







                            share|cite|improve this answer












                            share|cite|improve this answer



                            share|cite|improve this answer










                            answered Dec 12 '18 at 23:52









                            gimusigimusi

                            92.9k84494




                            92.9k84494






























                                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.




                                draft saved


                                draft discarded














                                StackExchange.ready(
                                function () {
                                StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3037375%2fprove-2-times15-times210-times3-n21n-nn1-for-all-positive-in%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

                                Bundesstraße 106

                                Le Mesnil-Réaume

                                Ida-Boy-Ed-Garten