Skip to main content

2022 AMC 12A Problem 24

Problem 24 of 25HarderCounting & Probability

How many strings of length 55 formed from the digits 0,0, 1,1, 2,2, 3,3, 44 are there such that for each j{1,2,3,4},j\in\{1,2,3,4\}, at least jj of the digits are less than j?j? (For example, 0221402214 satisfies the condition because it contains at least 11 digit less than 1,1, at least 22 digits less than 2,2, at least 33 digits less than 3,3, and at least 44 digits less than 4.4. The string 2340423404 does not satisfy the condition because it does not contain at least 22 digits less than 2.2.)

Answer choices

Show solution

Solution

Sort the five digits as d(1)d(2)d(5).d_{(1)}\le d_{(2)}\le\cdots\le d_{(5)}. The requirement “at least jj digits less than jj” is equivalent to d(j)j1d_{(j)}\le j-1 for j=1,2,3,4,j=1,2,3,4, i.e. d(1)=0, d(2)1,d_{(1)}=0,\ d_{(2)}\le1,  d(3)2, d(4)3\ d_{(3)}\le2,\ d_{(4)}\le3 (with d(5)4d_{(5)}\le4 automatic). These strings are exactly the parking functions of length 5.5. To count them, arrange 66 parking spaces in a circle and let 55 labeled cars choose arbitrary preferred spaces. Each car moves forward to the first open space. Among the 656^5 preference strings, rotating all preferences cycles the unique empty space through all 66 positions. Therefore exactly 656=64=1296\frac{6^5}{6}=6^4=1296 strings leave a specified space empty. Choosing that space as the extra sixth space gives precisely the sorted inequalities above. Thus, the correct answer is E.

More practice

Concepts: arrangements with restrictions · casework

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