2015 AIME II Problems/Problem 10

Revision as of 21:39, 9 March 2017 by Wzhu1234 (talk | contribs) (n=2 not n=1)

Problem

Call a permutation $a_1, a_2, \ldots, a_n$ of the integers $1, 2, \ldots, n$ quasi-increasing if $a_k \leq a_{k+1} + 2$ for each $1 \leq k \leq n-1$. For example, 53421 and 14253 are quasi-increasing permutations of the integers $1, 2, 3, 4, 5$, but 45123 is not. Find the number of quasi-increasing permutations of the integers $1, 2, \ldots, 7$.

Solution

The simple recurrence can be found.

When inserting an integer $n$ into a string with $n - 1$ integers, we notice that the integer $n$ has 3 spots where it can go: before $n - 1$, before $n - 2$, and at the very end.

EXAMPLE: Putting 4 into the string 123: 4 can go before the 2: 1423, Before the 3: 1243, And at the very end: 1234.

Thus the number of permutations with n elements is three times the number of permutations with $n-1$ elements.

However, for $n=1$, there's an exception: there's only 2 places the 2 can go (before or after the 1).

For $n=2$, there are $2$ permutations. Thus for $n=7$ there are $2*3^5=\boxed{486}$ permutations.

See also

2015 AIME II (ProblemsAnswer KeyResources)
Preceded by
Problem 9
Followed by
Problem 11
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
All AIME Problems and Solutions

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