Skip to main content
OlympiadHQ

Browse · harp

Print

smc

counting and probability senior

Problem

In a table tennis tournament every participant played every other participant exactly once. Although there were twice as many right-handed players as left-handed players, the number of games won by left-handed players was more than the number of games won by right-handed players. (There were no ties and no ambidextrous players.) What is the total number of games played?
(A)
(B)
(C)
(D)
Solution
We know that the total amount of games must be the sum of games won by left and right handed players. Then, we can write , and since , . Given that and are both integers, also must be an integer. From here we can see that must be divisible by 12, leaving only answers B and D. Now we know the formula for how many games are played in this tournament is , the sum of the first triangular numbers. Now, setting 36 and 48 equal to the equation will show that two consecutive numbers must have a product of 72 or 96. Clearly, , so the answer is .
Final answer
B