Difference between revisions of "2011 AIME II Problems/Problem 6"
(→Solution) |
Willwang123 (talk | contribs) (→Problem 6) |
||
| Line 1: | Line 1: | ||
==Problem 6== | ==Problem 6== | ||
| − | Define an ordered quadruple <math>(a, b, c, d)</math> as interesting if <math>1 \le a<b<c<d \le 10</math>, and <math>a+d>b+c</math>. How many ordered quadruples are there? | + | Define an ordered quadruple <math>(a, b, c, d)</math> as interesting if <math>1 \le a<b<c<d \le 10</math>, and <math>a+d>b+c</math>. How many interesting ordered quadruples are there? |
==Solution== | ==Solution== | ||
Revision as of 13:55, 30 April 2011
Problem 6
Define an ordered quadruple 
as interesting if 
, and 
. How many interesting ordered quadruples are there?
Solution
Rearranging the inequality we get 
. Let 
, then 
is a partition of 11 into 5 positive integers or equivalently:
is a partition of 6 into 5 non-negative integer parts. Via a standard balls and urns argument, the number of ways to partition 6 into 5 non-negative parts is 
. The interesting quadruples correspond to partitions where the second number is less than the fourth. By symmetry there as many partitions where the fourth is less than the second. So, if 
is the number of partitions where the second element is equal to the fourth, our answer is 
.
We find as a sum of 4 cases:
- two parts equal to zero,
ways, - two parts equal to one,
ways, - two parts equal to two,
ways, - two parts equal to three,
way.
ways,
ways,
ways,
way.Therefore, 
and our answer is 
