## Problem of the Day #292: Subset Selection
*January 5, 2012*

*Posted by Saketh in : potd , trackback*

Alex has a set of $2012$ numbers. At most how many $5$-element subsets can he pick such that no two share more than $3$ elements?

jump to navigation
## Problem of the Day #292: Subset Selection
*January 5, 2012*

*Posted by Saketh in : potd , trackback
*

Alex has a set of $2012$ numbers. At most how many $5$-element subsets can he pick such that no two share more than $3$ elements?

## Comments»

no comments yet - be the first?