Skip to main content

2022 AMC 10A Problem 22

Problem 22 of 25HarderCounting & Probability

Suppose that 1313 cards numbered 1,1, 2,2, 3,3, ,\cdots, 1313 are arranged in a row. The task is to pick them up in numerically increasing order, working repeatedly from left to right. In the example below, cards 1,1, 2,2, 33 are picked up on the first pass, 44 and 55 on the second pass, 66 on the third pass, 7,7, 8,8, 9,9, 1010 on the fourth pass, and 11,11, 12,12, 1313 on the fifth pass. For how many of the 13!13! possible orderings of the cards will the 1313 cards be picked up in exactly two passes?

Answer choices

Show solution

Solution

Let nn be the number of cards picked up on the first pass, where 1n12.1 \leq n \leq 12. If we choose the spaces that the nn cards occupy, the positions of the remaining cards are determined since they must be placed in order. There are (13n)\binom{13}{n} ways to choose where the nn cards go, but if the nn cards are placed at the very beginning, then all the cards will be picked up on the first pass. Therefore, for a given nn there are (13n)1\binom{13}{n} - 1 ways to arrange the cards. Summing over 1n12,1\le n\le12, we get n=112((13n)1)=(2132)12=8178. \begin{gathered} \sum_{n=1}^{12}\left(\binom{13}{n}-1\right) \\ = (2^{13}-2)-12 \\ = 8178. \end{gathered} Thus, D is the correct answer.

More practice

Concepts: combinations · complementary counting

Problem text and solution from the LIVE past-contest archive. See also the AoPS wiki page for community solutions.