Mark one card with a
For every pair of integers
1.
2.
3.
Calculate
During a tournament with six players, each player plays a match against each other player. At each match there is a winner; ties do not occur. A journalist asks five of the six players how many matches each of them has won. The answers given are
Let
Klein tosses
The letters
The kingdom of Rabbitland consists of a finite number of cities. No matter how you split the kingdom into two, there is always a train connection from a city in one part of the divide to a city in the other part of the divide. Show that one can in fact travel from any city to any other, possibly changing trains.
A poetry society has 33 members, and each person knows at least 16 people from the society. Show that you can get to know everyone in the society by a series of introductions if you already know someone from the society.
Some Star Trek fans and some Doctor Who fans met at a science fiction convention. It turned out that everyone knew exactly three people at the convention. However, none of the Star Trek fans knew each other and none of the Doctor Who fans knew each other. Show that there are the same number of Star Trek fans as the number of Doctor Who fans at the convention.