3
$\begingroup$

A round-robin tournament is being held with n tennis players; this means that every player will play against every other player exactly once. How many possible outcomes are there for the tournament? (the outcome lists out who won and who lost for each game). How many games are played in total?

I would think that are $\dfrac{n(n-1)}{2}\ 2^{n} $ possible outcomes, with $\dfrac{n(n-1)}{2}\ $ games played in total, is this correct?

|cite|improve this question
$\endgroup$
  • $\begingroup$ You have the elements of the right reasoning. Can you see that it is $2^g$, where $g=\frac{n(n-1)}{2}$? $\endgroup$ – André Nicolas Nov 24 '14 at 18:10
5
$\begingroup$

You’ve misused the multiplication rule. There are $\dfrac{n(n-1)}2$ games, and each has $2$ possible outcomes, so there are

$$\large2^{\frac{n(n-1)}2}$$

possible outcomes.

For example, with $n=3$ there are $3$ games, and each has $2$ possible outcomes, so there are $2\cdot2\cdot2=2^3$ possible results for the tournament.

|cite|improve this answer
$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.