Problem:
Find the largest possible number having the following property: if the numbers are ordered in arbitrary way then there exist 50 consecutive numbers with sum not less than .
Solution
Solution:
Let be an arbitrary rearrangement of the numbers . Set
Since , we have for at least one index .
On the other hand, if a number has the required property then we have . To see this consider the rearrangement
and take arbitrarily fifty consecutive numbers in it. If the first number is greater than , then the sum of these fifty numbers is , otherwise it is . Hence .
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.