Problem

Source: IrMO 2022

Tags: combinatorics, algebra



10. Let n5 be an odd number and let r be an integer such that 1r(n1)/2. IN a sports tournament, n players take part in a series of contests. In each contest, 2r+1 players participate, and the scores obtained by the players are the numbers r,(r1),,1,0,1,r1,rin some order. Each possible subset of 2r+1 players takes part together in exactly one contest. let the final score of player i be Si, for each i=1,2,,n. Define N to be the smallest difference between the final scores of two players, i.e., N=minDetermine, with proof, the maximum possible value of N.