AIME 2013 II · 第 7 题
AIME 2013 II — Problem 7
题目详情
Problem 7
A group of clerks is assigned the task of sorting files. Each clerk sorts at a constant rate of files per hour. At the end of the first hour, some of the clerks are reassigned to another task; at the end of the second hour, the same number of the remaining clerks are also reassigned to another task, and a similar assignment occurs at the end of the third hour. The group finishes the sorting in hours and minutes. Find the number of files sorted during the first one and a half hours of sorting.
解析
Solution
There are clerks at the beginning, and clerks are reassigned to another task at the end of each hour. So, , and simplify that we get . Now the problem is to find a reasonable integer solution. Now we know , so divides , AND as long as is a integer, must divide . Now, we suppose that , similarly we get , and so in order to get a minimum integer solution for , it is obvious that works. So we get and . One and a half hour's work should be , so the answer is .
Solution 2
We start with the same approach as solution 1 to get . Then notice that , or , giving the smallest solution at . We find that . Then the number of files they sorted will be
Solution 3 (More rigorous explanation)
From solution one, we can obtain where is the number of clerks at the beginning and is the amount of clerks removed at the end of each hour. Since the number of clerks removed must be less than the amount of clerks at the beginning, we can form the inequality . From here, we can replace with and form the inequality . This means that or . We can rewrite our equation at the beginning to become . Because and , we can figure out that the minimum value of will be 3 as . From here, we can find and solve that the number of files the clerks sorted in the first 1 hour and 30 minutes is . If we increase by , we will have to increase by which results in being , thus breaking our inequality of . Therefore, the only solutions for x and t where both are integers are 22 and 3, respectively.