Maritza edited The_Stirling_Number_of_a__.html  over 8 years ago

Commit id: 0168f4a111a7dca6d1042f12cb5212666983def9

deletions | additions      

       

The Stirling Number of a second kind is denoted by \(S\left(n,k\right)\)or \(\left(n,k\right)\)  counts the number of ways to partition a set of \(n\) elements into \(k\) non-empty  sets. 

For example, \(S\left(3,2\right)\)\(=3\), because there are three ways to partition three objects, namely \(a,b\) and \(c\) into two three  groups. \(\left(a\right)\left(bc\right),\left(b\right)\left(ac\right)\) and \(\left(c\right)\left(ab\right).\)