Problem

Source: Indonesia TST Round 1-Combinatorics

Tags: Tstst, combinatorics, Subset



Let $A$ be a set with $1000$ members and $\mathcal F =${$A_1,A_2,\ldots,A_n$} a family of subsets of A such that (a) Each element in $\mathcal F$ consists of 3 members (b) For every five elements in $\mathcal F$, the union of them all will have at least $12$ members Find the largest value of $n$