Päevaülesanne

Juhuslik

Harjutuskomplekt

Balti Tee 1998 · Ülesanne 19

Kombinatoorika

Consider a ping-pong match between two teams, each consisting of 1000 players. Each player played against each player of the other team exactly once (there are no draws in ping-pong). Prove that there exist ten players, all from the same team, such that every member of the other team has lost his game against at least one of those ten players.

Muuda valikut

Kui oled valmis

Ülevaatematerjal muutub kättesaadavaks järgmise päevaülesannete komplektiga.

Ülevaade

Teemad

Loendamine · Mängud ja strateegiad · Algoritmid ja protsessid

Lahendused

Lahendus

Solution:

We start with the following observation: In a match between two teams (not necessarily of equal sizes), there exists in one of the teams a player who won his games with at least half of the members of the other team.

Indeed: suppose there is no such player. If the teams consist of mm and nn members then the players of the first team jointly won less than m⋅n2m \cdot \frac{n}{2} games, and the players of the second team jointly won less than m⋅n2m \cdot \frac{n}{2} games - this is a contradiction since the total number of games played is mnm n, and in each game there must have been a winner.

Returning to the original problem (with two equal teams of size 10001000), choose a player who won his games with at least half of the members of the other team - such a player exists, according to the observation above, and we shall call his team "first" and the other team "second" in the sequel. Mark this player with a white hat and remove from further consideration all those players of the second team who lost their games to him. Applying the same observation to the first team (complete) and the second team truncated as explained above, we again find a player (in the first or in the second team) who won with at least half of the other team members. Mark him with a white hat, too, and remove the players who lost to him from further consideration.

We repeat this procedure until there are no players left in one of the teams; say, in team YY. This means that the white-hatted players of team XX constitute a group with the required property (every member of team YY has lost his game to at least one player from that group). Each time when a player of team XX was receiving a white hat, the size of team YY was reduced at least by half; and since initially the size was a number less than 2102^{10}, this could not happen more than ten times.

Hence the white-hatted group from team XX consists of not more than ten players. If there are fewer than ten, round the group up to ten with any players.

Võistluse kontekst

Balti Tee tulemused 1998

11 võistkonda

Keskmine tulemus
0,5 / 5
4 või 5 punkti
1 / 11
Eesti
0 / 5

Punktijaotus

09
11
20
30
40
51
Kõigi võistkondade punktid
VõistkondPunktid
Latvia0 / 5
Estonia0 / 5
Poland0 / 5
Finland0 / 5
St. Petersburg0 / 5
Sweden5 / 5
Denmark0 / 5
Iceland1 / 5
Norway0 / 5
Germany0 / 5
Lithuania0 / 5