Maths Olympiad Prep

Library / Turkish Mathematical Olympiad /34 of 47

Turkish Mathematical Olympiad

Combinatorics Difficulty 6.9 National Olympiad Prove it Turkey

Let n≥2n \ge 2 be an integer and E={1,2,…,n}E = \{1, 2, \dots, n\}. If A1,A2,…,AkA_1, A_2, \dots, A_k are subsets of EE and exactly one of Ai∩AjA_i \cap A_j, Ai′∩AjA'_i \cap A_j, Ai∩Aj′A_i \cap A'_j and Ai′∩Aj′A'_i \cap A'_j is empty for all 1≤i<j≤k1 \le i < j \le k, then determine the maximum possible value of kk.

[For A⊂EA \subset E, A′A' denotes the elements of EE which are not included in AA.]

Solution

The answer is 2n−32n-3 and an example is {1},{2},…,{n},{1,2},{1,2,3},…,{1,2,3,…,n−2}\{1\}, \{2\}, \dots, \{n\}, \{1,2\}, \{1,2,3\}, \dots, \{1,2,3,\dots, n-2\}.

We will prove it by induction on nn. For n=2n=2, it is clear that kk is at most 11. For n=3n=3, it is easy to check that k≤3k \le 3. Let us assume that the answer is 2n−52n-5 for n−1≥3n-1 \ge 3. Let M={A1,A2,…,Ak}M = \{A_1, A_2, \dots, A_k\} be a maximal collection satisfying the conditions for nn. By the example above, k≥2n−3k \ge 2n-3. Note that neither ∅\emptyset nor EE is in MM. If none of {i}\{i\} and {i}′\{i\}' is in MM for some 1≤i≤n1 \le i \le n, then we could add one of them and enlarge the collection. Clearly both {i}\{i\} and {i}′\{i\}' can not be in MM and hence exactly one of {i}\{i\} and {i}′\{i\}' belongs to MM for all 1≤i≤n1 \le i \le n.

Observe that if X∈MX \in M, then we can replace it by X′X'. Therefore we may assume that ∣Ai∣≤n2|A_i| \le \frac{n}{2} for all 1≤i≤n1 \le i \le n.

Now let us choose a set A∈MA \in M such that ∣A∣≥2|A| \ge 2 and ∣A∣≤∣B∣|A| \le |B| for all B∈MB \in M with ∣B∣≥2|B| \ge 2. Since 2n−3>n2n-3 > n, there exists at least one such set. Without loss of generality we may assume that 1,2∈A1, 2 \in A. Then consider any set BB in MM other than {1},{2}\{1\}, \{2\} and AA.

If A∩B=∅A \cap B = \emptyset, then 1,2∉B1, 2 \notin B.

If A∩B′=∅A \cap B' = \emptyset, then A⊂BA \subset B and hence 1,2∈B1, 2 \in B.

If A′∩B=∅A' \cap B = \emptyset, then B⊂AB \subset A and hence ∣B∣=1|B| = 1 by the choice of AA. Thus, 1,2∉B1, 2 \notin B.

If A′∩B′=∅A' \cap B' = \emptyset, then A∪B=EA \cup B = E. But when nn is odd ∣A∣,∣B∣≤n−12|A|, |B| \le \frac{n-1}{2} and hence ∣A∪B∣≤n−1|A \cup B| \le n-1. And when nn is even, the only possible case is ∣A∣=∣B∣=n2|A| = |B| = \frac{n}{2}, but then B=A′B = A' and A∩B=∅A \cap B = \emptyset.

Therefore we conclude that {1,2}⊂B\{1,2\} \subset B or {1,2}∩B=∅\{1,2\} \cap B = \emptyset for all BB in MM other than {1}\{1\} and {2}\{2\}. Hence by removing {1}\{1\} and {2}\{2\} from MM and merging 11 and 22, we obtain a new maximal collection for n−1n-1. By the induction hypothesis k−2≤2n−5k-2 \le 2n-5 and we also know that k≥2n−3k \ge 2n-3. Therefore k=2n−3k = 2n-3.

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: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.