Home
Class 12
MATHS
16 players P(1),P(2),P(3),….P(16) take p...

16 players `P_(1),P_(2),P_(3),….P_(16)` take part in a tennis tournament. Lower suffix player is better than any higher suffix player. These players are to be divided into 4 groups each comprising of 4 players and the best from each group is selected to semifinals.
Q. Number of ways in which these 16 players can be divided into four equal groups, such that when the best player is selected from each group `P_(6)` in one among them is `(k)(12!)/((4!)^(3))` the value of k is

A

36

B

24

C

18

D

20

Text Solution

Verified by Experts

The correct Answer is:
D
Promotional Banner

Topper's Solved these Questions

  • THEORY AND EXERCISE BOOK

    MOTION|Exercise EXERCISE -3|23 Videos

  • THEORY AND EXERCISE BOOK

    MOTION|Exercise EXERCISE -4 LEVEL -I|13 Videos

  • THEORY AND EXERCISE BOOK

    MOTION|Exercise EXERCISE -2 (LEVEL - I)|23 Videos

  • TANGENT & NORMAL

    MOTION|Exercise EXERCISE 4|14 Videos

  • THREE DIMENSIONAL GEOMETRY (3 -D)

    MOTION|Exercise SOLVED EXAMPLE|33 Videos

Similar Questions

Explore conceptually related problems

16 players P_1,P_2,P_3,.. P_16 take part in a tennis tounament. Lower suffix player is better han any higher suffix player. These players are to be divided into 4 groups each comprising of 4 players and the best from each group is selected for semifinals .Number ways in which 16 players can be divided into four equal groups , is

16 players P_(1),P_(2),P_(3),….P_(16) take part in a tennis tournament. Lower suffix player is better than any higher suffix player. These players are to be divided into 4 groups each comprising of 4 players and the best from each group is selected to semifinals. Q. Number of ways in which they can be divided into 4 equal groups if the players P_(1),P_(2),P_(3) and P_(4) are in different groups, is:

66 games were played in a tournament where each player placed one against the rest.The number of players are

52 cards are to be distributed among 4 players such that 2 players get 12 cards each and other 2 players get 14 cards each,then the number of ways in which this can be done is

The number of ways in which a team of 11 players can be selected from 22 players including 2 of them and excluding 4 of them is

MOTION-THEORY AND EXERCISE BOOK-EXERCISE - 2 (LEVEL -II)
  1. The combinatorial coefficient C(n, r) is equal to

    Text Solution

    |

  2. The continued product 2.6.10.4…..(n times) in equal to

    Text Solution

    |

  3. The maximum number of permutation of 2n letters in which there are onl...

    Text Solution

    |

  4. If P(n, n) denotes the number of permutations of n different things ta...

    Text Solution

    |

  5. Consider the letters of the word 'MATHEMATICS' Possible number of wor...

    Text Solution

    |

  6. Consider the letters of the word 'MATHEMATICS Possible number of words...

    Text Solution

    |

  7. Consider the letters of the word 'MATHEMATICS Possible number of words...

    Text Solution

    |

  8. Column–I (A) In a plane a set of 8 parallel lines intersect a set of...

    Text Solution

    |

  9. Number of ways in which three numbers in AP can be selected from 1,2,3...

    Text Solution

    |

  10. The combinatorial coefficients ""^(n – 1)C(p) denotes

    Text Solution

    |

  11. 16 players P1,P2,P3,.. P16 take part in a tennis tounament. Lower suff...

    Text Solution

    |

  12. 16 players P(1),P(2),P(3),….P(16) take part in a tennis tournament. Lo...

    Text Solution

    |

  13. 16 players P(1),P(2),P(3),….P(16) take part in a tennis tournament. Lo...

    Text Solution

    |

  14. Which of the following statements are correct ?

    Text Solution

    |

  15. Identify the correct statement(s)

    Text Solution

    |

  16. The number of ways in which five different books to be distributed amo...

    Text Solution

    |

  17. Column–I (A) Four different movies are running in a town. Ten stude...

    Text Solution

    |

  18. There are 10 questions, each question is either True or False. Number ...

    Text Solution

    |