2020 IMO Problems/Problem 4

Revision as of 11:25, 14 May 2021 by Etmetalakret (talk | contribs)


There is an integer $n > 1$. There are $n^2$ stations on a slope of a mountain, all at different altitudes. Each of two cable car companies, $A$ and $B$, operates $k$ cable cars; each cable car provides a transfer from one of the stations to a higher one (with no intermediate stops). The $k$ cable cars of $A$ have $k$ different starting points and $k$ different finishing points, and a cable car that starts higher also finishes higher. The same conditions hold for $B$. We say that two stations are linked by a company if one can start from the lower station and reach the higher one by using one or more cars of that company (no other movements between stations are allowed).

Determine the smallest positive integer k for which one can guarantee that there are two stations that are linked by both companies.

Video solution

https://www.youtube.com/watch?v=dTqwOoSfaAA [video covers all day 2 problems]

Invalid username
Login to AoPS