MathDB
2019 Saint Petersburg Grade 11 P5

Source: Saint Petersburg 2019

April 14, 2019
combinatoricsnumber theory

Problem Statement

Baron Munchhausen has a collection of stones, such that they are of 10001000 distinct whole weights, 210002^{1000} stones of every weight. Baron states that if one takes exactly one stone of every weight, then the weight of all these 10001000 stones chosen will be less than 210102^{1010}, and there is no other way to obtain this weight by picking another set of stones of the collection. Can this statement happen to be true?
(М. Антипов)
Thanks to the user Vlados021 for translating the problem.