16 competitors in a tournament
Source: New Zealand NZMOC Camp Selection Problems 2011 Juniors 3
September 18, 2021
combinatorics
Problem Statement
There are competitors in a tournament, all of whom have different playing strengths and in any match between two players the stronger player always wins. Show that it is possible to find the strongest and second strongest players in matches.