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.
“... many of the things which we deplore, the prevalence of tuberculosis, the mounting record of crime in certain sections of the country, are not due just to lack of education and to physical differences, but are due in great part to the basic fact of segregation which we have set up in this country and which warps and twists the lives not only of our Negro population, but sometimes of foreign born or even of religious groups.”
—Eleanor Roosevelt (1884–1962)