Home
Class 12
MATHS
There are three pigeon holes marked M, P...

There are three pigeon holes marked M, P, C. The number of ways in which we can put 12 letters so that 6 of them are in M, 4 are in P and 2 are in C is

A

2520

B

13860

C

12530

D

25220

Text Solution

Verified by Experts

The correct Answer is:
B
Promotional Banner

Topper's Solved these Questions

  • PERMUTATIONS AND COMBINATIONS

    MCGROW HILL PUBLICATION|Exercise EXERCISE (LEVEL 2) Single Correct Answer Type Questions |13 Videos

  • PERMUTATIONS AND COMBINATIONS

    MCGROW HILL PUBLICATION|Exercise EXERCISE (LEVEL 2) Numerical Answer Type Questions |23 Videos

  • PERMUTATIONS AND COMBINATIONS

    MCGROW HILL PUBLICATION|Exercise EXERCISE (Concept-based) Single Correct Answer Type Questions |10 Videos

  • PARABOLA

    MCGROW HILL PUBLICATION|Exercise QUESTIONS FROM PREVIOUS YEARS. B-ARCHITECTRE ENTRANCE EXAMINATION PAPERS|9 Videos

  • PROBABILITY

    MCGROW HILL PUBLICATION|Exercise Previous Years B-Architecture Entrance Examination Papers|21 Videos

Similar Questions

Explore conceptually related problems

Find the number of ways in which one can post 4 letters in 6 letter boxes.

If m the number of ways in which we can arrange 3 letters of the word SUDESH then m/36 is

The number of ways in which we can distribute 12 books to A, B, C such that A and B together get twice as many as C is

The number of ways in which n distinct balls can be put into three boxes, is

There are 10 different books in a shelf. The number of ways in which three books can be selected so that exactly two of them are consecutive is

If the number of ways in which 7 letters can be put in 7 envelopes such that exactly four letters are in wrong envelopes is N, then

There are 5 letters and 5 directed envelopes. The number of ways in which all the letters can be put in wrong envelope is

There are p letters a,q letters b,retters C.The number of ways of selecting k letters out of these if p

Find the number of ways in which 4 distinct balls can be put into 3 distinct boxes so that no remains empty

MCGROW HILL PUBLICATION-PERMUTATIONS AND COMBINATIONS -EXERCISE (LEVEL 1) Single Correct Answer Type Questions
  1. The product of n consecutive natural number is always divisible by

    Text Solution

    |

  2. Six X have to be placed in the squares of Fig. 6.6 such that each row ...

    Text Solution

    |

  3. There are three pigeon holes marked M, P, C. The number of ways in whi...

    Text Solution

    |

  4. The greatest number of points of intersection of n cicles and m straig...

    Text Solution

    |

  5. The number of binary sequences of length n that contain even number of...

    Text Solution

    |

  6. The number of natural numbers with distinct digits is

    Text Solution

    |

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

    Text Solution

    |

  8. The units digit of 17^(2009)+11^(2009)-7^(2009) is

    Text Solution

    |

  9. If (1)/(""^(4)C(n))=(1)/(""^(5)C(n))+(1)/(""^(6)C(n)), then value of n...

    Text Solution

    |

  10. At an election there are five candidates and three members are to be e...

    Text Solution

    |

  11. If n is odd and ""^(n)C(0)lt ""^(n)C(1)lt""^(n)C(2)lt …lt""^(n)C(r), t...

    Text Solution

    |

  12. The number of arrangements of the letters of the word BANANA in which ...

    Text Solution

    |

  13. The number of (staircase) paths in the xy-plane from (0, 0) to (7, 5) ...

    Text Solution

    |

  14. In Question 47, how many such paths are there if each path must pass t...

    Text Solution

    |

  15. The number of ways we can put 5 different balls in 5 different boxes s...

    Text Solution

    |

  16. The number of ordered pairs of integers (x, y) satisfying the equation...

    Text Solution

    |

  17. The number of the factors of 20! is

    Text Solution

    |

  18. The number of five digit numbers that can be formed by using digits 1,...

    Text Solution

    |

  19. Let S(n)=sum(r=1)^(n)r!. If T(n)=S(n)-7[(S(n))/(7)], where [x] denotes...

    Text Solution

    |

  20. The number of ordered pairs (m, n), m, n in {1, 2, …,50} such that 6^(...

    Text Solution

    |