Problem:
Chris the squirrel has rooms in his cavern for storing food. The first room contains nut, the second room contains nuts, the third room contains nuts, and so on, with the th room containing nuts. Starting from today, Chris will collect additional nuts each day and store them one per room in distinct rooms in his cavern. His goal is to have all the rooms contain the same number of nuts once he is finished. What is the minimum number of days required to accomplish this goal?
Answer Choices:
A.
B.
C.
D.
E.
Solution:
Suppose Chris finishes after days with nuts in every room. Each day he skips exactly rooms; let be the number of days on which room is skipped. Then room receives nuts, and
Necessary conditions.
For to be an integer we need , i.e. , i.e. , which means .
The smallest with is , which gives .
Construction for . We need , so room is skipped times, for a total of skips. Write the skips in a list of length : room nineteen times, then room eighteen times, and so on, down to room once. On day (), skip the rooms in positions and of the list. Since each room occupies a block of at most consecutive positions, the two rooms skipped on any day are different. So every day Chris skips exactly distinct rooms, and every room ends with nuts.
Therefore the minimum number of days is .
The problems and solutions on this page are the property of the MAA's American Mathematics Competitions