Skip to main content
OlympiadHQ

Browse · MathNet

Print

Belarus2022

Belarus 2022 counting and probability

Problem

The cells of the table are filled with positive integers from to , 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 pairwise distinct numbers and there are exactly 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 . (Mikhail Karpuk)
Solution
Answer: .

Let Dima wrote down the numbers and Vlad wrote down the numbers . Suppose the answer in the problem is or , then . Each of the lines not containing contains at least numbers not exceeding : the number written by Vlad and all smaller numbers. And each column contains at least numbers not less than : the number written by Dima and all greater numbers. Therefore the total amount of numbers in the table is not less than which exceeds the number of all numbers in the table — a contradiction.

Let's show that it could turn out that of numbers written by Vlad are less than any number written by Dima. Fill in the table
...
...
numbers from to so that (by , and 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.
Final answer
2020

Techniques

Counting two waysColoring schemes, extremal arguments