Difference between revisions of "2006 AIME II Problems/Problem 4"
m (→Solution 2) |
I Love Math (talk | contribs) m (box the solution) |
||
Line 10: | Line 10: | ||
== Solution == | == Solution == | ||
− | Clearly, <math>a_6=1</math>. Now, consider selecting <math>5</math> of the remaining <math>11</math> values. Sort these values in descending order, and sort the other <math>6</math> values in ascending order. Now, let the <math>5</math> selected values be <math>a_1</math> through <math>a_5</math>, and let the remaining <math>6</math> be <math>a_7</math> through <math>{a_{12}}</math>. It is now clear that there is a [[bijection]] between the number of ways to select <math>5</math> values from <math>11</math> and ordered 12-tuples <math>(a_1,\ldots,a_{12})</math>. Thus, there will be <math>{11 \choose 5}=462</math> such ordered 12-tuples. | + | Clearly, <math>a_6=1</math>. Now, consider selecting <math>5</math> of the remaining <math>11</math> values. Sort these values in descending order, and sort the other <math>6</math> values in ascending order. Now, let the <math>5</math> selected values be <math>a_1</math> through <math>a_5</math>, and let the remaining <math>6</math> be <math>a_7</math> through <math>{a_{12}}</math>. It is now clear that there is a [[bijection]] between the number of ways to select <math>5</math> values from <math>11</math> and ordered 12-tuples <math>(a_1,\ldots,a_{12})</math>. Thus, there will be <math>{11 \choose 5}=\boxed{462}</math> such ordered 12-tuples. |
== Solution 2 == | == Solution 2 == |
Revision as of 16:30, 29 February 2020
Contents
Problem
Let be a permutation of
for which
![$a_1>a_2>a_3>a_4>a_5>a_6 \mathrm{\ and \ } a_6<a_7<a_8<a_9<a_{10}<a_{11}<a_{12}.$](http://latex.artofproblemsolving.com/7/1/4/714f8aaced4000d779337cb9bddced3aff9ed3e7.png)
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.
Solution 2
There are ways to choose 6 numbers from
, and then there will only be one way to order them. And since that
, only half of the choices will work, so the answer is
12-tuples - mathleticguyyy
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 |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.