Skip to main content
OlympiadHQ

Browse · MathNet

Print

Final Round

Netherlands counting and probability

Problem

Daan distributes the numbers to over the nine squares of a table (each square receives exactly one number). Then, in each row, Daan circles the median number (the number that is neither the smallest nor the largest of the three). For example, if the numbers , , and are in one row, he circles the number . He does the same for each column and each of the two diagonals. If a number is already circled, he does not circle it again.

(⑧)1(②)
7(⑥)(③)
9(⑤)4


He calls the result of this process a median table. Above, you can see a median table that has circled numbers.

a. What is the smallest possible number of circled numbers in a median table? Prove that a smaller number is not possible and give an example in which a minimum number of numbers is circled.

b. What is the largest possible number of circled numbers in a median table? Prove that a larger number is not possible and give an example in which a maximum number of numbers is circled.
Solution
a. The smallest possible number of circled numbers is . Fewer than is not possible since in each row at least one number is circled (and these are three different numbers).

On the right, a median table is shown in which only numbers are circled. In the rows, the numbers , , are circled, in the columns the numbers , , , and on the diagonals the numbers and . Together, these are three different numbers: , , and .

497
258
316


b. The largest possible number of circled numbers is . More than is not possible, since the numbers and are never circled, hence no more than numbers are circled.

On the right, a median table is shown in which numbers are circled. In the rows, the numbers , , are circled, in the columns the numbers , , , and on the diagonals the numbers and . Together, these are the numbers , , , , , , .

412
756
893
Final answer
Minimum 3, maximum 7

Techniques

Coloring schemes, extremal arguments