Skip to main content
OlympiadHQ

Browse · MathNet

Print

19th Turkish Mathematical Olympiad

Turkey counting and probability

Problem

Let be an integer and . If are subsets of and exactly one of , , and is empty for all , then determine the maximum possible value of .

[For , denotes the elements of which are not included in .]
Solution
The answer is and an example is .

We will prove it by induction on . For , it is clear that is at most . For , it is easy to check that . Let us assume that the answer is for . Let be a maximal collection satisfying the conditions for . By the example above, . Note that neither nor is in . If none of and is in for some , then we could add one of them and enlarge the collection. Clearly both and can not be in and hence exactly one of and belongs to for all .

Observe that if , then we can replace it by . Therefore we may assume that for all .

Now let us choose a set such that and for all with . Since , there exists at least one such set. Without loss of generality we may assume that . Then consider any set in other than and .

If , then .

If , then and hence .

If , then and hence by the choice of . Thus, .

If , then . But when is odd and hence . And when is even, the only possible case is , but then and .

Therefore we conclude that or for all in other than and . Hence by removing and from and merging and , we obtain a new maximal collection for . By the induction hypothesis and we also know that . Therefore .
Final answer
2n-3

Techniques

Induction / smoothingColoring schemes, extremal arguments