There is always a player such that every other player was either beaten by him or beaten by a player beaten by him
Every participant of a tournament plays with every other participant exactly once. No game is a draw. After the tournament, every player makes a list with the names of all the players, who either
(i) were beaten by him or (ii) were beaten by a player beaten by him.
Prove that there is a player whose list contains the names of all other players. (Hint: use the extremal principle )
Answer
Answers can be viewed only if
- The questioner was satisfied and accepted the answer, or
- The answer was disputed, but the judge evaluated it as 100% correct.
1 Attachment
-
Brilliant! Thank you.
The answer is accepted.
Join Matchmaticians Affiliate Marketing
Program to earn up to 50% commission on every question your affiliated users ask or answer.
- answered
- 227 views
- $10.00
Related Questions
- A car running out of gas on a circular track
- Game theory 100 voters
- Prove that one of $(n+1)$ numbers chosen from $\{1,2, \dots, 2n\}$ is divisible by another.
- If both $n$ and $\sqrt{n^2+204n}$ are positive integers, find the maximum value of $𝑛$.
- Find conditions for all chips to become of the same color in this game
- Is it possible to transform $f(x)=x^2+4x+3$ into $g(x)=x^2+10x+9$ by the given sequence of transformations?
- What is the probability that the last person to board an airplane gets to sit in their assigned seat?
- Two players alternately remove nodes from a connected graph G
