Maths Olympiad Prep

Library / /28 of 31

Combinatorics Difficulty 7.0 National olympiad, round 2 Prove it Belarus

The cells of the 2022×20222022 \times 2022 table are filled with positive integers from 11 to 202222022^2, each cell contains exactly one number, all numbers are used exactly once. For each line Vlad wrote out one number which is the second in descending order in this line. And Dima did the same for each column. It turned out that the boys wrote down 40444044 pairwise distinct numbers and there are exactly kk numbers written down by Vlad, such that each of them is less than every number written down by Dima.
Find the largest possible value of kk. (Mikhail Karpuk)

Solution

Answer: 20202020.

Let Dima wrote down the numbers d1>d2>>d2022d_1 > d_2 > \dots > d_{2022} and Vlad wrote down the numbers v1>v2>>v2022v_1 > v_2 > \dots > v_{2022}. Suppose the answer in the problem is 20222022 or 20212021, then d2022>v2d_{2022} > v_2. Each of the 20212021 lines not containing v1v_1 contains at least 20212021 numbers not exceeding v2v_2: the number written by Vlad and all smaller numbers. And each column contains at least 22 numbers not less than d2022d_{2022}: the number written by Dima and all greater numbers. Therefore the total amount of numbers in the table is not less than
20212021+20222=20222022+1, 2021 \cdot 2021 + 2022 \cdot 2 = 2022 \cdot 2022 + 1,
which exceeds the number of all numbers in the table — a contradiction.

Let's show that it could turn out that 20202020 of numbers written by Vlad are less than any number written by Dima. Fill in the table

| v1v_1 | d1d_1 | \infty | d4d_4 | d5d_5 | d6d_6 | ... | d2022d_{2022} |
|-------|-------|----------|-------|-------|-------|-----|------------|
| d2d_2 | v2v_2 | d3d_3 | \infty | yy | yy | ... | yy |
| xx | | v3v_3 | | | | | |
| xx | | | v4v_4 | | | | |
| xx | | | | v5v_5 | | | |
| xx | | | | | v6v_6 | | |
| \vdots | | | | | | \vdots | |
| xx | | | | | v6v_6 | | v2022v_{2022} |

numbers from 11 to 202222022^2 so that
>v1>v2>y>d1>>d2022>x>v3>>v2020 \infty > v_1 > v_2 > y > d_1 > \dots > d_{2022} > x > v_3 > \dots > v_{2020}
(by \infty, yy and xx in these inequalities we mean each number written on the cell with the corresponding label), and the numbers on empty cells are less than each of the numbers on marked cells.

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 and solution reproduced as published; topic and difficulty added by this site.