Mathematics desk | ||
---|---|---|
< October 11 | << Sep | October | Nov >> | October 13 > |
Welcome to the Wikipedia Mathematics Reference Desk Archives |
---|
The page you are currently viewing is a transcluded archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages. |
(Trying to figure out how good a chance some teams I'm following can win their tournaments...) Consider a multiple round-robin tournament with n players/teams and r rounds, so that each player/team plays each other player/team exactly r times, for a total of r(n - 1) matches per player/team. Assuming no tied games/matches are possible, at the conclusion of the tournament, what is the least possible number of wins sufficient to be an untied champion? — SeekingAnswers ( reply) 21:25, 12 October 2015 (UTC)
Mathematics desk | ||
---|---|---|
< October 11 | << Sep | October | Nov >> | October 13 > |
Welcome to the Wikipedia Mathematics Reference Desk Archives |
---|
The page you are currently viewing is a transcluded archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages. |
(Trying to figure out how good a chance some teams I'm following can win their tournaments...) Consider a multiple round-robin tournament with n players/teams and r rounds, so that each player/team plays each other player/team exactly r times, for a total of r(n - 1) matches per player/team. Assuming no tied games/matches are possible, at the conclusion of the tournament, what is the least possible number of wins sufficient to be an untied champion? — SeekingAnswers ( reply) 21:25, 12 October 2015 (UTC)