Difference between revisions of "1993 AIME Problems/Problem 7"
MRENTHUSIASM (talk | contribs) m (→Solution 4 (Permutation)) |
Fuzimiao2013 (talk | contribs) (→Solution 3 (Hook Length Formula)) |
||
Line 16: | Line 16: | ||
Like Solution 1, call the six numbers selected <math>x_1 > x_2 > x_3 > x_4 > x_5 > x_6</math>. Using the Hook Length Formula, the number of valid configuration is <math>\frac{6!}{4\cdot3\cdot2\cdot3\cdot2}=5</math>. We proceed as Solution 1 does. | Like Solution 1, call the six numbers selected <math>x_1 > x_2 > x_3 > x_4 > x_5 > x_6</math>. Using the Hook Length Formula, the number of valid configuration is <math>\frac{6!}{4\cdot3\cdot2\cdot3\cdot2}=5</math>. We proceed as Solution 1 does. | ||
− | == Solution 3 ( | + | == Solution 3 (Catalan Numbers) == |
As in the preceding solutions, we let <math>x_1>x_2>x_3>x_4>x_5>x_6</math> where each <math>x_i</math> is a number selected. It is clear that when choosing whether each number must be in the set with larger dimensions (the box) or the set with smaller dimensions (the brick) there must always be at least as many numbers in the former set as the latter. We realize that this resembles Catalan numbers, where the indices of the numbers in the first set can be replaced with rising sections of a mountain, and the other indices representing falling sections of a mountain. The formula for the <math>n</math>th Catalan number (where <math>n</math> is the number of pairs of rising and falling sections) is <cmath>\frac{\binom{2n}{n}}{n+1}</cmath> | As in the preceding solutions, we let <math>x_1>x_2>x_3>x_4>x_5>x_6</math> where each <math>x_i</math> is a number selected. It is clear that when choosing whether each number must be in the set with larger dimensions (the box) or the set with smaller dimensions (the brick) there must always be at least as many numbers in the former set as the latter. We realize that this resembles Catalan numbers, where the indices of the numbers in the first set can be replaced with rising sections of a mountain, and the other indices representing falling sections of a mountain. The formula for the <math>n</math>th Catalan number (where <math>n</math> is the number of pairs of rising and falling sections) is <cmath>\frac{\binom{2n}{n}}{n+1}</cmath> | ||
Thus, there are <math>\frac{\binom{6}{3}}{4}</math> ways to pick which of <math>x_1,x_2,x_3,x_4,x_5,</math> and <math>x_6</math> are the dimensions of the box, and which are the dimensions of the brick, such that the condition is fulfilled. There are <math>\binom{6}{3}</math> total ways to choose which numbers make up the brick and box, so the probability of the condition being fulfilled is <math>\frac{\binom{6}{3}/4}{\binom{6}{3}}=\frac14\Longrightarrow \boxed{005}</math>. | Thus, there are <math>\frac{\binom{6}{3}}{4}</math> ways to pick which of <math>x_1,x_2,x_3,x_4,x_5,</math> and <math>x_6</math> are the dimensions of the box, and which are the dimensions of the brick, such that the condition is fulfilled. There are <math>\binom{6}{3}</math> total ways to choose which numbers make up the brick and box, so the probability of the condition being fulfilled is <math>\frac{\binom{6}{3}/4}{\binom{6}{3}}=\frac14\Longrightarrow \boxed{005}</math>. |
Revision as of 15:08, 6 January 2022
Contents
Problem
Three numbers, , are drawn randomly and without replacement from the set . Three other numbers, , are then drawn randomly and without replacement from the remaining set of numbers. Let be the probability that, after suitable rotation, a brick of dimensions can be enclosed in a box of dimension , with the sides of the brick parallel to the sides of the box. If is written as a fraction in lowest terms, what is the sum of the numerator and denominator?
Solution 1 (Combination)
Call the six numbers selected . Clearly, must be a dimension of the box, and must be a dimension of the brick.
- If is a dimension of the box, then any of the other three remaining dimensions will work as a dimension of the box. That gives us possibilities.
- If is not a dimension of the box but is, then both remaining dimensions will work as a dimension of the box. That gives us possibilities.
- If is a dimension of the box but aren’t, there are no possibilities (same for ).
The total number of arrangements is ; therefore, , and the answer is .
Note that the in the problem, is not used, and is cleverly bypassed in the solution, because we can call our six numbers whether they may be in some order or in some order.
Solution 2 (Hook Length Formula)
Like Solution 1, call the six numbers selected . Using the Hook Length Formula, the number of valid configuration is . We proceed as Solution 1 does.
Solution 3 (Catalan Numbers)
As in the preceding solutions, we let where each is a number selected. It is clear that when choosing whether each number must be in the set with larger dimensions (the box) or the set with smaller dimensions (the brick) there must always be at least as many numbers in the former set as the latter. We realize that this resembles Catalan numbers, where the indices of the numbers in the first set can be replaced with rising sections of a mountain, and the other indices representing falling sections of a mountain. The formula for the th Catalan number (where is the number of pairs of rising and falling sections) is Thus, there are ways to pick which of and are the dimensions of the box, and which are the dimensions of the brick, such that the condition is fulfilled. There are total ways to choose which numbers make up the brick and box, so the probability of the condition being fulfilled is .
Solution 4 (Permutation)
There is a total of possible ordered -tuples
There are possible sets We have five valid cases for the increasing order of these six elements:
Note that the 's are different from each other, as there are ways to permute them as and Similarly, the 's are different from each other, as there are ways to permute them as and
So, there is a total of valid ordered -tuples. The requested probability is from which the answer is
~MRENTHUSIASM
See also
1993 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 6 |
Followed by Problem 8 | |
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.