Maths Olympiad Prep

Library / /20 of 151

, 2014

Combinatorics Difficulty 6.0 National Olympiad Prove it Hungary

Let F\mathcal{F} be a finite family of finite sets and let AA be an arbitrary finite set. We say that F\mathcal{F} shatters the set AA if for every XAX\subseteq A there is a set FFF\in \mathcal{F} such that AF=XA\cap F=X. Show that F\mathcal{F} shatters at least F|\mathcal{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.

Source: KöMaL, licensed Rights held by KöMaL and the MATFUND Foundation. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.