Maths Olympiad Prep

Library / Mongolian Mathematical Olympiad /90 of 97

Mongolian Mathematical Olympiad

Combinatorics Difficulty 7.1 National Olympiad, round 2 Prove it Mongolia

Five girls and five boys participate in a tournament. Suppose that it is possible to number the girls from 1 to 5 and also the boys from 1 to 5 so that for all 1≤i,j≤51 \le i, j \le 5, the number of students that the ii-th girl and the jj-th boy both know is exactly ∣i−j∣|i - j|. Let SS denote the maximum of the sum of the number of students that each girl knows and the sum of the number of students that each boy knows. What is the minimum possible value of SS? Here we assume that the relationship of knowing is directional, that is, AA knows BB does not mean BB knows AA. We also do not consider students to know themselves.

Solution

Answer: 19.
For 1≤i≤51 \le i \le 5, let aia_i denote the ii-th girl and let AiA_i denote the set of students that aia_i knows. Similarly let bib_i denote the ii-th boy and let BiB_i denote the set of students that bib_i knows.
Since ∣Ai∩B1∣=i−1|A_i \cap B_1| = i - 1, ∣Ai∩B5∣=5−i|A_i \cap B_5| = 5 - i, we have
∣A1∣≥4, ∣A2∣≥3, ∣A3∣≥2, ∣A4∣≥3, ∣A5∣≥4. |A_1| \ge 4,\ |A_2| \ge 3,\ |A_3| \ge 2,\ |A_4| \ge 3,\ |A_5| \ge 4.
Similarly for ∣Bi∣|B_i|.
First suppose ∣A1∣=4|A_1| = 4. Since ∣A1∩B5∣=4|A_1 \cap B_5| = 4, we have A1⊆B5A_1 \subseteq B_5, thus A1∩A5⊆B5∩A5=∅A_1 \cap A_5 \subseteq B_5 \cap A_5 = \emptyset. It follows that ∣Bi∣≥∣(A1∪A5)∩Bi∣=∣A1∩Bi∣+∣A5∩Bi∣=4|B_i| \ge |(A_1 \cup A_5) \cap B_i| = |A_1 \cap B_i| + |A_5 \cap B_i| = 4. Hence ∑∣Bi∣≥20\sum |B_i| \ge 20. Similarly, if ∣A5∣=4|A_5| = 4, then ∑∣Bi∣≥20\sum |B_i| \ge 20.
Now suppose ∣A3∣=2|A_3| = 2. Then ∣A3∩B1∣=∣A3∩B5∣=2|A_3 \cap B_1| = |A_3 \cap B_5| = 2 implies that A3⊆B1∩B5A_3 \subseteq B_1 \cap B_5. Hence ∣B1∣≥∣A5∩B1∣+∣B5∩B1∣≥6|B_1| \ge |A_5 \cap B_1| + |B_5 \cap B_1| \ge 6. Analogously, we have ∣B5∣≥6|B_5| \ge 6, therefore ∑∣Bi∣≥6+3+2+3+6=20\sum |B_i| \ge 6 + 3 + 2 + 3 + 6 = 20.
Finally, if ∣A1∣≥5|A_1| \ge 5, ∣A3∣≥3|A_3| \ge 3, ∣A5∣≥5|A_5| \ge 5, then we have ∑∣Ai∣≥5+3+3+3+5=19\sum |A_i| \ge 5 + 3 + 3 + 3 + 5 = 19. Thus we have S≥19S \ge 19 and it suffices to find an example with ∑∣Ai∣=∑∣Bi∣=19\sum |A_i| = \sum |B_i| = 19:
A1={a2,a4,b1,b2,b5}{a1,a3,a5,b3,b4}=B1A2={a4,a5,b1}{a1,a3,b5}=B2A3={a1,a5,b1}{a3,a4,b5}=B3A4={a1,a3,a5}{a4,b1,b5}=B4A5={a1,a3,b3,b4,b5}{a2,a4,a5,b1,b2}=B5 \begin{align*} A_1 &= \{a_2, a_4, b_1, b_2, b_5\} & \{a_1, a_3, a_5, b_3, b_4\} &= B_1 \\ A_2 &= \{a_4, a_5, b_1\} & \{a_1, a_3, b_5\} &= B_2 \\ A_3 &= \{a_1, a_5, b_1\} & \{a_3, a_4, b_5\} &= B_3 \\ A_4 &= \{a_1, a_3, a_5\} & \{a_4, b_1, b_5\} &= B_4 \\ A_5 &= \{a_1, a_3, b_3, b_4, b_5\} & \{a_2, a_4, a_5, b_1, b_2\} &= B_5 \end{align*}

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.