2022 AMC 10A Problems/Problem 14

Revision as of 02:57, 12 November 2022 by Pi is 3.14 (talk | contribs)

Problem

How many ways are there to split the integers $1$ through $14$ into $7$ pairs such that in each pair, the greater number is at least $2$ times the lesser number?

$\textbf{(A) } 108 \qquad \textbf{(B) } 120 \qquad \textbf{(C) } 126 \qquad \textbf{(D) } 132 \qquad \textbf{(E) } 144$

Solution

Clearly, the integers from $8$ through $14$ must be in different pairs, and $7$ must pair with $14.$

Note that $6$ can pair with either $12$ or $13.$ From here, we consider casework:

  • If $6$ pairs with $12,$ then $5$ can pair with one of $10,11,13.$ After that, each of $1,2,3,4$ does not have any restrictions. This case produces $3\cdot4!=72$ ways.
  • If $6$ pairs with $13,$ then $5$ can pair with one of $10,11,12.$ After that, each of $1,2,3,4$ does not have any restrictions. This case produces $3\cdot4!=72$ ways.

Together, the answer is $72+72=\boxed{\textbf{(E) } 144}.$

~MRENTHUSIASM

Video Solution by OmegaLearn

https://youtu.be/V1jOj8ysd_w

~ pi_is_3.14

See Also

2022 AMC 10A (ProblemsAnswer KeyResources)
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 (ProblemsAnswer KeyResources)
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. AMC logo.png