File tree Expand file tree Collapse file tree 3 files changed +58
-0
lines changed Expand file tree Collapse file tree 3 files changed +58
-0
lines changed Original file line number Diff line number Diff line change @@ -24,6 +24,7 @@ open import elementary-number-theory.archimedean-property-rational-numbers publi
24
24
open import elementary-number-theory.arithmetic-functions public
25
25
open import elementary-number-theory.based-induction-natural-numbers public
26
26
open import elementary-number-theory.based-strong-induction-natural-numbers public
27
+ open import elementary-number-theory.bell-numbers public
27
28
open import elementary-number-theory.bezouts-lemma-integers public
28
29
open import elementary-number-theory.bezouts-lemma-natural-numbers public
29
30
open import elementary-number-theory.binomial-coefficients public
Original file line number Diff line number Diff line change
1
+ # The Bell numbers
2
+
3
+ ``` agda
4
+ module elementary-number-theory.bell-numbers where
5
+ ```
6
+
7
+ <details ><summary >Imports</summary >
8
+
9
+ ``` agda
10
+ open import elementary-number-theory.binomial-coefficients
11
+ open import elementary-number-theory.multiplication-natural-numbers
12
+ open import elementary-number-theory.natural-numbers
13
+ open import elementary-number-theory.strict-inequality-natural-numbers
14
+ open import elementary-number-theory.strong-induction-natural-numbers
15
+ open import elementary-number-theory.sums-of-natural-numbers
16
+ ```
17
+
18
+ </details >
19
+
20
+ ## Idea
21
+
22
+ The {{#concept "Bell numbers" Agda=bell-number-ℕ WDID=Q816063 WD="Bell number"}}
23
+ count the number of ways to partition a set of size $n$. The Bell numbers can be
24
+ defined recursively by $B_0 := 1$ and
25
+
26
+ $$
27
+ B_{n+1} := \sum_{k=0}^{n} \binom{n}{k}B_k.
28
+ $$
29
+
30
+ The Bell numbers are listed as sequence A000110 in the
31
+ [ OEIS] ( literature.oeis.md ) {{#cite OEIS}}
32
+
33
+ ## Definitions
34
+
35
+ ### The Bell numbers
36
+
37
+ ``` agda
38
+ bell-number-ℕ : ℕ → ℕ
39
+ bell-number-ℕ =
40
+ strong-rec-ℕ 1
41
+ ( λ n B →
42
+ bounded-sum-ℕ
43
+ ( succ-ℕ n)
44
+ ( λ k k<n+1 →
45
+ binomial-coefficient-ℕ n k *ℕ B k (leq-le-succ-ℕ k n k<n+1)))
46
+ ```
47
+
48
+ ## References
49
+
50
+ {{#bibliography}}
Original file line number Diff line number Diff line change @@ -105,6 +105,13 @@ open import elementary-number-theory.catalan-numbers using
105
105
( catalan-numbers)
106
106
```
107
107
108
+ ### [ A000110] ( https://oeis.org/A000110 ) The Bell numbers
109
+
110
+ ``` agda
111
+ open import elementary-number-theory.bell-numbers using
112
+ ( bell-number-ℕ)
113
+ ```
114
+
108
115
### [ A000142] ( https://oeis.org/A000142 ) Factorials
109
116
110
117
``` agda
You can’t perform that action at this time.
0 commit comments