olymmath

ISL 2020 C7

Consider any rectangular table having finitely many rows and columns, with a real number a(r,c)a(r, c) in the cell in row rr and column cc. A pair (R,C)(R, C), where RR is a set of rows and CC a set of columns, is called a saddle pair if the following two conditions are satisfied: (i) For each row r′r^{\prime}, there is r∈Rr \in R such that a(r,c)⩾a(r′,c)a(r, c) \geqslant a\left(r^{\prime}, c\right) for all c∈Cc \in C; (ii) For each column c′c^{\prime}, there is c∈Cc \in C such that a(r,c)⩽a(r,c′)a(r, c) \leqslant a\left(r, c^{\prime}\right) for all r∈Rr \in R. A saddle pair (R,C)(R, C) is called a minimal pair if for each saddle pair ( R′,C′R^{\prime}, C^{\prime} ) with R′⊆RR^{\prime} \subseteq R and C′⊆CC^{\prime} \subseteq C, we have R′=RR^{\prime}=R and C′=CC^{\prime}=C. Prove that any two minimal pairs contain the same number of rows. (Thailand)

Dataset text NuminaMath olympiads. Quoted with source.

Official text: IMO 2020 Shortlist booklet, page 9.

Solutions

Official solution Solution 1 by the IMO Problem Selection Committee

The terms of the source let olymmath link to this solution but not copy it. Read the solution (IMO official site).

Similar problems

These problems have the most words in common with this statement.

Locator isl/2020/c7 · Tag MQ2DM0SJY4 · Edit this page on GitHub · Keys: j next, k previous