Maths Olympiad Prep

Library / /12 of 16

Combinatorics Difficulty 6.1 National Olympiad Prove it Bulgaria

Problem:
Each side of a sheet of paper is a map of 5 countries. The countries on one of the maps are colored in 5 different colors. Prove that it is possible to color the countries on the other map in such a way that every two are colored in different colors and at least 20%20\% of the sheet is colored in the same color on both sides.

Solution

Solution:
Denote by A1,A2,,A5A_{1}, A_{2}, \ldots, A_{5} and B1,B2,,B5B_{1}, B_{2}, \ldots, B_{5} the countries on the respective sides of the sheet of paper. Let SijS_{ij} be the area of the part of AiA_{i} which belongs to the country BjB_{j} on the other side of the sheet. (If AiA_{i} and BjB_{j} do not have a common area, then Sij=0S_{ij}=0.) Then, setting the area of the sheet to be 11, we have
S=(S11+S12+S13+S14+S15)+(S21+S22+S23+S24+S25)++(S51+S52+S53+S54+S55)=1 \begin{aligned} S= & \left(S_{11}+S_{12}+S_{13}+S_{14}+S_{15}\right)+\left(S_{21}+S_{22}+S_{23}+S_{24}+S_{25}\right)+\cdots \\ & +\left(S_{51}+S_{52}+S_{53}+S_{54}+S_{55}\right)=1 \end{aligned}
since Si1+Si2+Si3+Si4+Si5S_{i1}+S_{i2}+S_{i3}+S_{i4}+S_{i5} equals the area of AiA_{i}.

The sum SS can be written also as follows:
S=(S11+S22+S33+S44+S55)+(S12+S23+S34+S45+S51)++(S15+S21+S32+S43+S54) \begin{aligned} S= & \left(S_{11}+S_{22}+S_{33}+S_{44}+S_{55}\right)+\left(S_{12}+S_{23}+S_{34}+S_{45}+S_{51}\right)+\cdots \\ & +\left(S_{15}+S_{21}+S_{32}+S_{43}+S_{54}\right) \end{aligned}
Hence at least one of the summands is greater than or equal to 0.20.2 and let us assume that S13+S24+S35+S41+S520.2S_{13}+S_{24}+S_{35}+S_{41}+S_{52} \geq 0.2. We now color the countries B1,B2,,B5B_{1}, B_{2}, \ldots, B_{5} as follows: B3B_{3} by the color of A1A_{1}, B4B_{4} by the color of A2A_{2}, B5B_{5} by the color of A3A_{3}, B1B_{1} by the color of A4A_{4} and B2B_{2} by the color of A5A_{5}. Then every two countries are colored in different colors and at least 20%20\% of the sheet is colored in the same color on both sides.

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