Define \( f(n) \) as the maximum number of 3-element subsets of the set \( \{1,2,…,n\} \) such that no 2 subsets share more than 1 element. For how many positive integers \( n \) is it true that \( f(n) = n \)?

×

Problem Loading...

Note Loading...

Set Loading...