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.
Moreover the card numbered 1 is always placed in envelope numbered 2. Find the number of ways in which this can be done.
Details
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The quick way is actually the explanation for the linear recurrence relation of Derangements.
Sorry but the quick way is not cheating. It's ingenious and I did it the same way.
Log in to reply
No, it's not cheating; it just felt that way, since it involved looking up the value for the number of derangements of six items rather than solving it from scratch. :)
Did it the second way because we were taught like that in school.. Personally I will always choose method 1 over any other method(Long) Great method @brian charlesworth .There's always more to learn and Brilliant always provides ample opportunities.
I did the first way.
How do you analytically verify that 1/5 of the derangements have card 1 in envelope 2?
Log in to reply
Among all the derangements, the number of derangements where card 1 lies in envelope 2 is the same as it lies in envelope 3, 4, 5 and 6. Therefore, we can reasonably divide 625 by 5.
Method 1: Using Inclusion exclusion principle
Total number of arrangements= 5 !
We need to subtract the cases when cards are in right places given that Card numbered 1 is always placed in envelope 2
Total number of ways= 5 ! − ( 4 ⋅ 4 ! − ( 2 4 ) ⋅ 3 ! + ( 3 4 ) ⋅ 2 ! − 1 ) = 5 3
Method 2: Dearrangement
If we place card 2 in envelope 1 then we need to dearrange 4 things which can be done in 9 ways (Because D 4 = 9 )
If card 2 doesn't go in 1 we need to dearrange 5 things which can be done in 4 4 ways.
Answer= 9 + 4 4 = 5 3
Great approaches, which are essentially the same due to using PIE to calculate Dearrangements.
What is D and how to calculate it?
Problem Loading...
Note Loading...
Set Loading...
The number of derangements of a set of 6 items is 2 6 5 .
One fifth of these will involve card 1 being placed in envelope 2 , giving us ( 5 1 ) ∗ 2 6 5 = 5 3 permutations under the given conditions.
--- if card 2 is placed in envelope 1 then we are left with a derangement of 4 items, namely 3 , 4 , 5 , 6 . There are 9 such permutations.
--- if card 2 is placed in one of envelopes 3 , 4 , 5 , 6 , say envelope n , and then card n is then placed in envelope 1 then we've formed a cycle, leaving us with 3 remaining items to derange in 2 possible ways. This gives us 4 ∗ 2 = 8 permutations.
--- if card 2 is placed in one of envelopes 3 , 4 , 5 , 6 , say envelope n , and then a card other than card n is placed in envelope 1 , then card n has 3 remaining envelopes in which it can be placed. The remaining two cards will then have just one way in which they can be placed in envelopes as required. This gives us a total of 4 ∗ 3 ∗ 3 = 3 6 permutations.
This gives us a total of 9 + 8 + 3 6 = 5 3 permutations as found before.