TUYMAADA 2006 Problem 5
There are 100 boxers, each of them having different strengths, who participate in a tournament. Any of them fights each other only once. Several boxers form a plot. In one of their matches, they hide in their glove a horse shoe. If in a fight, only one of the boxers has a horse shoe hidden, he wins the fight; otherwise, the stronger boxer wins. It is known that there are three boxers who obtained (strictly) more wins than the strongest three boxers. What is the minimum number of plotters ?
Proposed by N. Kalinin
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.