lets play tennis!

In a tennis tournament, each competitor plays against every other competitor, and there are no draws. Call a group of four tennis players “ordered” if there is a clear winner and a clear loser (i.e., one person who beat the other three, and one person who lost to the other three.) Find the smallest integer n for which any tennis tournament with n people has a group of four tennis players that is ordered.


The answer is 8.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Ariel Gershon
Apr 19, 2015

In a tournament with 8 8 people, since everyone plays against everyone else, there will be ( 8 2 ) = 28 \displaystyle\binom{8}{2} = 28 games. Therefore, the total number of victories in the tournament is 28 28 . Therefore, the average number of victories per player is 28 8 = 3.5 \dfrac{28}{8} = 3.5 . Therefore, by the Pigeonhole Principle, there must be a least one player who won at least 4 4 games. Let's call this player W W , and we'll call the four losers A , B , C , D A, B, C, D .

Now since there are 4 4 of them, the players A , B , C , D A, B, C, D played ( 4 2 ) = 6 \displaystyle\binom{4}{2} = 6 games amongst each other. Hence the average number of losses in this group is 6 4 = 1.5 \dfrac{6}{4} = 1.5 . Therefore, by the Pigeonhole Principle, there is at least one player (let's say D D ) who lost at least two games to other players in the group. Say D D lost to A A and B B . Then the set W , A , B , D {W, A, B, D} is ordered with the clear winner W W and the clear loser D D .

Therefore, any tournament of 8 8 people has an ordered group.

However we're not done yet; now let's show that not all tournaments of 7 7 players have an ordered group. Consider the following tournament with 7 7 players numbered 1 1 through 7 7 : { P l a y e r 1 b e a t s 2 , 3 , 4 P l a y e r 2 b e a t s 3 , 5 , 7 P l a y e r 3 b e a t s 4 , 5 , 6 P l a y e r 4 b e a t s 2 , 6 , 7 P l a y e r 5 b e a t s 1 , 4 , 7 P l a y e r 6 b e a t s 1 , 2 , 5 P l a y e r 7 b e a t s 1 , 3 , 6 \left\{\begin{matrix} Player& 1& beats& 2,3,4 \\ Player& 2& beats& 3,5,7 \\ Player& 3& beats& 4,5,6 \\ Player& 4& beats &2,6,7 \\ Player&5 &beats& 1,4,7 \\ Player& 6& beats& 1,2,5 \\ Player& 7& beats& 1,3,6 \end{matrix}\right. Each of the players here beats 3 3 players and loses to 3 3 players. Notice that each of the above triplets creates a "triangle" in which each player wins exactly one game and loses exactly one game amongst each other. For example, in the first row we have 1 1 beats 2 , 3 2,3 and 4 4 , where 2 2 beats 3 , 3, 3 3 beats 4 4 and 4 4 beats 2 2 .

Now in order to have an "ordered group", we must have one "clear winner" and one "clear loser". If there were a clear winner, however, then the three people that he/she won against would create a triangle and thus have no clear loser. Hence, this tournament has no ordered groups.

Therefore, the minimum is 8 8 .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...