MathDB
Maximum possible value of x

Source: Turkey EGMO TST 2018 #4

April 6, 2020
combinatoricscombinatorics proposedcombinatorics unsolvedmaximum value

Problem Statement

There are nn stone piles each consisting of 20182018 stones. The weight of each stone is equal to one of the numbers 1,2,3,...251, 2, 3, ...25 and the total weights of any two piles are different. It is given that if we choose any two piles and remove the heaviest and lightest stones from each of these piles then the pile which has the heavier one becomes the lighter one. Determine the maximal possible value of nn.