Stirling numbers of the second kind in discrete mathematics are used to show numerous combinatoric properties like partitioning a set, (a number of ways to write an integer of a set), and forming a recurrence relation.