Difference between revisions of "2022 AMC 12A Problems/Problem 24"
(→Solution using Parking Functions) |
Sugar rush (talk | contribs) |
||
Line 116: | Line 116: | ||
{{AMC12 box|year=2022|ab=A|num-b=23|num-a=25}} | {{AMC12 box|year=2022|ab=A|num-b=23|num-a=25}} | ||
+ | [[Category:Intermediate Combinatorics Problems]] | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 16:11, 15 November 2022
Contents
[hide]Problem
How many strings of length formed from the digits , , , , are there such that for each , at least of the digits are less than ? (For example, satisfies this condition because it contains at least digit less than , at least digits less than , at least digits less than , and at least digits less than . The string does not satisfy the condition because it does not contain at least digits less than .)
Solution (Recursive equations approach)
Denote by the number of -digit strings formed by using numbers , where for each , at least of the digits are less than .
We have the following recursive equation: and the boundary condition for any .
By solving this recursive equation, for and , we get
For and , we get
For and , we get
For and , we get
~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)
Solution 2 (Cheese)
Let the set of all valid sequences be . Notice that for any sequence in , the sequences must also belong in . However, one must consider the edge case all 5 elements are the same (only ), in which case all sequences listed are equivalent. Then , which yields by inspection.
~Tau
Solution using Parking Functions
For some , let there be parking spaces counterclockwise in a circle. Consider a string of integers each between and , and let cars come into this circle so that the th car tries to park at spot , but if it is already taken then it instead keeps going counterclockwise and takes the next avaliable spot. After this process, exactly one spot will remain empty.
Then the strings of numbers between and that contain at least integers for are exactly the set of strings that leave spot empty. Also note for any string , we can add to each (mod ) to shift the empty spot counterclockwise, meaning for each string there exists exactly one with so that leaves spot empty. This gives there are such strings.
Plugging in gives such strings.
~ oh54321
Video Solution
~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)
Video Solution By OmegaLearn using Complementary Counting
~ pi_is_3.14
See Also
2022 AMC 10A (Problems • Answer Key • Resources) | ||
Preceded by Problem 23 |
Followed by Problem 25 | |
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 (Problems • Answer Key • Resources) | |
Preceded by Problem 23 |
Followed by Problem 25 |
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.