Let F be a finite family of finite sets and let A be an arbitrary finite set. We say that F shatters the set A if for every X⊆A there is a set F∈F such that A∩F=X. Show that F shatters at least ∣F∣ sets. (5 pont)
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.