Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
The numbers are written round a circle in any order, like a clock face that has been mixed up. A block is four numbers that are next to each other on the circle, so there are blocks.
Find the sum of all twelve block sums and the average block sum. The averaging principle then promises a block with a sum of at least that average. Go one step further: prove that some block has a sum of at least . Think about what would happen if every block sum were exactly the average.
objects in boxes put at least in some box. To force objects into one of boxes you need . Some number in a list is at least the average.
Check an answer or open a hint to unlock the worked solution.
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Given. The numbers to in some order round a circle. Block is , with positions counted round the circle.
Step 1. Sum of the block sums. Each number lies in four blocks, so the total is .
Step 2. The average. . So some block has a sum of at least .
Step 3. Could every block be ? Suppose no block exceeds . The average is , so then every block equals . Subtract block from block : . So , but the numbers are all different. This is a contradiction.
Step 4. Conclusion. Some block exceeds . A block sum is a whole number, so it is at least .
Watch out. The average alone gives only . The extra step uses the fact that the numbers are different.
Answer: the block sums add to , their average is , and some block always reaches . Proof complete.
Log in to join the discussion.
Loading…