Difference between revisions of "2021 AMC 10A Problems/Problem 20"
(→Solution (bashing)) |
Pi is 3.14 (talk | contribs) (→Solution (bashing)) |
||
Line 10: | Line 10: | ||
43512,45132,45231,51324,51423,52314,52413,53412. \linebreak</math> | 43512,45132,45231,51324,51423,52314,52413,53412. \linebreak</math> | ||
We count these out and get <math>\boxed{\text{D: }32}</math> permutations that work. ~contactbibliophile | We count these out and get <math>\boxed{\text{D: }32}</math> permutations that work. ~contactbibliophile | ||
+ | |||
+ | |||
+ | == Video Solution by OmegaLearn (Using PIE - Principal of Inclusion Exclusion) == | ||
+ | https://youtu.be/Fqak5BArpdc | ||
+ | |||
+ | ~ pi_is_3.14 |
Revision as of 22:02, 11 February 2021
Problem
In how many ways can the sequence be rearranged so that no three consecutive terms are increasing and no three consecutive terms are decreasing?
Solution (bashing)
We write out the cases. These cases are the ones that work: We count these out and get permutations that work. ~contactbibliophile
Video Solution by OmegaLearn (Using PIE - Principal of Inclusion Exclusion)
~ pi_is_3.14