Difference between revisions of "2004 AIME II Problems/Problem 6"
(→Solution 2) |
Jackshi2006 (talk | contribs) (→Solution 2) |
||
Line 36: | Line 36: | ||
-AlexLikeMath | -AlexLikeMath | ||
+ | |||
+ | ==Solution 3== | ||
+ | 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 | ||
+ | |||
+ | <math>27x=11z</math> | ||
+ | <math>27y=13z</math> | ||
+ | |||
+ | While solving, make sure to leave a list of numbers that must divide <math>x</math>, <math>y</math>, and <math>z</math>. For example, just by looking at the basic fractions you receive from writing the starting equations, 24 divides <math>z</math>, 8 divides <math>y</math> and <math>x</math>. In the expression above, it's also clear that 27 divides <math>z</math>, 13 divides <math>y</math>, and 11 divides <math>z</math>. You might be wondering why I wrote the expression in terms of z. That's because <math>z</math> has the largest divisor. The LCM of all it's divisors shows that <math>z</math> must be divisible by 216. The total amount of peanuts can be found to equal to <math>17z/9</math>. 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 <math>\boxed{408}</math>. | ||
+ | |||
+ | |||
+ | -jackshi2006 | ||
== See also == | == See also == |
Latest revision as of 19:55, 18 November 2020
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 took from the pile 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 .
Solution 2
Let the first monkey take bananas, the second monkey take , and the third monkey take . I chose these numbers to make it so, when each monkey splits his bananas, they will get an integer amount of each variable. So, when the first monkey distributes his bananas, he gets , and the other monkeys get . So, we can make expressions for how many bananas each monkey gets. Also, the variables have to be integers too.
Monkey 1:
Monkey 2:
Monkey 3:
So, they are in a ratio . But, we can turn it into an equation by multiplying the amount of bananas each monkey has by 2, 3, 6. Now, the ratio is , so, . Subtracting from all, we get . Let's split this into 3 equations.
Let's look at the first equation. Rearranging, it gets us
We can rearrange the third equation, then divide by 2, then subtract the second equation. .
It is clear is a multiple of 9, so let . Then we get the , and . Testing, we confirm this will get the first monkey 204 bananas, the second 136, and the third, 68. Adding them up, we get that there were bananas originally in the pile.
-AlexLikeMath
Solution 3
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, 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 peanuts 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
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.