MathDB
Sabotage of natural numbers

Source: 239 2010 S3

July 29, 2020
combinatorics

Problem Statement

Grisha wrote nn different natural numbers, the sum of which does not exceed SS. The saboteur added to each of them a number from the half-interval [0,1)[0, 1). The sabotage is successful if there exists two subsets, the sums of the numbers in which differ by no more than 11. At what minimum SS can Grisha ensure that the sabotage will definitely not be succeeded?