navbar-top.gif
btn_spacer.gifHomeTopicsLatestRandomAboutFAQsParticipateAuthoring Areabtn_spacer.gif

Stirling Numbers of the Second Kind

The Stirling numbers of the second kind, or Stirling partition numbers, sometimes denoted , count the number of ways to partition a set of elements into discrete, nonempty subsets. This Demonstration illustrates the different partitions that a Stirling partition number counts. The sums of the Stirling partition numbers are the Bell numbers.

Snapshot 1: there is only one way to partition elements into nonempty subsets, and therefore
Snapshot 2: similarly, there is only one way to partition elements into 1 nonempty subset, which means that
Snapshot 3: the Stirling numbers of the second kind can be computed recursively; by comparing Snapshot 2 and Snapshot 3, it is apparent that and are related
Powered by Wolfram Mathematica
Give us your feedback
Give us your feedback

Source page:




 often  occasionally  never

Note: Please do not include anything you consider confidential or proprietary. We will keep your information private. We will not give it to any third party.
Privacy Policy »

©  2008 The Wolfram Demonstrations Project & Contributors    Wolfram Research    Site Index    Terms of Use    Privacy Policy    RSS    Atom