olymmath

KMO 2019 Problem 8

    There are two countries AA and BB , where each countries have n(≥2)n(\ge 2) airports. There are some two-way flights among airports of AA and BB , so that each airport has exactly 33 flights. There might be multiple flights among two airports; and there are no flights among airports of the same country. A travel agency wants to plan an exotic traveling course which travels through all 2n2n airports exactly once, and returns to the initial airport. If NN denotes the number of all exotic traveling courses, then prove that N4n\frac{N}{4n} is an even integer.

    (Here, note that two exotic traveling courses are different if their starting place are different.)

    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/2019/p8 · Tag 7SBS96ENAD · Edit this page on GitHub · Keys: j next, k previous