Difference between revisions of "2022 AMC 10A Problems/Problem 14"
MRENTHUSIASM (talk | contribs) (Undo revision 183052 by Mathboy100 (talk) Perhaps Sol 2 is already a shortcut for Sol 1 ...) (Tag: Undo) |
(→Solution 3) |
||
Line 28: | Line 28: | ||
~Scarletsyc | ~Scarletsyc | ||
+ | |||
+ | ==Solution 3 (Most contrained first)== | ||
+ | |||
+ | The integers <math>x \in \{8, \dots , 14 \}</math> must each be the larger elements of a distinct pair. | ||
+ | |||
+ | Assign partners in decreasing order for <math>x \in \{7, \dots, 1\}</math>: | ||
+ | |||
+ | <math>7</math> must pair with <math>14</math>: <math>\mathbf{1} \textbf{ choice}</math>. | ||
+ | |||
+ | For <math>5 \leq x \leq 7</math>, the choices are <math>\{2x, \dots, 14\} - \{ \text{previous choices}\}</math>. As <math>x</math> decreases by 1, The minuend increases by 2 elements, and the subtrahend increases by 1 element, so the difference increases by 1, yielding <math>\mathbf{3!} \textbf{ combined choices}</math>. | ||
+ | |||
+ | After assigning a partner to <math>5</math>, there are no more constraints, so there are <math>\mathbf{4!}</math> ways to choose partners for <math>\{1,2,3,4\}</math>. | ||
+ | |||
+ | 1 \cdot <math>3! \cdot 4! = \boxed{144}</math>. | ||
+ | ~oinava | ||
== Video Solution by OmegaLearn == | == Video Solution by OmegaLearn == |
Revision as of 15:24, 14 March 2023
Contents
[hide]Problem
How many ways are there to split the integers through into pairs such that in each pair, the greater number is at least times the lesser number?
Solution 1
Clearly, the integers from through must be in different pairs, and must pair with
Note that can pair with either or From here, we consider casework:
- If pairs with then can pair with one of After that, each of does not have any restrictions. This case produces ways.
- If pairs with then can pair with one of After that, each of does not have any restrictions. This case produces ways.
Together, the answer is
~MRENTHUSIASM
Solution 2
As said above, clearly, the integers from through must be in different pairs.
We know that or can pair with any integer from to , or can pair with any integer from to , and or can pair with any integer from to . Thus, will have choices to pair with, will then have choices to pair with ( cannot pair with the same number as the one pairs with). cannot pair with the numbers and has paired with but can also now pair with , so there are choices. cannot pair with 's, 's, or 's paired numbers, so there will be choices for . can pair with an integer from to that hasn't been paired with already, or it can pair with . will only have one choice left, and must pair with .
So, the answer is
~Scarletsyc
Solution 3 (Most contrained first)
The integers must each be the larger elements of a distinct pair.
Assign partners in decreasing order for :
must pair with : .
For , the choices are . As decreases by 1, The minuend increases by 2 elements, and the subtrahend increases by 1 element, so the difference increases by 1, yielding .
After assigning a partner to , there are no more constraints, so there are ways to choose partners for .
1 \cdot . ~oinava
Video Solution by OmegaLearn
~ pi_is_3.14
See Also
2022 AMC 10A (Problems • Answer Key • Resources) | ||
Preceded by Problem 13 |
Followed by Problem 15 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
All AMC 10 Problems and Solutions |
2022 AMC 12A (Problems • Answer Key • Resources) | |
Preceded by Problem 9 |
Followed by Problem 11 |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | |
All AMC 12 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.