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 19 hours ago









      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
            18 hours ago






          • 1




            $begingroup$
            $s_{n,n-1} = frac{n(n-1)}{2} tag 2$.. This is what I mean.
            $endgroup$
            – Satish Ramanathan
            18 hours ago










          • $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
            18 hours ago












          • $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
            17 hours ago










          • $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
            1 hour ago



















          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
              18 hours ago






            • 1




              $begingroup$
              $s_{n,n-1} = frac{n(n-1)}{2} tag 2$.. This is what I mean.
              $endgroup$
              – Satish Ramanathan
              18 hours ago










            • $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
              18 hours ago












            • $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
              17 hours ago










            • $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
              1 hour ago
















            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
              18 hours ago






            • 1




              $begingroup$
              $s_{n,n-1} = frac{n(n-1)}{2} tag 2$.. This is what I mean.
              $endgroup$
              – Satish Ramanathan
              18 hours ago










            • $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
              18 hours ago












            • $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
              17 hours ago










            • $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
              1 hour ago














            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 18 hours ago









            Satish RamanathanSatish Ramanathan

            9,52231323




            9,52231323












            • $begingroup$
              Could you clarify what you mean by identity(2)?
              $endgroup$
              – D idsea J
              18 hours ago






            • 1




              $begingroup$
              $s_{n,n-1} = frac{n(n-1)}{2} tag 2$.. This is what I mean.
              $endgroup$
              – Satish Ramanathan
              18 hours ago










            • $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
              18 hours ago












            • $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
              17 hours ago










            • $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
              1 hour ago


















            • $begingroup$
              Could you clarify what you mean by identity(2)?
              $endgroup$
              – D idsea J
              18 hours ago






            • 1




              $begingroup$
              $s_{n,n-1} = frac{n(n-1)}{2} tag 2$.. This is what I mean.
              $endgroup$
              – Satish Ramanathan
              18 hours ago










            • $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
              18 hours ago












            • $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
              17 hours ago










            • $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
              1 hour ago
















            $begingroup$
            Could you clarify what you mean by identity(2)?
            $endgroup$
            – D idsea J
            18 hours ago




            $begingroup$
            Could you clarify what you mean by identity(2)?
            $endgroup$
            – D idsea J
            18 hours ago




            1




            1




            $begingroup$
            $s_{n,n-1} = frac{n(n-1)}{2} tag 2$.. This is what I mean.
            $endgroup$
            – Satish Ramanathan
            18 hours ago




            $begingroup$
            $s_{n,n-1} = frac{n(n-1)}{2} tag 2$.. This is what I mean.
            $endgroup$
            – Satish Ramanathan
            18 hours ago












            $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
            18 hours ago






            $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
            18 hours ago














            $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
            17 hours ago




            $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
            17 hours ago












            $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
            1 hour ago




            $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
            1 hour ago











            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 18 hours ago









                drhabdrhab

                99k544130




                99k544130






























                    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

                    Loup dans la culture

                    Image
                    Loups sur une enluminure du Bestiaire d'Aberdeen Le loup est l'animal le plus emblématique de l'histoire de l'Eurasie, il était à l'honneur durant l'Antiquité chez la totalité des anciens peuples européens [ 1 ] . Sommaire 1 Le loup dans la mythologie 2 Les loups dans le folklore 2.1 L'évolution des mentalités 2.2 Le loup dans la psychanalyse 3 Le loup dans les œuvres culturelles 3.1 Le loup dans la littérature 3.1.1 Fables 3.1.2 Poésie 3.1.3 Romans 3.1.4 Littérature jeunesse 3.1.4.1 Quelques titres d'albums contemporains 3.1.5 Bande dessinée 3.2 Le loup à l'écran 3.2.1 Le cinéma et la télévision 3.2.2 Documentaires 3.2.3 Dessins animés 3.2.4 Jeux vidéo 3.3 Le loup en peinture et en sculpture 3.4 Le loup dans les œuvres musicales 4 Le loup et les noms propres 5 Bibliographie 6 Notes et références 7 Voir aussi 7.1 Articles connexes
                    Read more

                    How to solve the problem of ntp “Unable to contact time server” from KDE?

                    Image
                    1 0 I want to set date and time automatically but this error appears when I try to .. I'm using openSUSE, I tried different servers but it didn't work either, help please! It doesn't seem to be a network problem: $ ping pool.ntp.org 64 bytes from 41.78.128.17: icmp_seq=1 ttl=41 time=260 ms To the question of whether ntpd is installed and running: $ ps -C ntpd PID TTY TIME CMD i.e. there's no ntpd process running. $ rpm -qa | grep ntp yast2-ntp-client-3.1.12-1.7.noarch ntp-4.2.6p5-25.2.1.i586 Further information from the comments: $ sudo ntpdate pool.ntp.org 25 Sep 19:41:51 ntpdate[3162]: no server suitable for synchronization found networking kde opensuse ntp ntpd sh
                    Read more

                    ASUS Zenbook UX433/UX333 — Configure Touchpad-embedded numpad on Linux

                    Image
                    0 1 I have an ASUS Zenbook UX433,on which ASUS decided to innovate by embedding a Numpad inside the touchpad (see picture 1). Toggling between classic touchpad mode and numpad (also turns the touchpad LEDs on) can be done through the golden button in the top-right corner of the touchpad. However, on my Manjaro arch Linux config, this behavior does not work by default and I can only use the touchpad, no numpad. Has anyone been able to configure the numpad to work on Linux, or have any idea how this could be achieved? EDIT1: I have had a look at the official Windows drivers for the UX433FA TouchPad, but was not able to make anything of it. I tried installing them on Linux using tools like NDISWrapper, but they do not detect the TouchPad/Numpad hardware, and my understanding of drivers is too limited.
                    Read more