Stirling number of the first kind: Proof of Recursion formula

Stirling number of the first kind: Proof of Recursion formula [closed]

I warn to proove this recursion formula for stirling numbers of the first kind:

$s_{n+1,k+1} = \sum_{i=k}^{n} \binom{i}{k} s_{n,i}$

But I lack a usable idea. Perhaps someone could inspire me?

Kind regards Aufwind

PS: I am sorry for the latex mess, but I can't find the error. Update: Ah I got it!! Latex should not be indented like usual code. I thought this has to work like in stackoverlfow, but I was wrong. =)

edited Apr 20 2011 at 18:32

asked Apr 20 2011 at 18:26

Aufwind
1●1

This is a fairly straightforward exercise and not really appropriate for the site (see the FAQ). You might try asking, for example, at math.stackexchange.com. – Qiaochu Yuan Apr 20 2011 at 18:38

I didn't know that. Thank you for the redirection. – Aufwind Apr 20 2011 at 20:05

closed as off topic by Qiaochu Yuan, Andres Caicedo, Douglas Zare, Zev Chonoles, Alon Amit Apr 20 2011 at 20:24

Browse other questions tagged enumeration or ask your own question.

question feed