Difference between revisions of "2006 AIME II Problems/Problem 4"
m |
m (→See also) |
||
| Line 13: | Line 13: | ||
== See also == | == See also == | ||
| − | {{AIME box|year=2006|n= | + | {{AIME box|year=2006|n=II|num-b=3|num-a=5}} |
[[Category:Intermediate Combinatorics Problems]] | [[Category:Intermediate Combinatorics Problems]] | ||
Revision as of 19:04, 25 September 2007
Problem
Let 
be a permutation of 
for which
An example of such a permutation is 
Find the number of such permutations.
Solution
Clearly, 
. Now, consider selecting 
of the remaining 
values. Sort these values in descending order, and sort the other 
values in ascending order. Now, let the selected values be 
through 
, and let the remaining be 
through 
. It is now clear that there is a bijection between the number of ways to select values from and ordered 12-tuples 
. Thus, there will be 
such ordered 12-tuples.
See also
| 2006 AIME II (Problems • Answer Key • Resources) | ||
| Preceded by Problem 3 |
Followed by Problem 5 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
| All AIME Problems and Solutions | ||
