Question Details

Question No: 450

 

Find the number of collections of $16$ distinct subsets of $\{1,2,3,4,5\}$ with the property that for any two subsets $X$ and $Y$ in the collection, $X \cap Y \not= \emptyset.$

Answer must be a floating-point or integer value and precision error less than 10^-6 is allowed.


Editorial
Tags: Combinatorics