Home
Class 11
MATHS
In how many ways 5 persons can be seate...

In how many ways 5 persons can be seated in a row ?

Text Solution

Verified by Experts

The correct Answer is:
120 ways
Promotional Banner

Topper's Solved these Questions

  • COMBINATORICS AND MATHEMATICAL INDUCTION

    PREMIERS PUBLISHERS|Exercise EXERCISE 4.2|33 Videos

  • COMBINATORICS AND MATHEMATICAL INDUCTION

    PREMIERS PUBLISHERS|Exercise EXERCISE 4.3|37 Videos

  • COMBINATORICS AND MATHEMATICAL INDUCTION

    PREMIERS PUBLISHERS|Exercise PROBLEMS FOR PRACTICE (Choose the correct option for the following)|34 Videos

  • BINOMIAL THEOREMN,SEQUENCES AND SERIES

    PREMIERS PUBLISHERS|Exercise PROBLEMS FOR PRACTICE(Choose the correct option for the following)|31 Videos

  • DIFFEREMTIAL CALCULUS DIFFERENTIABILITY AND METHODS OF DIFFERENTITAION

    PREMIERS PUBLISHERS|Exercise PROBLEMS FOR PRACTICE|73 Videos

Similar Questions

Explore conceptually related problems

In how many ways five persons can stand in a row ?

In how many ways can 10 persons take seats in a row of 24 fixed seats so that no two persons take consecutive seats.

In how many ways 5 boys and 4 girls can be seated in a row so that no two girls are together.

There are 15 candidates for an examination . 7 candidates are appearing for mathematics examination while the remaining 8 are appearing for different subjects. In how many ways can they be seated in a row so that no two mathematics candidates are together ?

There are 15 candidates for an examination. 7 candidates are appearing for mathematics examination while the remaning 8 are appearing for different subjects. In how many ways can they be seated in a row so that no two mathematics candidates are together?

There are 15 candidates for an examination. 7 candidates are appearing for mathematics examination while the remaining 8 are appearing for different subjects . In how many ways can they be seated in a row so that no two mathematics candidates are together ?

PREMIERS PUBLISHERS-COMBINATORICS AND MATHEMATICAL INDUCTION-EXERCISE 4.1
  1. How many two - digit numbers can be formed using 1,2,3,4,5 with...

    Text Solution

    |

  2. There persons enter into a conference hall in which there are 10 sea...

    Text Solution

    |

  3. In how many ways 5 persons can be seated in a row ?

    Text Solution

    |

  4. A mobile has a pass code of distinct digits. What is the maximum nu...

    Text Solution

    |

  5. Given four flags of different colours, how many different signals can...

    Text Solution

    |

  6. Four children are running a race . (i) In how many ways can the...

    Text Solution

    |

  7. Four children are running a race . (i) In how many ways can the...

    Text Solution

    |

  8. Count the number of three - digit numbers which can be formed from t...

    Text Solution

    |

  9. Count the number of three - digit numbers which can be formed from t...

    Text Solution

    |

  10. How many three - digit numbers are there with 3 in the unit place ? ...

    Text Solution

    |

  11. How many three - digit numbers are there with 3 in the unit place ? ...

    Text Solution

    |

  12. How many numbers are three between 100 and 500 with the digits 0,1...

    Text Solution

    |

  13. How many numbers are three between 100 and 500 with the digits 0,1...

    Text Solution

    |

  14. How many three-digit odd numbers can be formed by using the digits 0...

    Text Solution

    |

  15. How many three-digit odd numbers can be formed by using the digits 0...

    Text Solution

    |

  16. Count the numbers between 999 and 10,000 subject to the condition that...

    Text Solution

    |

  17. Count the numbers between 999 and 10,000 subject to the condition that...

    Text Solution

    |

  18. Count the numbers between 999 and 10,000 subject to the condition that...

    Text Solution

    |

  19. How many three- digit numbers, which are divisible by 5, can be for...

    Text Solution

    |

  20. How many three- digit numbers, which are divisible by 5, can be for...

    Text Solution

    |