Mathematica MathWorld Wolfram Science More »

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.


	Contributed by: Robert Dickau
	Show Initialization Code

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

Contributed by: Robert Dickau

Report an issue »

	Source page:
	Email	Name (optional)
	Occupation (optional)	Organization (optional)
	I use Mathematica often occasionally never
	Country (optional) Remember me
	Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed. Privacy Policy »

RSS

Atom