Your progress
Ticks are kept only in this browser: clearing your browsing data or changing device loses them. · ·

MOG 2015 Q4

4.
(a)

A tournament has \(n\) contestants. Each contestant plays exactly one game against every other contestant. Explain why the total number of games is \(\tfrac{1}{2}n(n - 1)\).

(b)

In a particular chess tournament, every contestant is supposed to play exactly one game against every other contestant. However, contestant \(A\) withdrew from the tournament after playing only ten games, and contestant \(B\) withdrew after just one game.

A total of 55 games were played.

Did \(A\) and \(B\) play each other?

Mathematical Olympiad for Girls 2015, Question 4. © UK Mathematics Trust. Original paper on ukmt.org.uk