perlquestion
BrowserUk
<blockquote><i>
The number of partitions of size k of a set of n elements are known as Stirling numbers of the second kind, and satisfy the recursion:
<ul><li> S(0, 0) = 1
</li><li> S(n, 0) = 0 if n > 0
</li><li> S(n, 1) = S(n, n) = 1
</li><li> S(n, k) = S(n-1, k-1) + kS(n-1, k)
</ul>
</i></blockquote>
<p>The source is a cpan perl module; a google search will almost certainly discover which one; but that is irrelevant.
<p>All I'm looking for is a tangible explanation of the above description.
<p>Can any Monk put me in my place by transcribing the above description Into English?
<div class="pmsig"><div class="pmsig-171588">
<hr />
<font size=1 >
<div>With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'</div>
<div>Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.</div>
<div>"Science is about questioning the status quo. Questioning authority". [http://www.theregister.co.uk/2016/11/02/complexity_in_it/|The enemy of (IT) success is complexity.]</div>
<div>In the absence of evidence, opinion is indistinguishable from prejudice. </div>
</font>
</div></div>