Solution to Consider a tournament with n players where each player plays against every other player. Suppose … - Sikademy
Author Image

Archangel Macsika

Consider a tournament with n players where each player plays against every other player. Suppose each player wins at least once. Show that at least 2 of the players have the same number of wins.

The Answer to the Question
is below this banner.

Can't find a solution anywhere?

NEED A FAST ANSWER TO ANY QUESTION OR ASSIGNMENT?

Get the Answers Now!

You will get a detailed answer to your question or assignment in the shortest time possible.

Here's the Solution to this Question

The number of wins for a player is at least 1 and at the most (n-1).

These (n-1) numbers correspond to the pigeonholes to accomodate n playesr (pigeons).

Thus, by the Pigeonhole Principle there must be at least two players occupying one pigeonhole (number of wins).

Hence, it is proved.

Related Answers

Was this answer helpful?

Join our Community to stay in the know

Get updates for similar and other helpful Answers

Question ID: mtid-5-stid-8-sqid-565-qpid-450