answer with explanation

1.10. Consider a round-robin tournament having n contestants, and let k, I! k

1.10. Consider a round-robin tournament having n contestants, and let k, n 1/2kln-k < 1 Show that k < n, be a positive integer such that [1 k it is possible for the tournament outcome to be such that for every set of k contestants there is a contestant who beat every member of this set.