In the Paircity there are n≥2 married couples numbered from 1 to n. On the New Year's eve, each man congratulated two women from couples whose numbers differ by one. It turned out that for any two men from couples whose numbers differ by one, there is a woman who received congratulations from both of them.
Prove that at least one man congratulated his wife.
Solution
Call a man *leftside* if he congratulated women from couples with numbers less than his own, otherwise call him *rightside*. Clearly, the man from the first couple is leftside and the man from the n-th couple is rightside. Hence, there is a number i, 1≤i<n−1, such that the man from the i-th couple is leftside while the man from the (i+1)-th couple is leftside. The numbers of couples of these men differ by one, but they congratulated four different women — a contradiction to the problem condition. Consequently, at least one man congratulated his wife.
Looking for a route rather than an archive? The track puts 2,000
problems in a working order, from AMC 10 level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement and solution reproduced as published; topic and difficulty added by this site.