Difference between revisions of "1984 AIME Problems/Problem 11"
(→Solution) |
Blueballoon (talk | contribs) (→(Another way to think about Solution 1)) |
||
(35 intermediate revisions by 3 users not shown) | |||
Line 2: | Line 2: | ||
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 <math>\frac m n</math> in lowest terms be the [[probability]] that no two birch trees are next to one another. Find <math>m+n</math>. | 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 <math>\frac m n</math> in lowest terms be the [[probability]] that no two birch trees are next to one another. Find <math>m+n</math>. | ||
− | == Solution == | + | == Solution 1 == |
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.) | 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.) | ||
Line 10: | Line 10: | ||
The answer is <math>7 + 99 = \boxed{106}</math>. | The answer is <math>7 + 99 = \boxed{106}</math>. | ||
+ | |||
+ | |||
+ | == (Another way to think about Solution 1) == | ||
+ | |||
+ | So you can think of placing the <math>5</math> birch trees and the other trees with the restrictions as described above. | ||
+ | Then let's take out one tree between each pair of birch trees. So you would remove <math>4</math> trees that aren't birch. What you are left with is a unique arrangement of <math>5</math> birch trees and <math>3</math> other trees that is unrestricted. | ||
+ | Some birch trees might become adjacent after you remove <math>4</math> trees. Adding a tree between each pair of people gives a unique arrangement of <math>5</math> nonadjacent birch trees. | ||
+ | This guarantees that there are no adjacent trees. The number of unrestricted <math>7</math> tree arrangments is <math>{8\choose5} = 56</math>. Then proceed as told in Solution <math>1</math>. | ||
+ | |||
+ | ~ blueballoon | ||
== Solution 2 == | == Solution 2 == | ||
+ | |||
+ | Let <math>b</math>, <math>n</math> denote birch tree and not-birch tree, respectively. Notice that we only need <math>4</math> <math>n</math>s to separate the <math>5</math> <math>b</math>s. Specifically, | ||
+ | <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 <math>6</math> intervals beside the <math>b</math>s. | ||
+ | |||
+ | Now doing simple casework. | ||
+ | |||
+ | If all <math>3</math> <math>n</math>s are in the same interval, there are <math>6</math> ways. | ||
+ | |||
+ | If <math>2</math> of the <math>3</math> <math>n</math>s are in the same interval, there are <math>6\cdot5=30</math> ways. | ||
+ | |||
+ | If the <math>n</math>s are in <math>3</math> different intervals, there are <math>{6 \choose 3} =20</math> ways. | ||
+ | |||
+ | In total there are <math>6+30+20=56</math> ways. | ||
+ | |||
+ | There are <math>{12\choose5}=792</math> ways to distribute the birch trees among all <math>12</math> trees. | ||
+ | |||
+ | Thus the probability equals <math>\frac{56}{792}=\frac{7}{99}\Longrightarrow m+n=7+99=\boxed{106}</math>. | ||
+ | |||
+ | ~ Nafer | ||
+ | |||
+ | == Solution 3 (using PIE) == | ||
+ | |||
+ | |||
+ | Note that the requested probability is computed by dividing the number of configurations with no adjacent Birch trees by the total number of configurations. We can compute the number of configurations with no adjacent Birch trees using complementary counting and then the Principle of Inclusion-Exclusion. | ||
+ | |||
+ | The number of configurations with no adjacent Birch trees is equal to the total number of configurations minus the number of configurations with at least one pair of adjacent Birch trees. | ||
+ | |||
+ | The total number of configurations is given by <math>\frac{12!}{3! \cdot 4! \cdot 5!}</math>. To compute the number of configurations with at least one pair of adjacent Birch trees, we use PIE. | ||
+ | |||
+ | <math>\#</math>(configurations with at least one pair of adjacent Birch trees) <math>=</math> <math>\#</math>(configurations with one pair) <math>-</math> <math>\#</math>(configurations with two pairs) <math>+</math> <math>\#</math>(configurations with three pairs) <math>-</math> <math>\#</math>(configurations with four pairs). | ||
+ | |||
+ | To compute the first term, note that we can treat the adjacent pair of Birch trees as one separate tree. This then gives <math>\frac{11!}{3! \cdot 3! \cdot 4!}</math> configurations. | ||
+ | |||
+ | For the second term, we have two cases. The two pairs could either happen consecutively (BBB) or separately (BB BB). They both give <math>\frac{10!}{2! \cdot 3! \cdot 4!}</math> cases. So our second term is <math>\frac{2 \cdot 10!}{2! \cdot 3! \cdot 4!}</math>. | ||
+ | |||
+ | The third term can also happen in two ways. The three pairs could be arranged like BBBB or BBB BB. Both cases together give <math>\frac{2 \cdot 9!}{3! \cdot 4!}</math> arrangements. | ||
+ | |||
+ | The final term can happen in one way (BBBBB). This gives <math>\frac{8!}{3! \cdot 4!}</math> arrangements. | ||
+ | |||
+ | Substituting these into our PIE expression, we find that there are <math>25760</math> configurations with at least one pair of adjacent Birch trees. Therefore, there are a total of <math>\frac{12!}{3! \cdot 4! \cdot 5!} - 25760 = 1960</math> configurations with no adjacent Birch trees. | ||
+ | |||
+ | Thus, the probability of a given configuration having no two adjacent Birch trees is given by <math>\frac{1960}{\frac{12!}{3! \cdot 4! \cdot 5!}} = \frac{7}{99}</math>. | ||
+ | |||
+ | |||
+ | Therefore, the desired result is given by <math>7+99 = \boxed{106}</math>. | ||
+ | |||
+ | ~ vietajumping | ||
== See also == | == See also == |
Latest revision as of 15:02, 4 May 2021
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 1
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 .
(Another way to think about Solution 1)
So you can think of placing the birch trees and the other trees with the restrictions as described above. Then let's take out one tree between each pair of birch trees. So you would remove trees that aren't birch. What you are left with is a unique arrangement of birch trees and other trees that is unrestricted. Some birch trees might become adjacent after you remove trees. Adding a tree between each pair of people gives a unique arrangement of nonadjacent birch trees. This guarantees that there are no adjacent trees. The number of unrestricted tree arrangments is . Then proceed as told in Solution .
~ blueballoon
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 beside the s.
Now doing simple casework.
If all s are in the same interval, there are ways.
If of the s are in the same interval, there are ways.
If the s are in different intervals, there are ways.
In total there are ways.
There are ways to distribute the birch trees among all trees.
Thus the probability equals .
~ Nafer
Solution 3 (using PIE)
Note that the requested probability is computed by dividing the number of configurations with no adjacent Birch trees by the total number of configurations. We can compute the number of configurations with no adjacent Birch trees using complementary counting and then the Principle of Inclusion-Exclusion.
The number of configurations with no adjacent Birch trees is equal to the total number of configurations minus the number of configurations with at least one pair of adjacent Birch trees.
The total number of configurations is given by . To compute the number of configurations with at least one pair of adjacent Birch trees, we use PIE.
(configurations with at least one pair of adjacent Birch trees) (configurations with one pair) (configurations with two pairs) (configurations with three pairs) (configurations with four pairs).
To compute the first term, note that we can treat the adjacent pair of Birch trees as one separate tree. This then gives configurations.
For the second term, we have two cases. The two pairs could either happen consecutively (BBB) or separately (BB BB). They both give cases. So our second term is .
The third term can also happen in two ways. The three pairs could be arranged like BBBB or BBB BB. Both cases together give arrangements.
The final term can happen in one way (BBBBB). This gives arrangements.
Substituting these into our PIE expression, we find that there are configurations with at least one pair of adjacent Birch trees. Therefore, there are a total of configurations with no adjacent Birch trees.
Thus, the probability of a given configuration having no two adjacent Birch trees is given by .
Therefore, the desired result is given by .
~ vietajumping
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 |