What Is Partitioning Of A Set?

1.	What Is Partitioning Of A Set?
Answer» Partition of a SET, say S, is a collection of n disjoint subsets, say P1,P2,…Pn that satisfies the FOLLOWING three conditions − Pi does not contain the empty set. [Pi≠{∅} for all 0<i≤n] The union of the subsets MUST equal the entire original set. [P1∪P2∪⋯∪Pn=S] The INTERSECTION of any two distinct sets is empty.[Pa∩Pb={∅}, for a≠b where n≥a,b≥0] Partition of a set, say S, is a collection of n disjoint subsets, say P1,P2,…Pn that satisfies the following three conditions −

Answer»

Partition of a SET, say S, is a collection of n disjoint subsets, say P1,P2,…Pn that satisfies the FOLLOWING three conditions −

Pi does not contain the empty set. [Pi≠{∅} for all 0<i≤n]
The union of the subsets MUST equal the entire original set. [P1∪P2∪⋯∪Pn=S]
The INTERSECTION of any two distinct sets is empty.[Pa∩Pb={∅}, for a≠b where n≥a,b≥0]

Partition of a set, say S, is a collection of n disjoint subsets, say P1,P2,…Pn that satisfies the following three conditions −

Discussion