A tough tournament!

Five teams of equal strength play against each other in a tournament and each match either ends in a win or a loss for a team. Find the probability that none of the teams either wins or loses all the the matches.

If the answer is in the form a b \dfrac{a}{b} , where a a and b b are coprime positive integers, then find a + b a+b .


The answer is 49.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

The tournament involves ( 5 2 ) = 10 \binom{5}{2} = 10 matches, each of which has two possible outcomes, thus there are 2 10 = 1024 2^{10} = 1024 possible ways the tournament can play out in general.

Now it will be easier to calculate the complement here, i.e., to determine the number of tournament scenarios in which either one of the teams wins all its matches or one of the teams loses all its matches, or both. (Note that at most one team can win all of its matches, as all the other teams would then have at least one loss. Similarly, at most one team can lose all of its matches.)

Let A A be the set of all tournament scenarios in which one team wins all of its matches and B B be the set of tournament scenarios in which one team loses all of its matches. We then wish to find

A B = A + B A B |A \cup B| = |A| + |B| - |A \cap B| .

By symmetry A = B |A| = |B| . Now if one team wins all of its 4 matches, then the remaining 6 matches can each still have 2 outcomes. As this is the case if any of the 5 teams wins all of its matches, we have A = 5 × 2 6 = 320 |A| = 5 \times 2^{6} = 320 .

If one team wins all of its matches and one team loses all of its matches, then the outcomes of 7 of the matches have been determined, (not 8 since one of the matches involves both these two teams), so the remaining 3 matches have 2 outcomes each. We can choose the all-wins team in 5 ways and then the all-losses team in 4 ways, so A B = 5 × 4 × 2 3 = 160 |A \cap B| = 5 \times 4 \times 2^{3} = 160 .

Thus A B = 320 + 320 160 = 480 |A \cup B| = 320 + 320 - 160 = 480 , and so there are 1024 480 = 544 1024 - 480 = 544 tournament scenarios in which no team either wins or loses all of its matches. The desired probability is then

544 1024 = 17 32 \dfrac{544}{1024} = \dfrac{17}{32} , and so a + b = 17 + 32 = 49 a + b = 17 + 32 = \boxed{49} .

If we try this with a complete directed graph with 5 vertices.Then to calculate the required matches we need to calculate the number of such graphs in which each vertex should have at least one in-degree and one out-degree.

I tried with this but can not got the correct answer.Can you help me in this matter

Kushal Bose - 4 years, 2 months ago

Log in to reply

My graph theory is a bit rusty, but we would be looking for the possible score sequences for a labelled tournament . (This links are for unlabeled tournaments and the graphs shown are the non-isomorphic possibilities. I'm having trouble finding a link for labelled graphs.) I suspect that we would need to make use of Landau's Theorem , and then count the permutations of the possible score sequences that have, in this case, no 0's or 4's to get the number of suitable graphs. I'll try and work on this when I have some more time.

Brian Charlesworth - 4 years, 2 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...