You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@commons.apache.org by ah...@apache.org on 2022/11/09 12:33:58 UTC
[commons-numbers] 03/04: Add Stirling number of the first kind to the user guide
This is an automated email from the ASF dual-hosted git repository.
aherbert pushed a commit to branch master
in repository https://gitbox.apache.org/repos/asf/commons-numbers.git
commit 517b60d4db51eb60274c879850804abf1e779d67
Author: aherbert <ah...@apache.org>
AuthorDate: Wed Nov 9 12:27:30 2022 +0000
Add Stirling number of the first kind to the user guide
---
src/site/apt/userguide/index.apt | 5 ++++-
1 file changed, 4 insertions(+), 1 deletion(-)
diff --git a/src/site/apt/userguide/index.apt b/src/site/apt/userguide/index.apt
index c7c3f672..f140f894 100644
--- a/src/site/apt/userguide/index.apt
+++ b/src/site/apt/userguide/index.apt
@@ -295,7 +295,10 @@ list.forEach(c -> System.out.println(Arrays.toString(c)));
[3, 4, 5]
+------------------------------------------+
- The <<<Stirling>>> class can evaluate Stirling numbers of the second kind \( S(n, k) \). This is
+ The <<<Stirling>>> class can evaluate Stirling numbers of the first kind and second kind.
+ The Stirling numbers of the first kind \( s(n, k) \) arise in the study of permutations,
+ particularly counting the permutations of a set according to their number of cycles.
+ The Stirling number of the second kind \( S(n, k) \) is
the number of ways of partitioning a set of \( n \) elements into \( k \) non-empty subsets.
For example a set of 3 elements may be partitioned into: