A round-robin tournament of n contestants is a tournament in which each of the

pairs of contestants play each other exactly once, with the outcome of any play being that one of the contestants wins and the other loses. For a fixed integer k, k

then such an outcome is possible.
Suppose that the results of the games are independent and that each game is equally likely to be won by either contestant. Number the

sets of k contestants, and let Bi denote the event that no contestant beat all of the k players in the ith set. Then use Boole€™s inequality to bound

Transcribed Image Text:

2. un P(UB