2024 AMC 12B Problems/Problem 16

Revision as of 11:22, 14 November 2024 by Kafuu chino (talk | contribs) (Solution)
The following problem is from both the 2024 AMC 10B #22 and 2024 AMC 12B #16, so both problems redirect to this page.

Problem 16

A group of $16$ people will be partitioned into $4$ indistinguishable $4$-person committees. Each committee will have one chairperson and one secretary. The number of different ways to make these assignments can be written as $3^{r}M$, where $r$ and $M$ are positive integers and $M$ is not divisible by $3$. What is $r$? $\textbf{(A) }5 \qquad \textbf{(B) }6 \qquad \textbf{(C) }7 \qquad \textbf{(D) }8 \qquad \textbf{(E) }9 \qquad$

Solution

Fast Solution

https://www.youtube.com/watch?v=jPTL8hf0Ur0&t=1s

Solution

There are ${16 \choose 4}$ ways to choose the first committee, ${12 \choose 4}$ ways to choose the second, ${8 \choose 4}$ for the third, and $1$ for the fourth. Since the committees are indistinguishable, we need to divide the product by $4!$. Thus the $16$ people can be grouped in \[\frac{1}{4!}{16 \choose 4}{12 \choose 4}{8 \choose 4}=\frac{16!}{(4!)^5}\] ways.

In each committee, there are $4 \cdot 3=12$ ways to choose the chairperson and secretary, so $12^4$ ways for all $4$ committees. Therefore, there are \[\frac{16!}{(4!)^5}12^4\] total possibilities.

Since $16!$ contains $6$ factors of $3$, $(4!)^5$ contains $5$, and $12^4$ contains $4$, $r=6-5+4=\boxed{\textbf{(A) }5}$.

~kafuu_chino

Video Solution 1 by Pi Academy (In Less Than 2 Mins ⚡🚀)

https://youtu.be/9ymwnHnTbDQ?feature=shared

~ Pi Academy

Video Solution by Innovative Minds

https://youtu.be/HMPHdBiaYQc

See also

2024 AMC 10B (ProblemsAnswer KeyResources)
Preceded by
Problem 21
Followed by
Problem 23
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
2024 AMC 12B (ProblemsAnswer KeyResources)
Preceded by
Problem 15
Followed by
Problem 17
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