Difference between revisions of "1984 AIME Problems/Problem 11"
(→Solution 2) |
(→Solution 2) |
||
Line 16: | Line 16: | ||
<cmath>b,n,b,n,b,n,b,n,b</cmath> | <cmath>b,n,b,n,b,n,b,n,b</cmath> | ||
Since we have <math>7</math> <math>n</math>s, we are placing the extra <math>3</math> <math>n</math>s into the intervals | Since we have <math>7</math> <math>n</math>s, we are placing the extra <math>3</math> <math>n</math>s into the intervals | ||
− | <cmath> | + | <cmath>\cup b \cup b \cup b \cup b \cup b \cup</cmath> |
== See also == | == See also == |
Revision as of 18:31, 19 August 2019
Contents
Problem
A gardener plants three maple trees, four oaks, and five birch trees in a row. He plants them in random order, each arrangement being equally likely. Let in lowest terms be the probability that no two birch trees are next to one another. Find .
Solution
First notice that there is no difference between the maple trees and the oak trees; we have only two types, birch trees and "non-birch" trees. (If you don't believe this reasoning, think about it. You could also differentiate the tall oak trees from the short oak trees, and the maple trees with many branches as opposed to those with few branches. Indeed, you could keep dividing until you have them each in their own category, but in the end it will not change the probability of the birch trees being near each other. That is, in the end, you multiply the numerator by the number of ways to arrange the oak and maple trees and you also multiply the denominator by the number of ways to arrange the oak and maple trees, making them cancel out.)
The five birch trees must be placed amongst the seven previous trees. We can think of these trees as 5 dividers of 8 slots that the birch trees can go in, making different ways to arrange this.
There are total ways to arrange the twelve trees, so the probability is .
The answer is .
Solution 2
Let , denote birch tree and not-birch tree, respectively. Notice that we only need s to separate the s. Specifically, Since we have s, we are placing the extra s into the intervals
See also
1984 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 10 |
Followed by Problem 12 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |