Library / /45 of 151

, 2014

Combinatorics Difficulty 6.0 National Olympiad Prove it Hungary

Let $n\ge2$ , and let $\mathcal{S}$ be a family of some subsets of $\{1,2,\ldots,n\}$ with the property that $|A\cup B\cup C\cup D|\le n-2$ for all $A,B,C,D\in\mathcal{S}$ . Show that $|\mathcal{S}|\le 2^{n-2}$ .
(CIIM6, Costa Rica)
(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.