Home
Class 12
MATHS
Ravish writes letters to his five friend...

Ravish writes letters to his five friends and addresses the corresponding envelopes. The number of ways can the letters be placed in the envelopes so that at least two of them are in the wrong envelopes is

A

44

B

59

C

119

D

120

Text Solution

Verified by Experts

The correct Answer is:
C
Promotional Banner

Topper's Solved these Questions

  • PERMUTATIONS & COMBINATIONS

    AAKASH SERIES|Exercise EXERCISE-II|229 Videos

  • PARTIAL FRACTIONS

    AAKASH SERIES|Exercise PRACTICE EXERCISE|31 Videos

  • PROBABILITY

    AAKASH SERIES|Exercise Practise Exercise|165 Videos

Similar Questions

Explore conceptually related problems

There are 3 letters and 3 addressed envelopes coorresponding to their . The number of ways in which the letters be placed in the envelopes so that no letter is in the right envelope is

The number of ways in which five different letters can be put in their five addressed envelopes so that all the letters are in the wrong envelopes is

Find the number of ways keeping 5 letters in 5 addressed envelopes

Find the number of ways in which 4 letters can be put in 4 addressed envelopes so that no letter goes into the envelope meant for it.

There are 5 letters and 5 addressed envelopes. If the letters are placed at random in the envelopes. Find the chance that atleast one letter goes into wrong envelope.

The number of ways in which four letters can be put in four addressed envelops so that no letter goes into envelope meant for it is

There are 6 letters and 6 addressed envelopes . If the letters are put at random in the envelopes , the probability that all the letters may be placed in wrongly addressed envelopes is

AAKASH SERIES-PERMUTATIONS & COMBINATIONS-PRACTICE EXERCISE
  1. The number of ways that all the letters of the word SWORD can ...

    Text Solution

    |

  2. The number of ways of 5 letters put in 5 addressed envelopes so that o...

    Text Solution

    |

  3. Ravish writes letters to his five friends and addresses the correspond...

    Text Solution

    |

  4. Statement-I : The number of ways of arranging the letters of the word ...

    Text Solution

    |

  5. If a, b, c are the number of functions, injections, constant functions...

    Text Solution

    |

  6. Match the following {:("Word","Number of permutations by using all t...

    Text Solution

    |

  7. Assertion (A) : There are three doors to a room. The number of ways in...

    Text Solution

    |

  8. If ""^(35)C(n+7)=""^(35)C(4n-2), then all the values of n are given by

    Text Solution

    |

  9. IF ""^(15)C(r+3)=""^(15)C(2r-3), then r=

    Text Solution

    |

  10. ""^(n-2)C(r)+2.""^(n-2)C(r-1)+""^(n-2)C(r-2) is equal to

    Text Solution

    |

  11. If ""^(18)C(r)=""^(18)C(r+2) then ""^(R )C(5)=

    Text Solution

    |

  12. If ""^(n)C(4)=""^(n)C(8), then ""^(n)C(2) is

    Text Solution

    |

  13. ""^(29)C(5)+sum(r=0)^(4)""^((33-r))C(4)=

    Text Solution

    |

  14. ""^(15)C(8)+""^(15)C(9)-""^(15)C(6)-""^(15)C(7) is equal to

    Text Solution

    |

  15. If ""^(18)C(15)+2(""^(18)C(16))"+"^(17)C(16)+1=""^(n)C(3) then n is

    Text Solution

    |

  16. ""^(14)C(4)+sum(j=1)^(4)""^((18-j))C(3) is equal to

    Text Solution

    |

  17. If p and q are the greatest values of ""^(2n)C(r) and ""^(2n-1)C(r) re...

    Text Solution

    |

  18. If ""^(n+1)C(3)=4(""^(n)C(2)), then n is equal to

    Text Solution

    |

  19. ""^(2n)C(2)-2""^(n)C(2)=

    Text Solution

    |

  20. The least positive integral value of x which satisfies the inequality ...

    Text Solution

    |