MathDB
Number of world travel modulo $4$

Source: Korean junior mathematical olympiad 2019 December

November 17, 2019
combinatoricsgraph theoryHamiltonian pathKJMO

Problem Statement

There are two airlines A and B and finitely many airports. For each pair of airports, there is exactly one airline among A and B whose flights operates in both directions. Each airline plans to develop world travel packages which pass each airport exactly once using only its flights. Let aa and bb be the number of possible packages which belongs to A and B respectively. Prove that aāˆ’ba-b is a multiple of 44.
The official statement of the problem has been changed. The above is the form which appeared during the contest. Now the condition 'the number of airports is no less than 4'is attached. Cite the following link. https://artofproblemsolving.com/community/c6h2923697p26140823