Difference between revisions of "2004 AIME II Problems/Problem 6"
(solution) |
|||
| Line 2: | Line 2: | ||
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 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]] <math> 3: 2: 1, </math>what is the least possible total for the number of bananas? | 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 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]] <math> 3: 2: 1, </math>what is the least possible total for the number of bananas? | ||
== Solution == | == Solution == | ||
| − | Denote the number of bananas the first monkey got as <math>b_1</math>, the second <math>b_2</math>, and the third <math>b_3</math>; the total is <math> | + | Denote the number of bananas the first monkey got as <math>b_1</math>, the second <math>b_2</math>, and the third <math>b_3</math>; the total is <math>b_1 + b_2 + b_3</math>. Thus, the first monkey got <math>\frac{3}{4}b_1 + \frac{3}{8}b_2 + \frac{11}{24}b_3</math>, the second monkey got <math>\frac{1}{8}b_1 + \frac{1}{4}b_2 + \frac{11}{24}b_3</math>, and the third monkey got <math>\frac{1}{8}b_1 + \frac{3}{8}b_2 + \frac{1}{12}b_3</math>. |
Taking into account the ratio aspect, say that the third monkey took <math>x</math> bananas in total. Then, | Taking into account the ratio aspect, say that the third monkey took <math>x</math> bananas in total. Then, | ||
| Line 14: | Line 14: | ||
[[Category:Intermediate Number Theory Problems]] | [[Category:Intermediate Number Theory Problems]] | ||
| + | {{MAA Notice}} | ||
Revision as of 22:21, 4 July 2013
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 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
Denote the number of bananas the first monkey got as 
, the second 
, and the third 
; the total is 
. Thus, the first monkey got 
, the second monkey got 
, and the third monkey got 
.
Taking into account the ratio aspect, say that the third monkey took 
bananas in total. Then,
Solve this to find that 
. All three fractions must be integral. Also note some other conditions we have picked up in the course of the problem, namely that is divisible by 
, is divisible by , and is divisible by 
(however, since the denominator contains a 
, the factors of 
cancel, and it only really needs to be divisible by ). Thus, the minimal value is when each fraction is equal to , and the solution is 
.
See also
| 2004 AIME II (Problems • Answer Key • Resources) | ||
| Preceded by Problem 5 |
Followed by Problem 7 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
| All AIME Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
