There's a set $S$ with $8$ elements. How many distinct $3-$element subsets of $S$ are possible such that the intersection of any $2$ of them is not a $2-$element set?
Please help. I think its $14$. The options are :
- $28$
- $56$
- $112$
- $14$
- $168$
There's a set $S$ with $8$ elements. How many distinct $3-$element subsets of $S$ are possible such that the intersection of any $2$ of them is not a $2-$element set?
Please help. I think its $14$. The options are :