AIME 2004 II · 第 6 题
AIME 2004 II — Problem 6
题目详情
Problem
Three clever monkeys divide a pile of bananas. The first monkey takes some bananas from the pile, keeps three-fourths of them, and divides the rest equally between the other two. The second monkey takes some bananas from the pile, keeps one-fourth of them, and divides the rest equally between the other two. The third monkey takes the remaining bananas from the pile, keeps one-twelfth of them, and divides the rest equally between the other two. Given that the pile starts out with a positive number of bananas, each monkey receives a whole number of bananas whenever the bananas are divided, and the numbers of bananas the first, second, and third monkeys have at the end of the process are in the ratio : : , what is the least possible total for the number of bananas?
解析
Solution 1
In this solution, you start out the same as solution one. Convert everything into the fractions of largest denominator terms (this is necessary) until you get
While solving, and make sure to leave a list of numbers that must divide , , and . For example, just by looking at the basic fractions you receive from writing the starting equations, 24 divides , 8 divides and . In the expression above, it's also clear that 27 divides , 13 divides , and 11 divides . You might be wondering why I wrote the expression in terms of z. That's because has the largest divisor. The LCM of all it's divisors shows that must be divisible by 216. The total amount of bananas can be found to equal to . This means there are two possible solutions under 1000: 408 and 816. Trial and error can be done quickly to find the smallest possible solution to be .
-jackshi2006
Solution 2 (A lot of Thinking Required dEfInItELy )
Let be the fraction of bananas taken by the first, second, and third monkeys respectively. Then we have the system of equations
Solve this your favorite way to get that
We need the amount taken by the first and second monkeys to be divisible by 8 and the third by 24 (but for the third, we already have divisibility by 9). Thus our minimum is
~Dhillonr25