Partitions of A Set
In general, Bn is the number of partitions of a set of size n. A partition of a set S is defined as a set of nonempty, pairwise disjoint subsets of S whose union is S. For example, B3 = 5 because the 3-element set {a, b, c} can be partitioned in 5 distinct ways:
- { {a}, {b}, {c} }
- { {a}, {b, c} }
- { {b}, {a, c} }
- { {c}, {a, b} }
- { {a, b, c} }.
B0 is 1 because there is exactly one partition of the empty set. Every member of the empty set is a nonempty set (that is vacuously true), and their union is the empty set. Therefore, the empty set is the only partition of itself.
Note that, as suggested by the set notation above, we consider neither the order of the partitions nor the order of elements within each partition. This means the following partitionings are all considered identical:
- { {b}, {a, c} }
- { {a, c}, {b} }
- { {b}, {c, a} }
- { {c, a}, {b} }.
Read more about this topic: Bell Number
Famous quotes containing the words partitions and/or set:
“Walls have cracks and partitions ears.”
—Chinese proverb.
“To sum up:
1. The cosmos is a gigantic fly-wheel making 10,000 revolutions a minute.
2. Man is a sick fly taking a dizzy ride on it.
3. Religion is the theory that the wheel was designed and set spinning to give him the ride.”
—H.L. (Henry Lewis)