2022 AMC 10A Problem 22

Attempt Problem 22 of the 2022 AMC 10A below, then check your answer against the professionally curated solution from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2022 AMC 10A solutions, or check the answer key.

All problems are used with official legal permission of the Mathematical Association of America (MAA).

22.

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?
40824082
40954095
40964096
81788178
81918191
Answer: D
Concepts:combinationscomplementary counting
Small hint:
The cards picked up on the first pass must occupy an increasing subsequence
Big hint:
Choose the positions of the first-pass cards and exclude one-pass arrangements
Solution:
Let nn be the number of cards picked up on the first pass, where 1≤n≤12.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 1≤n≤12,1\le n\le12, we get ∑n=112((13n)−1)=(213−2)−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.
LIVE by Po-Shen Loh
Programs

LIVE Classes

Self-Paced Classes

Stars

Scholarship

About Us

Who Is Po-Shen Loh?

Email Contact

Newsletter

Jobs

Become a Star

For a more Thought Full world.

© 2026 Expii, Inc.