olymmath

KMO 2021 Problem 4

    For a positive integer nn , there are two countries AA and BB with nn airports each and n2−2n+2n^2-2n+ 2 airlines operating between the two countries. Each airline operates at least one flight. Exactly one flight by one of the airlines operates between each airport in AA and each airport in BB , and that flight operates in both directions. Also, there are no flights between two airports in the same country. For two different airports PP and QQ , denote by "(P,Q)(P, Q) -travel route" the list of airports T0,T1,…,TsT_0, T_1, \ldots, T_s satisfying the following conditions.

    • T0=P, Ts=QT_0=P,\ T_s=Q
    • T0,T1,…,TsT_0, T_1, \ldots, T_s are all distinct.
    • There exists an airline that operates between the airports TiT_i and Ti+1T_{i+1} for all i=0,1,…,s−1i = 0, 1, \ldots, s-1 .

    Prove that there exist two airports P,QP, Q such that there is no or exactly one (P,Q)(P, Q) -travel route.

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

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

    Locator kr-kmo/2021/p4 · Tag H0MJGM0441 · Edit this page on GitHub · Keys: j next, k previous