ToT 2021-fall JO5
There were 20 participants in a chess tournament. Each of them played with each other twice: once as white and once as black. Let us say that participant is no weaker than participant if has won at least the same number of games playing white as and also has won at least the same number of games playing black as . Do there exist for sure two participants and such that is not weaker than ?
Boris Frenkin
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.