2021 AMC 10A Problems/Problem 20

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 1 (Enumeration)

We write out the cases, then filter out the valid ones:

We count these out and get permutations that work.

~contactbibliophile

Solution 2 (Enumeration by Symmetry)

By symmetry with respect to note that is a valid sequence if and only if is a valid sequence. We enumerate the valid sequences that start with or as shown below:

There are valid sequences that start with or By symmetry, there are valid sequences that start with or So, the answer is

~MRENTHUSIASM (inspired by Snowfan)

Solution 3 (Casework on the Consecutive Digits)

Reading the terms from left to right, we have two cases for the consecutive digits, where means increase and means decrease:

For note that for the second and fourth terms, one term must be and the other term must be either or We have four subcases:

For the first two blanks must be and in some order, and the last blank must be So, we get possibilities. Similarly, also has possibilities.

For there are no restrictions for the numbers and So, we get possibilities. Similarly, also has possibilities.

Together, has possibilities. By symmetry, also has possibilities.

Finally, the answer is

Remark

This problem is somewhat similar to 2004 AIME I Problem 6.

~MRENTHUSIASM

Solution 4 (Casework Similar to Solution 3)

Like Solution 3, we have two cases. Due to symmetry, we just need to count one of the cases. For the purpose of this solution, we will be doing . Instead of starting with 5, we start with 1.

There are two ways to place it:

_1_ _ _

_ _ _1_

Now we place 2, it can either be next to 1 and on the outside, or is place in where 1 would go in the other case. So now we have another two "sub case":

_1_2_(case 1)

21_ _ _(case 2)

There are 3! ways to arrange the rest for case 1, since there is no restriction.

For case 2, we need to consider how many ways to arrange 3,4,5 in a a>b<c fashion. It should seem pretty obvious that b has to be 3, so there will be 2! way to put 4 and 5.

Now we find our result, times 2 for symmetry, times 2 for placement of 1 and times (3!+2!) for the two different cases for placement of 2. This give us .

~~Xhte

Solution 5 (Casework on the Position of 5)

We only need to find the # of rearrangements when 5 is the 4th digit and 5th digit. Find the total, and multiply by 2. Then we can get the answer by adding the case when 5 is the third digit.

Case : 5 is the 5th digit. __ __ __ __ 5

Then can only be either 1st digit or the 3rd digit.

4 __ __ __ 5, then the only way is that is the 3rd digit, so it can be either or , give us results.

__ __ 4 __ 5, then the 1st digit must be or , gives us way, and gives us ways. (Can't be because the first digit would increasing). Therefore, in the middle and in the last would result in ways.

Case : is the fourth digit. __ __ __ 5 __

Then the last digit can be all of the 4 numbers , , , and . Let's say if the last digit is , then the 2nd digit would be the largest for the remaining digits to prevent increasing order or decreasing order. Then the remaining two are interchangeable, give us ways. All of the can work, so case would result in ways.

Case : is in the middle. __ __ 5 __ __

Then there are only two cases: 1. , then 4 and 3 are interchangeable, which results in . Or it can be , then 4 and 2 are interchangeable, but it can not be , so there can only be 2 possible ways: , .

Therefore, case 3 would result in ways.

, so the total ways for case 1 and case 2 with both increasing and decreasing would be

Finally, we have

~Michael595

Solution 6 (Overcounting)

First, we list the triples that are invalid:

543, 542, 541, 532, 531, 521, 432, 431, 321

By symmetry, there are the same amount of increasing triplets as there are decreasing ones. This yields 18 invalid 3 digit permutations in total.

Suppose the triplet is ABC and the other 2 digits are X and Y. We then have 3 ways to arrange a triplet with 2 other digits.

ABCXY, XABCY, XYABC

X and Y can be arranged 2 ways.

XY, YX

This produces 18*3*2=108 permutations of invalid results. We have 5! ways to arrange 5 numbers so 120-108=12.

Now, we must account for overcounting. For example, when 543 is counted, it only registers as one invalid permutation but in fact, it is 3 whole invalid permutations. We then complete this for the rest of the list:

54321 has 543, 432, and 321

54213 has 542 and 421

54123 has 541 and 123

53214 has 532 and 321

53124 has 531 and 124

52134 has 521 and 134

43215 has 432 and 321

43125 has 431 and 125

32145 has 321 and 145

This produces 19 values that we have overcounted but this value itself is also overcounted. We already counted 9 of the terms. This brings the final value of overcounted terms down to 10 for the decreasing triplets. By symmetry, 10 increasing triplets were overcounted.

This gives us

~ Lukiebear

Solution 7 (Using a Table)

It is easier to consider the complement of the desired cases, so try to find the cases that DO have three integers in increasing order. First, write down the sets of three numbers that feature the numbers in increasing order. They are . Each of these can be in three positions: the three are in the front with two more numbers in the back, the three are in the middle with two on each side, and two in the front and the set of three in the back. Now, count the number of combinations of numbers that each of the set of three can form that have not been previously accounted for. Also, if the set features both increasing and decreasing, then do not count it because we will separately count them.

This gives us a total of possibilities. These account for the possibilities with ONLY increasing numbers. Mirror over to the other side to get the set of combinations with either at least set of increasing numbers in a row or only at least set of decreasing numbers, but not both. We can count the ones with both separately. . Total of .

. This is the compliment. There are a total of . .

Thus, the answer is .

~Evan Liu ~Marshall_Huang (changes to LaTex and one spelling error)

Solution 8 (Symmetry)

First, note that there is a symmetry from to as follows: . Now, consider the placement of 5 in the case. Clearly, 5 is the maximum value, so it must be placed in the 2nd position or the 4th position, but we also have symmetry . We will find the number of sequences with 5 in the second position by using casework on the position of the 4.

Case 1:

4 5 __ __ __: 3 is the maximum value, so it must go into the 4th position, leaving us 2 ways to fill in 1 and 2.

Case 2:

__ 5 __ 4 __: 1, 2, and 3 are all less than 4 or 5, so they can be filled in any manner: 3! = 6.

Overall, we have 8 ways to fill in the sequences. By our two types of symmetry, there are .

~alligator112

Solution 9 (PIE-NO casework)

We use complementary counting.

Let be the set of all permutations of in which there exists at least one set of three consecutive increasing terms, and let be the set of all permutations of in which there exists at least one set of three consecutive decreasing terms. The complement is .

First, we calculate . Let be the set of permutations in which is increasing for . We have

Since there are ways to pick (there's only one way to arrange them in increasing order) and ways to order , By symmetry, we find .

Since we require and there are ways to pick the numbers (again, only one way to arrange them in increasing order), By symmetry, .

Notice that since both translate to , so we get By symmetry, , and it remains to compute .

We have two cases, either or (it is easy to verify that these are the only ones that work). WLOG consider the first. We must have since it's the largest, and for every choice of , there is exactly one way to arrange them in order and to choose/arrange . So, there are ways to pick . Multiplying by 2 gives

Since there are permutations in total, the answer is .

~bomberdoodles

Video Solution by OmegaLearn (Using PIE - Principle of Inclusion Exclusion)

https://youtu.be/Fqak5BArpdc

~ pi_is_3.14

Video Solution by Power of Logic (Using Idea of Symmetrically Counting)

https://youtu.be/ZLQ8KYtai_M

Video Solution by TheBeautyofMath

https://youtu.be/UZZoSYHBJlI

~IceMatrix

See Also

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.