Problemintro
Set partitions
Also called Enumerating set partitions, Partitions of a set.
Enumerate all ways to split a finite set into nonempty disjoint blocks; there are Bell-number many of them.
Enumerate all ways to split a finite set into nonempty disjoint blocks; there are Bell-number many of them.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag RN20CX Edit this page History Report an error