A Theorem in Combinatorics and Wilson's Theorem (Q3708028)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3933078
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Theorem in Combinatorics and Wilson's Theorem |
scientific article; zbMATH DE number 3933078 |
Statements
A Theorem in Combinatorics and Wilson's Theorem (English)
0 references
1985
0 references
Stirling numbers
0 references
Wilson's theorem
0 references
0.7142875790596008
0 references
0.7045263648033142
0 references
Let S(n,r) denote the Stirling numbers of the second kind. In this paper the numbers \(B(n,r)=r!S(n,r)\) are considered; B(n,r) equals to the number of distributions of n distinct objects among r ordered boxes, none remaining empty. The author's theorem states that (i) if n is prime, then n divides B(n,r) for all \(r\geq 2\) and (ii) if n is prime, then n divides \(B(n-1,r)+(-1)^ r\) for all r, \(1\leq r\leq n-1\). Since \(B(n-1,n-1)=(n- 1)!,\) (ii) implies Wilson's theorem. To prove his theorem, the author uses the identities \(B(n,r)=\sum^{n-r+1}_{k=1}\left( \begin{matrix} n\\ k\end{matrix} \right)B(n-k,r-1),\) \(2\leq r\leq n\) and \(B(n,r)=r(B(n-1,r)+B(n- 1,r-1)),\) \(2\leq r\leq n-1\).
0 references