IMO 2020 #4

Discussion on International Mathematical Olympiad (IMO)
User avatar
FuadAlAlam
Posts:30
Joined:Wed Sep 16, 2020 11:10 am
Location:Dhaka, Bangladesh
Contact:
IMO 2020 #4

Unread post by FuadAlAlam » Fri Dec 04, 2020 12:47 pm

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 which 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.

Proposed by Tejaswi Navilarekallu, India

Post Reply