In a chess-playing club, some of the players take lessons from other players. It is possible (but not necessary) for two players both to take lessons from each other. It so happens that for any three distinct members of the club, , and , exactly one of the following three statements is true: takes lessons from takes lessons from takes lessons from . What is the largest number of players there can be?
Solution
If , and are any five distinct players, then consider all pairs such that takes lessons from . Each pair contributes to exactly three triples (one for each of the choices of distinct from and ); three triples ; and three triples . On the other hand, there are ordered triples of distinct players among these five, and each includes exactly one of our lesson-taking pairs. That means that there are such pairs. But this number isn't an integer, so there cannot be five distinct people in the club. On the other hand, there can be four people, , and : let and both take lessons from each other, and let and both take lessons from each other; it is easy to check that this meets the conditions. Thus the maximum number of players is 4.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.