Maths Olympiad Prep

Library / KöMaL problem A /42 of 136

KöMaL problem A, 2014

Combinatorics Difficulty 6.0 National Olympiad Prove it Hungary

Let n≥2n\ge2, and let S\mathcal{S} be a family of some subsets of {1,2,…,n}\{1,2,\ldots,n\} with the property that ∣A∪B∪C∪D∣≤n−2|A\cup B\cup C\cup D|\le n-2 for all A,B,C,D∈SA,B,C,D\in\mathcal{S}. Show that ∣S∣≤2n−2|\mathcal{S}|\le 2^{n-2}.
(CIIM6, Costa Rica)
(5 pont)

We don't reproduce this publisher's solutions. Their own solution is here — work the problem first.
Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge 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.