Home
Class 11
MATHS
Number of ways in which 7 people can occ...

Number of ways in which 7 people can occupy 6 seats, 3 seats on each side in a first class railway compartment if two specified persons are to be always included and occupy adjacent seats on the same side is `(5!)dotk ,t h e nk` has the value equal to ___________.

Text Solution

AI Generated Solution

Promotional Banner

Topper's Solved these Questions

  • LOGARITHM

    CENGAGE ENGLISH|Exercise All Questions|173 Videos

  • PROBABILITY

    CENGAGE ENGLISH|Exercise All Questions|1 Videos

Similar Questions

Explore conceptually related problems

In how many ways can 5 persons occupy 3 vacant seats ?

The number of ways in which 5 boys and 3 girls can be seated in a row, so that no two girls sit together is

Find the number of ways in which 5 boys and 3 girls can be seated in a row so that no two girls are together.

Find the number of ways in which six persons can be seated at a round table, so that all shall not have the same neighbours n any two arrangements.

Find the number of ways in which six persons can be seated at a round table, so that all shall not have the same neighbours n any two arrangements.

Find the number of ways in which 3 boys and 3 girls can be seated on a line where two particular girls do not want to sit adjacent to a particular boy.

The number of ways in which 10 boys can take positions around a circular round table, if two particular boys must not be seated side by side, is

The number of ways in which 5 boys and 3 girls can be seated on a round table if a particular boy B_(1) and a particular girl G_(1) never sit adjacent to each other is

There are 10 seats in the first row of a theatre of which 4 are to be occupied. The number of ways of arranging 4 persons so that no two persons sit side by side is:

A tea party is arranged for 2m people along two sides of a long table with m chairs on each side, r men wish to sit on one particular side and s on the other. IN how many ways can they be seates ? [r,s,lem]

CENGAGE ENGLISH-PERMUTATIONS AND COMBINATIONS-All Questions
  1. If alpha=^m C2,t h e n^(alpha)C2 is equal to a. ^m+1C4 b. ^m-1C4 ...

    Text Solution

    |

  2. Statement 1: ((n^2)!)/((n !)^n) is natural number of for all n in ...

    Text Solution

    |

  3. Number of ways in which 7 people can occupy 6 seats, 3 seats on each...

    Text Solution

    |

  4. There are 20 books on Algebra and Calculus in one library. For the ...

    Text Solution

    |

  5. Let Pn denotes the number of ways in which three people can be selecte...

    Text Solution

    |

  6. An n-digit number is a positive number with exactly n Nine hundred dis...

    Text Solution

    |

  7. There are 2 women participating in a chess tournament. Every partic...

    Text Solution

    |

  8. Five balls of different color are to be placed in three boxes of dif...

    Text Solution

    |

  9. A seven-digit number without repetition and divisible by 9 is to be fo...

    Text Solution

    |

  10. n is selected from the set {1, 2, 3,.............,100} and the number ...

    Text Solution

    |

  11. Messages are conveyed by arranging four white, one blue, and three ...

    Text Solution

    |

  12. 20 persons are sitting in a particular arrangement around a circula...

    Text Solution

    |

  13. The number of three digit numbers of the form xyz such that x lt y , z...

    Text Solution

    |

  14. A is a set containing n different elements. A subset P of A is chosen....

    Text Solution

    |

  15. Numbers greater than 1000 but not greater than 4000 which can be fo...

    Text Solution

    |

  16. Find 5C2

    Text Solution

    |

  17. The number less than 1000 that can be formed using the digits 0, 1,...

    Text Solution

    |

  18. A variable name in certain computer language must be either an alph...

    Text Solution

    |

  19. The number of five-digit numbers that contain 7 exactly once is a. ...

    Text Solution

    |

  20. The total number of flags with three horizontal strips in order, whi...

    Text Solution

    |