1989 AHSME Problems/Problem 25

Problem

In a certain cross country meet between 2 teams of 5 runners each, a runner who finishes in the $n$th position contributes $n$ to his teams score. The team with the lower score wins. If there are no ties among the runners, how many different winning scores are possible?

(A) 10 (B) 13 (C) 27 (D) 120 (E) 126

Solution

The scores of all ten runners must sum to $55$. So a winning score is anything between $1+2+3+4+5=15$ and $\lfloor\tfrac{55}{2}\rfloor=27$ inclusive. It is easy to check that this range is covered by considering $1+2+3+4+x$, $1+2+3+x+10$ and $1+2+x+9+10$, so the answer is $\boxed{13}$.


See also

1989 AHSME (ProblemsAnswer KeyResources)
Preceded by
Problem 24
Followed by
Problem 26
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 26 27 28 29 30
All AHSME Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Invalid username
Login to AoPS