AngouriMath

Navigation

← Back to list of members

StirlingSecondKind​(System.​Int32)

 Method (no overloads)

Summary

S(n, m) for n, m up to degree: the number of ways to
partition n things into m non-empty parts, by the recurrence
S(n, m) = m * S(n - 1, m) + S(n - 1, m - 1).

























Angouri © 2019-2023 · Project's repo · Site's repo · Octicons · Transparency · 4378 pages online