Stirling Numbers

Not Reviewed
Equation / Last modified by CalebSvobodny on 2016/07/07 14:52
`S{n,k} = `
Rating
ID
cjlynch.Stirling Numbers
UUID
2b8130ec-1de7-11e6-9770-bc764e2038f2

In mathematics, particularly in combinatorics, a Stirling number of the second kind (or Stirling partition number) is the number of ways to partition a set of n objects into k non-empty subsets and is denoted by S(n,k). Stirling numbers of the second kind occur in the field of mathematics called combinatorics and the study of partitions.

Stirling numbers of the second kind are one of two kinds of Stirling numbers, the other kind being called Stirling numbers of the first kind (or Stirling cycle numbers). Mutually inverse (finite or infinite) triangular matrices can be formed from the Stirling numbers of each kind according to the parameters n, k.

Source: Wikipedia https://en.wikipedia.org/wiki/Stirling_numbers_of_the_second_kind

 

This equation, Stirling Numbers, is listed in 1 Collection.