Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2015 AIME II Problems/Problem 10"

(→‎Solution)
(→‎Solution)
 
(13 intermediate revisions by 8 users not shown)
Line 7: Line 7:
 
The simple recurrence can be found.
 
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.
+
When inserting an integer <math>n</math> into a string with <math>n - 1</math> integers, we notice that the integer <math>n</math> has 3 spots where it can go: before <math>n - 1</math>, before <math>n - 2</math>, and at the very end.
  
−
EXAMPLE:
+
Ex. Inserting 4 into the string 123:
−
putting 4 into the string 123:
+
4 can go before the 2 (1423), before the 3 (1243), and at the very end (1234).
−
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.  
+
Only the addition of the next number, <math>n</math>, will change anything.
  
−
For n=3, there are 6 permutations. Thus for n=7 there are 6*3^4 = 486 permutations.
+
Thus the number of permutations with <math>n</math> elements is three times the number of permutations with <math>n-1</math> elements.
 +
 
 +
Start with <math>n=3</math> since all <math>6</math> permutations work. And go up: <math>18, 54, 162, 486</math>.
 +
 
 +
Thus for <math>n=7</math> there are <math>2*3^5=\boxed{486}</math> permutations.
 +
 
 +
When you are faced with a brain-fazing equation and combinatorics is part of the problem, use recursion! This same idea appeared on another AIME with an 8-box problem.
 +
 
 +
==See also==
 +
* [http://www.artofproblemsolving.com/wiki/index.php?title=2006_AIME_I_Problems/Problem_11 2006 AIME I Problem 11]
 +
{{AIME box|year=2015|n=II|num-b=9|num-a=11}}
 +
{{MAA Notice}}
 +
 
 +
[[Category: Intermediate Combinatorics Problems]]

Latest revision as of 11:15, 25 June 2024

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.

Ex. Inserting 4 into the string 123: 4 can go before the 2 (1423), before the 3 (1243), and at the very end (1234).

Only the addition of the next number, $n$, will change anything.

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

Start with $n=3$ since all $6$ permutations work. And go up: $18, 54, 162, 486$.

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

When you are faced with a brain-fazing equation and combinatorics is part of the problem, use recursion! This same idea appeared on another AIME with an 8-box problem.

See also

2015 AIME II (Problems • Answer Key • Resources)
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

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2015_AIME_II_Problems/Problem_10&oldid=221098"