Five teams have to compete in a league, with every team playing every other team exactly once, before going to the next round. How many matches will have to be held to complete the league round of matches?
The problem asks for the total number of matches when 5 distinct teams play each other exactly once in a league format. This is a problem of combinations, as the order of teams playing does not matter (Team A vs Team B is the same match as Team B vs Team A).
We need to find the number of ways to choose 2 teams out of 5 to play a match. The formula for combinations is:
$ C(n, k) = \binom{n}{k} = \frac{n!}{k!(n-k)!} $
Where:
Substitute the values into the formula:
$ C(5, 2) = \binom{5}{2} = \frac{5!}{2!(5-2)!} $
$ C(5, 2) = \frac{5!}{2!3!} $
Calculate the factorials:
$ 5! = 5 \times 4 \times 3 \times 2 \times 1 = 120 $
$ 2! = 2 \times 1 = 2 $
$ 3! = 3 \times 2 \times 1 = 6 $
Now, substitute the factorial values back into the formula:
$ C(5, 2) = \frac{120}{(2)(6)} = \frac{120}{12} = 10 $
Alternatively, we can list the matches systematically:
Total matches = $4 + 3 + 2 + 1 = 10$.
Both methods confirm that 10 matches are required to complete the league round where 5 teams play each other exactly once.
Two wizards try to create a spell using all the four elements, water, air, fire, and earth. For this, they decide to mix all these elements in all possible orders. They also decide to work independently. After trying all possible combination of elements, they conclude that the spell does not work.
How many attempts does each wizard make before coming to this conclusion, independently?
A police station has six personnel comprising an inspector (I) and five constables ($C_1, C_2, C_3, C_4, C_5$). Normally, a 'raid team' of two, three, or four members is formed depending upon the nature of the raid. As per rule, it is mandatory that the inspector is part of raid team.
Number of distinct raid teams that can be formed is __________________.
(Answer in integer)