MathDB
TOT 531 1997 Spring J A3 - 2n players in chess tournament,

Source:

September 11, 2024
combinatorics

Problem Statement

In a chess tournament, each of 2n2n players plays every other player once in each of two rounds. A win is worth 11 point, a draw is worth 12\frac12 point and a loss is worth nothing. Prove that if for every player, the total score in the first round differs from that in the second round by at least n points, then this difference is exactly n points for every player.
(B Frenkin)