Difference between revisions of "2022 AMC 10A Problems/Problem 14"
(→Solution 3) |
MRENTHUSIASM (talk | contribs) (→Solution 1 (Multiplication Principle)) |
||
(34 intermediate revisions by 14 users not shown) | |||
Line 1: | Line 1: | ||
+ | {{duplicate|[[2022 AMC 10A Problems/Problem 14|2022 AMC 10A #14]] and [[2022 AMC 12A Problems/Problem 10|2022 AMC 12A #10]]}} | ||
+ | |||
==Problem== | ==Problem== | ||
Line 5: | Line 7: | ||
<math>\textbf{(A) } 108 \qquad \textbf{(B) } 120 \qquad \textbf{(C) } 126 \qquad \textbf{(D) } 132 \qquad \textbf{(E) } 144</math> | <math>\textbf{(A) } 108 \qquad \textbf{(B) } 120 \qquad \textbf{(C) } 126 \qquad \textbf{(D) } 132 \qquad \textbf{(E) } 144</math> | ||
− | ==Solution 1== | + | ==Solution 1 (Multiplication Principle)== |
− | Clearly, the integers from <math>8</math> through <math>14</math> must be in different pairs, | + | Clearly, the integers from <math>8</math> through <math>14</math> must be in different pairs, so are the integers from <math>1</math> through <math>7.</math> Note that <math>7</math> must pair with <math>14.</math> |
− | + | We pair the numbers <math>1,2,3,4,5,6</math> with the numbers <math>8,9,10,11,12,13</math> systematically: | |
− | * | + | * <math>6</math> can pair with either <math>12</math> or <math>13.</math> |
− | * | + | * <math>5</math> can pair with any of the three remaining numbers from <math>10,11,12,13.</math> |
− | Together, the answer is <math> | + | * <math>1,2,3,4</math> can pair with the other four remaining numbers from <math>8,9,10,11,12,13</math> without restrictions. |
+ | |||
+ | Together, the answer is <math>2\cdot3\cdot4!=\boxed{\textbf{(E) } 144}.</math> | ||
~MRENTHUSIASM | ~MRENTHUSIASM | ||
− | ==Solution 2== | + | ==Solution 2 (Multiplication Principle)== |
− | As said | + | As said in Solution 1, clearly, the integers from <math>8</math> through <math>14</math> must be in different pairs. |
We know that <math>8</math> or <math>9</math> can pair with any integer from <math>1</math> to <math>4</math>, <math>10</math> or <math>11</math> can pair with any integer from <math>1</math> to <math>5</math>, and <math>12</math> or <math>13</math> can pair with any integer from <math>1</math> to <math>6</math>. Thus, <math>8</math> will have <math>4</math> choices to pair with, <math>9</math> will then have <math>3</math> choices to pair with (<math>9</math> cannot pair with the same number as the one <math>8</math> pairs with). <math>10</math> cannot pair with the numbers <math>8</math> and <math>9</math> has paired with but can also now pair with <math>5</math>, so there are <math>3</math> choices. <math>11</math> cannot pair with <math>8</math>'s, <math>9</math>'s, or <math>10</math>'s paired numbers, so there will be <math>2</math> choices for <math>11</math>. <math>12</math> can pair with an integer from <math>1</math> to <math>5</math> that hasn't been paired with already, or it can pair with <math>6</math>. <math>13</math> will only have one choice left, and <math>7</math> must pair with <math>14</math>. | We know that <math>8</math> or <math>9</math> can pair with any integer from <math>1</math> to <math>4</math>, <math>10</math> or <math>11</math> can pair with any integer from <math>1</math> to <math>5</math>, and <math>12</math> or <math>13</math> can pair with any integer from <math>1</math> to <math>6</math>. Thus, <math>8</math> will have <math>4</math> choices to pair with, <math>9</math> will then have <math>3</math> choices to pair with (<math>9</math> cannot pair with the same number as the one <math>8</math> pairs with). <math>10</math> cannot pair with the numbers <math>8</math> and <math>9</math> has paired with but can also now pair with <math>5</math>, so there are <math>3</math> choices. <math>11</math> cannot pair with <math>8</math>'s, <math>9</math>'s, or <math>10</math>'s paired numbers, so there will be <math>2</math> choices for <math>11</math>. <math>12</math> can pair with an integer from <math>1</math> to <math>5</math> that hasn't been paired with already, or it can pair with <math>6</math>. <math>13</math> will only have one choice left, and <math>7</math> must pair with <math>14</math>. | ||
Line 29: | Line 33: | ||
~Scarletsyc | ~Scarletsyc | ||
− | ==Solution 3 ( | + | ==Solution 3 (Generalization)== |
− | The integers <math>x \in \{8, \ | + | The integers <math>x \in \{8, \ldots , 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>: | 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>. | + | Note that <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>. | 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 | + | After assigning a partner to <math>5</math>, there are no invalid pairings for yet-unpaired numbers, so there are <math>\mathbf{4!} \textbf{ ways}</math> to choose partners for <math>\{1,2,3,4\}</math>. |
+ | |||
+ | The answer is <math>3! \cdot 4! = \boxed{\textbf{(E) } 144}</math>. | ||
+ | |||
+ | In general, for <math>1,\ldots,2n</math>, the same logic yields answer: <math>\left\lfloor\dfrac{n}{2}\right\rfloor! \cdot \left\lceil\dfrac{n}{2}\right\rceil!</math> | ||
− | |||
~oinava | ~oinava | ||
− | == Video Solution by | + | ==Video Solution by Education, the Study of Everything== |
+ | https://youtu.be/k6EUl65wS9Q | ||
+ | |||
+ | == Video Solution by Sohil Rathi== | ||
https://youtu.be/V1jOj8ysd_w | https://youtu.be/V1jOj8ysd_w | ||
~ pi_is_3.14 | ~ pi_is_3.14 | ||
+ | |||
+ | ==Video Solution (Smart and Simple)== | ||
+ | https://youtu.be/7yAh4MtJ8a8?si=jyIdy-jZb2raj3cM&t=1800 | ||
+ | |||
+ | ~Math-X | ||
+ | |||
+ | ==Video Solution (RMM club)== | ||
+ | https://youtu.be/DwCE1wu5hrA | ||
+ | |||
+ | == Video Solution by Lucas637 (Fast and Easy) == | ||
+ | https://www.youtube.com/watch?v=egQK11g54mA | ||
+ | ==Video Solution by TheBeautyofMath== | ||
+ | https://youtu.be/0kkc4-y8TkU?t=1367 | ||
+ | |||
+ | ~IceMatrix | ||
== See Also == | == See Also == |
Latest revision as of 23:52, 23 October 2024
- The following problem is from both the 2022 AMC 10A #14 and 2022 AMC 12A #10, so both problems redirect to this page.
Contents
- 1 Problem
- 2 Solution 1 (Multiplication Principle)
- 3 Solution 2 (Multiplication Principle)
- 4 Solution 3 (Generalization)
- 5 Video Solution by Education, the Study of Everything
- 6 Video Solution by Sohil Rathi
- 7 Video Solution (Smart and Simple)
- 8 Video Solution (RMM club)
- 9 Video Solution by Lucas637 (Fast and Easy)
- 10 Video Solution by TheBeautyofMath
- 11 See Also
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 (Multiplication Principle)
Clearly, the integers from through must be in different pairs, so are the integers from through Note that must pair with
We pair the numbers with the numbers systematically:
- can pair with either or
- can pair with any of the three remaining numbers from
- can pair with the other four remaining numbers from without restrictions.
Together, the answer is
~MRENTHUSIASM
Solution 2 (Multiplication Principle)
As said in Solution 1, 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 (Generalization)
The integers must each be the larger elements of a distinct pair.
Assign partners in decreasing order for :
Note that 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 invalid pairings for yet-unpaired numbers, so there are to choose partners for .
The answer is .
In general, for , the same logic yields answer:
~oinava
Video Solution by Education, the Study of Everything
Video Solution by Sohil Rathi
~ pi_is_3.14
Video Solution (Smart and Simple)
https://youtu.be/7yAh4MtJ8a8?si=jyIdy-jZb2raj3cM&t=1800
~Math-X
Video Solution (RMM club)
Video Solution by Lucas637 (Fast and Easy)
https://www.youtube.com/watch?v=egQK11g54mA
Video Solution by TheBeautyofMath
https://youtu.be/0kkc4-y8TkU?t=1367
~IceMatrix
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.