Three players, Ava, Beau, and Cato, are playing in a tournament.
Each person plays exactly two games, one game against each of the other
players. If a game ends in a tie, both players are awarded point. Otherwise, the winning player is awarded points, and the losing player is awarded points. For example, if the tournament results are as shown below and , then points are awarded as follows: Game Results Points Awarded Ava Beau Cato Ava loses to Beau —— Beau and Cato tie —— Ava and Cato tie —— Suppose that is equal to the sum of the points that have been awarded to the three players when the tournament has finished. In the example above, Ava is awarded point, Beau is awarded points, and Cato is awarded points, so in the example.
Suppose the tournament results are as follows: Ava and Beau tie, Beau loses to Cato, Ava and Cato tie. If , what is the value of ?
If and , how many games ended in a tie?
Suppose the tournament finishes with exactly one of the three games ending in a tie. If , what is the value of ?
Suppose the tournament finishes with , but we are not told the results of the games. Determine all possible integer values of .
Problem 701
Official solution
We organize the given results in a table similar to the example
shown. A winning player is awarded points for each game won. Game Results Points Awarded Ava Beau Cato Ava loses to Beau —— Beau and Cato tie —— Ava and Cato tie —— When the tournament has finished, Ava has been awarded points, Beau has been awarded point, and Cato has been awarded points, and so . Alternately, games end in a tie, and in each game ending in a tie, points are awarded ( point to each player). Thus, the tie games contribute points to . The remaining game ended with a winner, and so points are awarded ( to the winning player, to the losing player). Thus, this game contributes points to , and so . Each game that ends in a tie contributes points to (1 point to each player). If all games end in a tie, then , as required. Next, we confirm that all games ending in a tie is the only possibility. Each game that ends with a winner contributes points to ( to the winning player, to the losing player). If all games end with a player winning, then . If games end with a player winning, and game ends in a tie, then . If game ends with a player winning, and games end in a tie, then . Thus, if and , the only possibility is that all games end in a tie. The tournament ends with exactly one of the three games ending in a tie, and so exactly two of the games end with a player winning. The game ending in a tie contributes to ( point to each player). A game that ends with a player winning contributes to , and so two games that end with a player winning contribute to . In this case, or which gives , and so . As was demonstrated in (b), there are four outcomes that must be considered when determining the possible values of . The tournament can end with exactly , , , or ties. If the tournament ends with ties, then each of the games has a winning player, and thus . In this case, and so . If the tournament ends with tie, then games have a winning player, and thus. In this case, or which is not possible since is an integer. If the tournament ends with ties, then game has a winning player, and thus. In this case, or . Finally, if the tournament ends with ties, then games have a winning player, and thus , and so cannot equal . If the tournament finishes with , the possible integer values of are and .



