Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

If

$$\sum_{k=0}^nS(n,k)=B(n)\;,$$

the bell number,

then does

$$\sum kS(n,k)=B(n+1)-B(n)\;?$$

share|improve this question

marked as duplicate by Mike Spivey, Amzoti, Henry T. Horton, Sasha, 5pm Feb 20 '13 at 17:33

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

1 Answer 1

Just grind it out, using the usual recurrence for the Stirling numbers of the second kind:

$$\begin{align*} B(n+1)-B(n)&=\sum_{k=0}^{n+1}{{n+1}\brace k}-\sum_{k=0}^n{n\brace k}\\\\ &={{n+1}\brace{n+1}}+\sum_{k=0}^n\left({{n+1}\brace k}-{n\brace k}\right)\\\\ &=1+\sum_{k=0}^n\left(\left(k{n\brace k}+{n\brace{k-1}}\right)-{n\brace k}\right)\\\\ &=1+\sum_{k=0}^n\left((k-1){n\brace k}+{n\brace{k-1}}\right)\\\\ &=1+\sum_{k=1}^n(k-1){n\brace k}+\sum_{k=0}^{n-1}{n\brace k}\\\\ &=1+(n-1){n\brace n}+{n\brace 0}+\sum_{k=1}^{n-1}k{n\brace k}\\\\ &=1+(n-1)+\sum_{k=0}^{n-1}k{n\brace k}&&\text{since }{n\brace 0}=0\\\\ &=n+\sum_{k=0}^{n-1}k{n\brace k}\\\\ &=\sum_{k=0}^nk{n\brace k}&&\text{since }{n\brace n}=1\;. \end{align*}$$

share|improve this answer

Not the answer you're looking for? Browse other questions tagged or ask your own question.