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.

×

Problem Loading...

Note Loading...

Set Loading...