Home
Class 12
MATHS
Sixteen players S(1), S(2), S(3),…,S(16)...

Sixteen players `S_(1)`, `S_(2)`, `S_(3)`,…,`S_(16)` play in a tournament. Number of ways in which they can be grouped into eight pairs so that `S_(1)` and `S_(2)` are in different groups, is equal to

A

`((14)!)/(2^(6)*6!)`

B

`((15)!)/(2^(7)*7!)`

C

`((14)!)/(2^(7)*6!)`

D

`((14)!)/(2^(6)*7!)`

Text Solution

AI Generated Solution

The correct Answer is:
To solve the problem of grouping 16 players into 8 pairs such that players S1 and S2 are in different groups, we can follow these steps: ### Step 1: Calculate the total number of ways to pair 16 players. The total number of ways to pair up 16 players into 8 pairs can be calculated using the formula for pairing \( n \) items: \[ \text{Total ways} = \frac{n!}{2^k \cdot k!} \] where \( n \) is the total number of players and \( k \) is the number of pairs. Here, \( n = 16 \) and \( k = 8 \). \[ \text{Total ways} = \frac{16!}{2^8 \cdot 8!} \] ### Step 2: Calculate the number of ways in which S1 and S2 are in the same group. If S1 and S2 are in the same group, we can treat them as a single entity or a "super player." This reduces the problem to pairing 15 entities (S1 and S2 as one entity and the other 14 players). \[ \text{Ways with S1 and S2 together} = \frac{14!}{2^7 \cdot 7!} \] ### Step 3: Calculate the required number of ways. To find the number of ways in which S1 and S2 are in different groups, we subtract the number of ways they are in the same group from the total number of ways: \[ \text{Required ways} = \text{Total ways} - \text{Ways with S1 and S2 together} \] Substituting the values we found: \[ \text{Required ways} = \frac{16!}{2^8 \cdot 8!} - \frac{14!}{2^7 \cdot 7!} \] ### Step 4: Simplify the expression. To simplify the expression: 1. Factor out \( \frac{14!}{2^7 \cdot 7!} \) from both terms: \[ \text{Required ways} = \frac{14!}{2^7 \cdot 7!} \left( \frac{16 \cdot 15}{2 \cdot 8} - 1 \right) \] 2. Simplify the term inside the parentheses: \[ \frac{16 \cdot 15}{2 \cdot 8} = \frac{240}{16} = 15 \] Thus: \[ \text{Required ways} = \frac{14!}{2^7 \cdot 7!} (15 - 1) = \frac{14!}{2^7 \cdot 7!} \cdot 14 \] ### Step 5: Final expression. The final expression for the number of ways to group the players such that S1 and S2 are in different groups is: \[ \text{Required ways} = \frac{14! \cdot 14}{2^7 \cdot 7!} \]

To solve the problem of grouping 16 players into 8 pairs such that players S1 and S2 are in different groups, we can follow these steps: ### Step 1: Calculate the total number of ways to pair 16 players. The total number of ways to pair up 16 players into 8 pairs can be calculated using the formula for pairing \( n \) items: \[ \text{Total ways} = \frac{n!}{2^k \cdot k!} \] where \( n \) is the total number of players and \( k \) is the number of pairs. Here, \( n = 16 \) and \( k = 8 \). ...
Promotional Banner

Topper's Solved these Questions

  • PERMUTATION AND COMBINATION

    CENGAGE|Exercise Multiple Correct Answer|2 Videos
  • PERMUTATION AND COMBINATION

    CENGAGE|Exercise Comprehension|8 Videos
  • PARABOLA

    CENGAGE|Exercise Question Bank|21 Videos
  • PRINCIPLE OF MATHEMATICAL INDUCTION

    CENGAGE|Exercise Exercise|9 Videos

Similar Questions

Explore conceptually related problems

Fifteen sudents S_(1),S_(2),S_(3),….S_(15) participate in quiz competition. The number of ways in which they can be grouped into 5 teams of 3 each such that S_(1) and S_(2) are in different teams is equal to

Sixteen players P_(1),P_(2),P_(3)….., P_(16) play in tournament. If they grouped into eight pair then the probability that P_(4) and P_(9) are in different groups, is equal to

Sixteen players S_(1),S_(2),...,S_(16) play in a tournament.They are divided into eight pairs at random.From each pair a winner is decided on the basis of a game played between the two players of the pair.Assume that all the players are of equal strength.Find the probability that the player S_(1) is among the eight winners.

S_(1) and S_(2) are two equipotential surfaces on which the potentials are not equal

In a knockout tournament 2^(n) equally skilled players, S_(1),S_(2),….S_(2n), are participatingl. In each round, players are divided in pair at random and winner from each pair moves in the next round. If S_(2) reaches the semi-final, then the probability that S_(1) wins the tournament is 1/84. The value of n equals _______.

The correct decreasing order of reactivity for a given (R) group in both S_(N^(1)) " and " S_(N^(2)) reaction mechanism is :

The coordinates of the radical center can be found by solving the equation S_(1)=S_(2)=S_(3)=0

Three coherent sources S_(1), S_(2)" and" S_(3) can throw light on a screen. With S_(1) switched on intensity at a point P on the screen was observed to be I. With only S_(2) on, intensity at P was 2I and when all three are switched on the intensity at P becomes zero. Intensity at P is I when S_(1)" and" S_(2) are kept on. Find the phase difference between the waves reaching at P from sources S_(1) "and" S_(3) .

CENGAGE-PERMUTATION AND COMBINATION-Question Bank
  1. Sixteen players S(1), S(2), S(3),…,S(16) play in a tournament. Number ...

    Text Solution

    |

  2. If the number of ways in which a selection of 100 balls can be made ou...

    Text Solution

    |

  3. If the number of circular permutations of 20 letters P, Q, R, S, T , A...

    Text Solution

    |

  4. Let N be the number of points (x, y, z) in space such that x+y+z=12, w...

    Text Solution

    |

  5. On the sides A B, B C, C A of a triangle A B C, 3,4,5 distinct points ...

    Text Solution

    |

  6. The number of ways in which the letters of the word 'LONDON' can be re...

    Text Solution

    |

  7. We have 19 identical gems available with us which are needed 'to be di...

    Text Solution

    |

  8. If ' N ' denotes the number of ways in which 8 different mobilès can b...

    Text Solution

    |

  9. If the number of arrangements of 4 alike apples, 5 alike mangoes, 1 ba...

    Text Solution

    |

  10. Duronto express bound from Jaipur to Mumbai stops at 7 intermediate st...

    Text Solution

    |

  11. There are 6 different balls and 6 different boxes of the colour same a...

    Text Solution

    |

  12. Consider M=2^(4) 3^(4) 5^(2) 7^(2) 11^(2) and number of ways in which ...

    Text Solution

    |

  13. Consider the word 'HALEAKALA'. The number of ways the letters of this ...

    Text Solution

    |

  14. Consider the word 'CARCASSONNE'. Words are formed' using all the lette...

    Text Solution

    |

  15. If (201) ! is divided by 24^(k) then the largest value of k is

    Text Solution

    |

  16. If there are 10 stations on a route and the train has to be stopped at...

    Text Solution

    |

  17. Let A={1,2,3,4] . The number of different ordered pairs (B, C) that ca...

    Text Solution

    |

  18. Number of ways in which three distinct numbers can be selected between...

    Text Solution

    |

  19. Matrices are formed using four given distinct real numbers, taking all...

    Text Solution

    |

  20. If n is a factor of 72 , such that x y=n, then number of ordered pairs...

    Text Solution

    |