For a game in which every possible pair plays with every other pair, 10 players are available. Mr. A solves this problem and get an answer equal to \(\frac{10 !^{5} C_{2}}{(2 !)^{5} 5 !}\) . However on checking the answer, he found that his answer is k times the actual answer, then the value of k is:

Permutations & Combinations

Grade 11

Question:

For a game in which every possible pair plays with every other pair, 10 players are available. Mr. A solves this problem and get an answer equal to \(\frac{10 !^{5} C_{2}}{(2 !)^{5} 5 !}\). However on checking the answer, he found that his answer is k times the actual answer, then the value of k is:

13

11

15

14

Step-by-Step Solution

Key Concept: The number of unique matches between two pairs is found by selecting four distinct players and partitioning them into two disjoint sets of two.

15

Correct Answer: C

Question:

Step-by-Step Solution

Master Permutations & Combinations with Mathbee