Home
Class 12
MATHS
A person writes letters to six friends a...

A person writes letters to six friends and addresses the corresponding envelopes. Let x be the number of ways so that atleast two of the letters are in wrong envelopes and y be the number of ways so that all the letters are in wrong envelopes. Then, x-y is equal to

A

719

B

265

C

454

D

None of these

Text Solution

Verified by Experts

The correct Answer is:
C
Promotional Banner

Similar Questions

Explore conceptually related problems

Let N denotes the number of ways in which 3n letters can be selected from 2n A's, 2nB's and 2nC's. then,

If the number of ways of selecting n cards out of unlimited number of cards bearing the number 0,9,3, so that they cannot be used to write the number 903 is 96, then n is equal to

The number of ways the letters of the word PERSON cann be placed in the squares of the figure shown so that no row remain empty is

There letters are dictated to three persons and an envelope is addressed to each of them, the letters are inserted into the envelopes at random so that each envelope contains exactly one letter. Find the probability that at least one letter is in its proper envelope.

Find the number of different 8-letter arrangements that can be made from the letters of the word DAUGHTER so that all vowels do not occur together.

In how many ways can the letters of the word ASSASSINATION be arranged so that all the S's are together?

Find the number of different 8-letter arrangements that can be made from the letters of the word DAUGHTER so that all vowels occur together .

Let n be 4-digit integer in which all the digits are different. If x is the number of odd integers and y is the number of even integers, then

Six cards and six envelopes are numbered 1, 2, 3, 4, 5, 6 and cards are to be placed in envelopes so that each envelope contains exactly one card and no card is placed in the envelope bearing the same number and moreover cards numbered 1 is always placed in envelope numbered 2. Then the number of ways it can be done is

A man has three friends. The number of ways he can invite one friend everyday for dinner on six successive nights so that no friend is invited more than three times is