2012 AMC 10B Problems/Problem 22
Problem 22
Let (,
, ...
) be a list of the first 10 positive integers such that for each
either
or
or both appear somewhere before
in the list. How many such lists are there?
Solution 1
If we have 1 as the first number, then the only possible list is .
If we have 2 as the first number, then we have 9 ways to choose where the one goes, and the numbers ascend from the first number, 2, with the exception of the 1.
For example, , or
. There are
ways to do so.
If we use 3 as the first number, we need to choose 2 spaces to be 2 and 1, respectively. There are ways to do this.
In the same way, the total number of lists is:
By the binomial theorem, this is =
, or
Solution 2
Arrange the spaces and put arrows pointing either up or down between them. Then for each arrangement of arrows there is one and only one list that corresponds to up. For example, all arrows pointing up is . There are 9 arrows, so the answer is
=