AoPSWiki
Our Precalculus course starts on Dec. 4. Master trig, complex numbers, and vectors and matrices in 2 and 3 dimensions. Click here to enroll today!

2008 AMC 12A Problems/Problem 21

From AoPSWiki

Problem

A permutation (a_1,a_2,a_3,a_4,a_5) of (1,2,3,4,5) is heavy-tailed if a_1 + a_2 < a_4 + a_5. What is the number of heavy-tailed permutations?

\mathrm{(A)}\ 36\qquad\mathrm{(B)}\ 40\qquad\textbf{(C)}\ 44\qquad\mathrm{(D)}\ 48\qquad\mathrm{(E)}\ 52

Solution

There are 5!=120 total permutations.

For every permutation (a_1,a_2,a_3,a_4,a_5) such that a_1 + a_2 < a_4 + a_5, there is exactly one permutation such that a_1 + a_2 > a_4 + a_5. Thus it suffices to count the permutations such that a_1 + a_2 = a_4 + a_5.

1+4=2+3, 1+5=2+4, and 2+5=3+4 are the only combinations of numbers that can satisfy a_1 + a_2 = a_4 + a_5.

There are 3 combinations of numbers, 2 possibilities of which side of the equation is a_1+a_2 and which side is a_4+a_5, and 2^2=4 possibilities for rearranging a_1,a_2 and a_4,a_5. Thus, there are 3\cdot2\cdot4=24 permutations such that a_1 + a_2 = a_4 + a_5.

Thus, the number of heavy-tailed permutations is \frac{120-24}{2}=48 \Rightarrow D.

See also

2008 AMC 12A (ProblemsResources)
Preceded by
Problem 20
Followed by
Problem 22
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
Looking for a challenging geometry text? Preparing for MATHCOUNTS or the AMC exams? Check out Art of Problem Solving's Introduction to Geometry by Richard Rusczyk.
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us