Induction proof for stirling of first kind.












2












$begingroup$


I have to show that for every stirling number of the first kind $forall n geq 2 : s_{n,n-2} = frac{1}{24}n(n-1)(n-2)(3n-1) $ is true.



I've started like this:



Base case: Let $n$ be $n=2$, then per defintion
$s_{n,0} = 0$.
Since we have $s_{2,2-2} = s_{2,0} = 0$ and $frac{1}{24}2(2-1)(2-2)(3*2-1) = frac{1}{24}2(2-1)(0)(3*2-1) = 0$ the base case is true.



Now we assume $forall n in mathbb{N} $ with $ n geq 2$
that $s_{n,n-2} = frac{1}{24}n(n-1)(n-2)(3n-1) $ is true.



We also now, that there exists a recursive formula for the stirling numbers of the first kind which will help us for the induction.



It says that $s_{n,k} = s_{n-1,k-1}+(n-1)s_{n-1,k} $.



Now let $n rightarrow n+1$.



$s_{n+1,n-1} = s_{n,n-2}+n*s_{n,n-1} $.



If we insert our assumption, that leaves us with



$s_{n+1,n-1} = frac{1}{24}n(n-1)(n-2)(3n-1)+n*s_{n,n-1} $.



If we insert $n=n+1$ into $frac{1}{24}n(n-1)(n-2)(3n-1)$ we get
$frac{1}{24}n+1(n)(n-1)(3n)$, so that's what we would like after the induction.



The big problem now is that I can'T get rid of $s_{n,n-1}$. I've seen a similar question for the stirling numbers of second kind which simply say that $S_{n,n-1} = $$n choose 2$ but I don't know if this is true for the first kind and neither did I understand how we come to that conclusion. Can anyone help me?






induction







share|cite|improve this question









$endgroup$

















    2












    $begingroup$


    I have to show that for every stirling number of the first kind $forall n geq 2 : s_{n,n-2} = frac{1}{24}n(n-1)(n-2)(3n-1) $ is true.



    I've started like this:



    Base case: Let $n$ be $n=2$, then per defintion
    $s_{n,0} = 0$.
    Since we have $s_{2,2-2} = s_{2,0} = 0$ and $frac{1}{24}2(2-1)(2-2)(3*2-1) = frac{1}{24}2(2-1)(0)(3*2-1) = 0$ the base case is true.



    Now we assume $forall n in mathbb{N} $ with $ n geq 2$
    that $s_{n,n-2} = frac{1}{24}n(n-1)(n-2)(3n-1) $ is true.



    We also now, that there exists a recursive formula for the stirling numbers of the first kind which will help us for the induction.



    It says that $s_{n,k} = s_{n-1,k-1}+(n-1)s_{n-1,k} $.



    Now let $n rightarrow n+1$.



    $s_{n+1,n-1} = s_{n,n-2}+n*s_{n,n-1} $.



    If we insert our assumption, that leaves us with



    $s_{n+1,n-1} = frac{1}{24}n(n-1)(n-2)(3n-1)+n*s_{n,n-1} $.



    If we insert $n=n+1$ into $frac{1}{24}n(n-1)(n-2)(3n-1)$ we get
    $frac{1}{24}n+1(n)(n-1)(3n)$, so that's what we would like after the induction.



    The big problem now is that I can'T get rid of $s_{n,n-1}$. I've seen a similar question for the stirling numbers of second kind which simply say that $S_{n,n-1} = $$n choose 2$ but I don't know if this is true for the first kind and neither did I understand how we come to that conclusion. Can anyone help me?






    induction







    share|cite|improve this question









    $endgroup$















      2












      2








      2


      0



      $begingroup$


      I have to show that for every stirling number of the first kind $forall n geq 2 : s_{n,n-2} = frac{1}{24}n(n-1)(n-2)(3n-1) $ is true.



      I've started like this:



      Base case: Let $n$ be $n=2$, then per defintion
      $s_{n,0} = 0$.
      Since we have $s_{2,2-2} = s_{2,0} = 0$ and $frac{1}{24}2(2-1)(2-2)(3*2-1) = frac{1}{24}2(2-1)(0)(3*2-1) = 0$ the base case is true.



      Now we assume $forall n in mathbb{N} $ with $ n geq 2$
      that $s_{n,n-2} = frac{1}{24}n(n-1)(n-2)(3n-1) $ is true.



      We also now, that there exists a recursive formula for the stirling numbers of the first kind which will help us for the induction.



      It says that $s_{n,k} = s_{n-1,k-1}+(n-1)s_{n-1,k} $.



      Now let $n rightarrow n+1$.



      $s_{n+1,n-1} = s_{n,n-2}+n*s_{n,n-1} $.



      If we insert our assumption, that leaves us with



      $s_{n+1,n-1} = frac{1}{24}n(n-1)(n-2)(3n-1)+n*s_{n,n-1} $.



      If we insert $n=n+1$ into $frac{1}{24}n(n-1)(n-2)(3n-1)$ we get
      $frac{1}{24}n+1(n)(n-1)(3n)$, so that's what we would like after the induction.



      The big problem now is that I can'T get rid of $s_{n,n-1}$. I've seen a similar question for the stirling numbers of second kind which simply say that $S_{n,n-1} = $$n choose 2$ but I don't know if this is true for the first kind and neither did I understand how we come to that conclusion. Can anyone help me?






      induction







      share|cite|improve this question









      $endgroup$




      I have to show that for every stirling number of the first kind $forall n geq 2 : s_{n,n-2} = frac{1}{24}n(n-1)(n-2)(3n-1) $ is true.



      I've started like this:



      Base case: Let $n$ be $n=2$, then per defintion
      $s_{n,0} = 0$.
      Since we have $s_{2,2-2} = s_{2,0} = 0$ and $frac{1}{24}2(2-1)(2-2)(3*2-1) = frac{1}{24}2(2-1)(0)(3*2-1) = 0$ the base case is true.



      Now we assume $forall n in mathbb{N} $ with $ n geq 2$
      that $s_{n,n-2} = frac{1}{24}n(n-1)(n-2)(3n-1) $ is true.



      We also now, that there exists a recursive formula for the stirling numbers of the first kind which will help us for the induction.



      It says that $s_{n,k} = s_{n-1,k-1}+(n-1)s_{n-1,k} $.



      Now let $n rightarrow n+1$.



      $s_{n+1,n-1} = s_{n,n-2}+n*s_{n,n-1} $.



      If we insert our assumption, that leaves us with



      $s_{n+1,n-1} = frac{1}{24}n(n-1)(n-2)(3n-1)+n*s_{n,n-1} $.



      If we insert $n=n+1$ into $frac{1}{24}n(n-1)(n-2)(3n-1)$ we get
      $frac{1}{24}n+1(n)(n-1)(3n)$, so that's what we would like after the induction.



      The big problem now is that I can'T get rid of $s_{n,n-1}$. I've seen a similar question for the stirling numbers of second kind which simply say that $S_{n,n-1} = $$n choose 2$ but I don't know if this is true for the first kind and neither did I understand how we come to that conclusion. Can anyone help me?






      induction




      induction






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Jan 17 at 13:50









      D idsea JD idsea J

      325




      325






















          2 Answers
          2






          active

          oldest

          votes


















          3












          $begingroup$

          $s_{n+1,n-1} = frac{1}{24}n(n-1)(n-2)(3n-1)+n*s_{n,n-1} tag1$.



          $s_{n,n-1} = frac{n(n-1)}{2} tag 2$.



          Substitute this in the prior equation we get



          $s_{n+1,n-1} = frac{1}{24}n(n-1)(n-2)(3n-1)+frac{n^2(n-1)}{2} $.



          which simplifies to



          $s_{n+1,n-1} = frac{1}{24}(n+1)n(n-1)(3n+2)tag 3 $.



          Thus proved by induction. You will have to use the identity(2) to get the final proof. I don't think there is any way out.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Could you clarify what you mean by identity(2)?
            $endgroup$
            – D idsea J
            Jan 17 at 15:24






          • 1




            $begingroup$
            $s_{n,n-1} = frac{n(n-1)}{2} tag 2$.. This is what I mean.
            $endgroup$
            – Satish Ramanathan
            Jan 17 at 15:26










          • $begingroup$
            Alright, even though I thought the final form after induction should be $frac{1}{24}(n+1)(n)(n-1)(3n)$ cause that's what we get if we put n=n+1 into the formula that we need to proof.
            $endgroup$
            – D idsea J
            Jan 17 at 15:32












          • $begingroup$
            It might be a stupid question. However, when doing induction last time it was always the case that you could just put n+1 into the formula you have to proof to see what the end should look like. I don't see why this is a proof if it's not the same in the end to be honest.
            $endgroup$
            – D idsea J
            Jan 17 at 15:43










          • $begingroup$
            Wolfram states, that the special case for stirling first kind s(n,n-1) is -(n choose 2). So who's right now o_O
            $endgroup$
            – D idsea J
            Jan 18 at 8:05



















          3












          $begingroup$

          Induction step:



          $begin{aligned}sleft(n+1,n-1right) & =nsleft(n,n-1right)+sleft(n,n-2right)\
          & =frac{1}{2}n^{2}left(n-1right)+frac{1}{24}nleft(n-1right)left(n-2right)left(3n-1right)\
          & =frac{1}{24}nleft(n-1right)left[12n+left(n-2right)left(3n-1right)right]\
          & =frac{1}{24}nleft(n-1right)left(n+1right)left(3n+2right)\
          & =frac{1}{24}left(n+1right)nleft(n-1right)left(3n+2right)
          end{aligned}
          $



          In the second equality we use the equality $s(n,n-1)=frac12n(n-1)$ and also the induction hypothesis.






          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%2f3076995%2finduction-proof-for-stirling-of-first-kind%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









            3












            $begingroup$

            $s_{n+1,n-1} = frac{1}{24}n(n-1)(n-2)(3n-1)+n*s_{n,n-1} tag1$.



            $s_{n,n-1} = frac{n(n-1)}{2} tag 2$.



            Substitute this in the prior equation we get



            $s_{n+1,n-1} = frac{1}{24}n(n-1)(n-2)(3n-1)+frac{n^2(n-1)}{2} $.



            which simplifies to



            $s_{n+1,n-1} = frac{1}{24}(n+1)n(n-1)(3n+2)tag 3 $.



            Thus proved by induction. You will have to use the identity(2) to get the final proof. I don't think there is any way out.






            share|cite|improve this answer









            $endgroup$













            • $begingroup$
              Could you clarify what you mean by identity(2)?
              $endgroup$
              – D idsea J
              Jan 17 at 15:24






            • 1




              $begingroup$
              $s_{n,n-1} = frac{n(n-1)}{2} tag 2$.. This is what I mean.
              $endgroup$
              – Satish Ramanathan
              Jan 17 at 15:26










            • $begingroup$
              Alright, even though I thought the final form after induction should be $frac{1}{24}(n+1)(n)(n-1)(3n)$ cause that's what we get if we put n=n+1 into the formula that we need to proof.
              $endgroup$
              – D idsea J
              Jan 17 at 15:32












            • $begingroup$
              It might be a stupid question. However, when doing induction last time it was always the case that you could just put n+1 into the formula you have to proof to see what the end should look like. I don't see why this is a proof if it's not the same in the end to be honest.
              $endgroup$
              – D idsea J
              Jan 17 at 15:43










            • $begingroup$
              Wolfram states, that the special case for stirling first kind s(n,n-1) is -(n choose 2). So who's right now o_O
              $endgroup$
              – D idsea J
              Jan 18 at 8:05
















            3












            $begingroup$

            $s_{n+1,n-1} = frac{1}{24}n(n-1)(n-2)(3n-1)+n*s_{n,n-1} tag1$.



            $s_{n,n-1} = frac{n(n-1)}{2} tag 2$.



            Substitute this in the prior equation we get



            $s_{n+1,n-1} = frac{1}{24}n(n-1)(n-2)(3n-1)+frac{n^2(n-1)}{2} $.



            which simplifies to



            $s_{n+1,n-1} = frac{1}{24}(n+1)n(n-1)(3n+2)tag 3 $.



            Thus proved by induction. You will have to use the identity(2) to get the final proof. I don't think there is any way out.






            share|cite|improve this answer









            $endgroup$













            • $begingroup$
              Could you clarify what you mean by identity(2)?
              $endgroup$
              – D idsea J
              Jan 17 at 15:24






            • 1




              $begingroup$
              $s_{n,n-1} = frac{n(n-1)}{2} tag 2$.. This is what I mean.
              $endgroup$
              – Satish Ramanathan
              Jan 17 at 15:26










            • $begingroup$
              Alright, even though I thought the final form after induction should be $frac{1}{24}(n+1)(n)(n-1)(3n)$ cause that's what we get if we put n=n+1 into the formula that we need to proof.
              $endgroup$
              – D idsea J
              Jan 17 at 15:32












            • $begingroup$
              It might be a stupid question. However, when doing induction last time it was always the case that you could just put n+1 into the formula you have to proof to see what the end should look like. I don't see why this is a proof if it's not the same in the end to be honest.
              $endgroup$
              – D idsea J
              Jan 17 at 15:43










            • $begingroup$
              Wolfram states, that the special case for stirling first kind s(n,n-1) is -(n choose 2). So who's right now o_O
              $endgroup$
              – D idsea J
              Jan 18 at 8:05














            3












            3








            3





            $begingroup$

            $s_{n+1,n-1} = frac{1}{24}n(n-1)(n-2)(3n-1)+n*s_{n,n-1} tag1$.



            $s_{n,n-1} = frac{n(n-1)}{2} tag 2$.



            Substitute this in the prior equation we get



            $s_{n+1,n-1} = frac{1}{24}n(n-1)(n-2)(3n-1)+frac{n^2(n-1)}{2} $.



            which simplifies to



            $s_{n+1,n-1} = frac{1}{24}(n+1)n(n-1)(3n+2)tag 3 $.



            Thus proved by induction. You will have to use the identity(2) to get the final proof. I don't think there is any way out.






            share|cite|improve this answer









            $endgroup$



            $s_{n+1,n-1} = frac{1}{24}n(n-1)(n-2)(3n-1)+n*s_{n,n-1} tag1$.



            $s_{n,n-1} = frac{n(n-1)}{2} tag 2$.



            Substitute this in the prior equation we get



            $s_{n+1,n-1} = frac{1}{24}n(n-1)(n-2)(3n-1)+frac{n^2(n-1)}{2} $.



            which simplifies to



            $s_{n+1,n-1} = frac{1}{24}(n+1)n(n-1)(3n+2)tag 3 $.



            Thus proved by induction. You will have to use the identity(2) to get the final proof. I don't think there is any way out.







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered Jan 17 at 14:57









            Satish RamanathanSatish Ramanathan

            9,71031323




            9,71031323












            • $begingroup$
              Could you clarify what you mean by identity(2)?
              $endgroup$
              – D idsea J
              Jan 17 at 15:24






            • 1




              $begingroup$
              $s_{n,n-1} = frac{n(n-1)}{2} tag 2$.. This is what I mean.
              $endgroup$
              – Satish Ramanathan
              Jan 17 at 15:26










            • $begingroup$
              Alright, even though I thought the final form after induction should be $frac{1}{24}(n+1)(n)(n-1)(3n)$ cause that's what we get if we put n=n+1 into the formula that we need to proof.
              $endgroup$
              – D idsea J
              Jan 17 at 15:32












            • $begingroup$
              It might be a stupid question. However, when doing induction last time it was always the case that you could just put n+1 into the formula you have to proof to see what the end should look like. I don't see why this is a proof if it's not the same in the end to be honest.
              $endgroup$
              – D idsea J
              Jan 17 at 15:43










            • $begingroup$
              Wolfram states, that the special case for stirling first kind s(n,n-1) is -(n choose 2). So who's right now o_O
              $endgroup$
              – D idsea J
              Jan 18 at 8:05


















            • $begingroup$
              Could you clarify what you mean by identity(2)?
              $endgroup$
              – D idsea J
              Jan 17 at 15:24






            • 1




              $begingroup$
              $s_{n,n-1} = frac{n(n-1)}{2} tag 2$.. This is what I mean.
              $endgroup$
              – Satish Ramanathan
              Jan 17 at 15:26










            • $begingroup$
              Alright, even though I thought the final form after induction should be $frac{1}{24}(n+1)(n)(n-1)(3n)$ cause that's what we get if we put n=n+1 into the formula that we need to proof.
              $endgroup$
              – D idsea J
              Jan 17 at 15:32












            • $begingroup$
              It might be a stupid question. However, when doing induction last time it was always the case that you could just put n+1 into the formula you have to proof to see what the end should look like. I don't see why this is a proof if it's not the same in the end to be honest.
              $endgroup$
              – D idsea J
              Jan 17 at 15:43










            • $begingroup$
              Wolfram states, that the special case for stirling first kind s(n,n-1) is -(n choose 2). So who's right now o_O
              $endgroup$
              – D idsea J
              Jan 18 at 8:05
















            $begingroup$
            Could you clarify what you mean by identity(2)?
            $endgroup$
            – D idsea J
            Jan 17 at 15:24




            $begingroup$
            Could you clarify what you mean by identity(2)?
            $endgroup$
            – D idsea J
            Jan 17 at 15:24




            1




            1




            $begingroup$
            $s_{n,n-1} = frac{n(n-1)}{2} tag 2$.. This is what I mean.
            $endgroup$
            – Satish Ramanathan
            Jan 17 at 15:26




            $begingroup$
            $s_{n,n-1} = frac{n(n-1)}{2} tag 2$.. This is what I mean.
            $endgroup$
            – Satish Ramanathan
            Jan 17 at 15:26












            $begingroup$
            Alright, even though I thought the final form after induction should be $frac{1}{24}(n+1)(n)(n-1)(3n)$ cause that's what we get if we put n=n+1 into the formula that we need to proof.
            $endgroup$
            – D idsea J
            Jan 17 at 15:32






            $begingroup$
            Alright, even though I thought the final form after induction should be $frac{1}{24}(n+1)(n)(n-1)(3n)$ cause that's what we get if we put n=n+1 into the formula that we need to proof.
            $endgroup$
            – D idsea J
            Jan 17 at 15:32














            $begingroup$
            It might be a stupid question. However, when doing induction last time it was always the case that you could just put n+1 into the formula you have to proof to see what the end should look like. I don't see why this is a proof if it's not the same in the end to be honest.
            $endgroup$
            – D idsea J
            Jan 17 at 15:43




            $begingroup$
            It might be a stupid question. However, when doing induction last time it was always the case that you could just put n+1 into the formula you have to proof to see what the end should look like. I don't see why this is a proof if it's not the same in the end to be honest.
            $endgroup$
            – D idsea J
            Jan 17 at 15:43












            $begingroup$
            Wolfram states, that the special case for stirling first kind s(n,n-1) is -(n choose 2). So who's right now o_O
            $endgroup$
            – D idsea J
            Jan 18 at 8:05




            $begingroup$
            Wolfram states, that the special case for stirling first kind s(n,n-1) is -(n choose 2). So who's right now o_O
            $endgroup$
            – D idsea J
            Jan 18 at 8:05











            3












            $begingroup$

            Induction step:



            $begin{aligned}sleft(n+1,n-1right) & =nsleft(n,n-1right)+sleft(n,n-2right)\
            & =frac{1}{2}n^{2}left(n-1right)+frac{1}{24}nleft(n-1right)left(n-2right)left(3n-1right)\
            & =frac{1}{24}nleft(n-1right)left[12n+left(n-2right)left(3n-1right)right]\
            & =frac{1}{24}nleft(n-1right)left(n+1right)left(3n+2right)\
            & =frac{1}{24}left(n+1right)nleft(n-1right)left(3n+2right)
            end{aligned}
            $



            In the second equality we use the equality $s(n,n-1)=frac12n(n-1)$ and also the induction hypothesis.






            share|cite|improve this answer









            $endgroup$


















              3












              $begingroup$

              Induction step:



              $begin{aligned}sleft(n+1,n-1right) & =nsleft(n,n-1right)+sleft(n,n-2right)\
              & =frac{1}{2}n^{2}left(n-1right)+frac{1}{24}nleft(n-1right)left(n-2right)left(3n-1right)\
              & =frac{1}{24}nleft(n-1right)left[12n+left(n-2right)left(3n-1right)right]\
              & =frac{1}{24}nleft(n-1right)left(n+1right)left(3n+2right)\
              & =frac{1}{24}left(n+1right)nleft(n-1right)left(3n+2right)
              end{aligned}
              $



              In the second equality we use the equality $s(n,n-1)=frac12n(n-1)$ and also the induction hypothesis.






              share|cite|improve this answer









              $endgroup$
















                3












                3








                3





                $begingroup$

                Induction step:



                $begin{aligned}sleft(n+1,n-1right) & =nsleft(n,n-1right)+sleft(n,n-2right)\
                & =frac{1}{2}n^{2}left(n-1right)+frac{1}{24}nleft(n-1right)left(n-2right)left(3n-1right)\
                & =frac{1}{24}nleft(n-1right)left[12n+left(n-2right)left(3n-1right)right]\
                & =frac{1}{24}nleft(n-1right)left(n+1right)left(3n+2right)\
                & =frac{1}{24}left(n+1right)nleft(n-1right)left(3n+2right)
                end{aligned}
                $



                In the second equality we use the equality $s(n,n-1)=frac12n(n-1)$ and also the induction hypothesis.






                share|cite|improve this answer









                $endgroup$



                Induction step:



                $begin{aligned}sleft(n+1,n-1right) & =nsleft(n,n-1right)+sleft(n,n-2right)\
                & =frac{1}{2}n^{2}left(n-1right)+frac{1}{24}nleft(n-1right)left(n-2right)left(3n-1right)\
                & =frac{1}{24}nleft(n-1right)left[12n+left(n-2right)left(3n-1right)right]\
                & =frac{1}{24}nleft(n-1right)left(n+1right)left(3n+2right)\
                & =frac{1}{24}left(n+1right)nleft(n-1right)left(3n+2right)
                end{aligned}
                $



                In the second equality we use the equality $s(n,n-1)=frac12n(n-1)$ and also the induction hypothesis.







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Jan 17 at 15:04









                drhabdrhab

                99.8k544130




                99.8k544130






























                    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%2f3076995%2finduction-proof-for-stirling-of-first-kind%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

                    mysqli_query(): Empty query in /home/lucindabrummitt/public_html/blog/wp-includes/wp-db.php on line 1924

                    Image
                    0 I just uploaded a new plugin to my wordpress site and I got this warning: mysqli_query(): Empty query in /home/lucindabrummitt/public_html/blog/wp-includes/wp-db.php on line 1924 Usually if I have a problem, I can find answers on google but this one seems pretty particular and I'm not finding any info on it except for this forum. I'm not terribly techie but if someone can tell me how to read this and how to change it I can follow directions pretty well. Thanks All! PS If I don't have the proper tags here could someone add the appropriate tags? php mysql wordpress share | improve this question asked Nov 16 '18 at 20:41 ...
                    Read more

                    How to change which sound is reproduced for terminal bell?

                    Image
                    3 Recently upgrade to 18.10 from 18.04, and using the terminal is becoming annoying: the new alert sound is a drip ( /usr/share/sounds/gnome/default/alerts/drip.ogg ), and the previous one is still located at ( /usr/share/sounds/ubuntu/stereo/bell.ogg ). My issue is that at the gnome-terminal, when autocompleting or pressing left BOTH sounds are reproduced, at the same time. I want to just have ubuntu/stereo/bell.ogg active, not both . At the moment I have been only able to reduce the volume of the alerts (but still both are played), or turn the alerts down (but I dislike both "solutions"). gnome-terminal 18.10 teminal-bell share | improve this question ...
                    Read more

                    Can I use Tabulator js library in my java Spring + Thymeleaf project?

                    Image
                    0 I want to add Tabulator js to my java project. I added tabulator.min.js, tabulator.min.css to resources folder. After that added to my html page these dependencies as recommending in readme.md. <link rel="stylesheet" th:href="@{/css/tabulator.min.css}"> <script type="text/javascript" th:src="@{/js/tabulator.min.js}"></script> Now my tables view all elements, that I have in the html page, but not correct. In the documentation of Tabulator is example how to create header and table, var table = new Tabulator("#example-table", { columns:[ {title:"Name", field:"name", sorter:"string", width:200, editor:true}, {title:"Age", field:"age", sorter:"...
                    Read more