JEE (Advanced) 2014 Combinatorics

Six cards and six envelopes are numbered 1 , 2 , 3 , 4 , 5 , 6 , 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 \textbf{Details}


The answer is 53.

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.

2 solutions

  • Quick way, (i.e., by cheating)

The number of derangements of a set of 6 6 items is 265 265 .

One fifth of these will involve card 1 1 being placed in envelope 2 2 , giving us ( 1 5 ) 265 = 53 (\frac{1}{5}) * 265 = \boxed{53} permutations under the given conditions.

  • Long way: We need to look at some cases:

--- if card 2 2 is placed in envelope 1 1 then we are left with a derangement of 4 4 items, namely 3 , 4 , 5 , 6 3, 4, 5, 6 . There are 9 9 such permutations.

--- if card 2 2 is placed in one of envelopes 3 , 4 , 5 , 6 3, 4, 5, 6 , say envelope n n , and then card n n is then placed in envelope 1 1 then we've formed a cycle, leaving us with 3 3 remaining items to derange in 2 2 possible ways. This gives us 4 2 = 8 4*2 = 8 permutations.

--- if card 2 2 is placed in one of envelopes 3 , 4 , 5 , 6 3, 4, 5, 6 , say envelope n n , and then a card other than card n n is placed in envelope 1 1 , then card n n has 3 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 = 36 4*3*3 = 36 permutations.

This gives us a total of 9 + 8 + 36 = 53 9 + 8 + 36 = \boxed{53} permutations as found before.

Moderator note:

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.

Krishna Ar - 6 years, 7 months ago

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. :)

Brian Charlesworth - 6 years, 7 months ago

Log in to reply

:D (Brilliant doesnt allow me to stop with this)

Krishna Ar - 6 years, 7 months ago

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.

pranav jangir - 6 years, 3 months ago

I did the first way.

Prakhar Gupta - 6 years, 7 months ago

How do you analytically verify that 1/5 of the derangements have card 1 in envelope 2?

john c - 6 years, 6 months ago

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.

Christopher Boo - 6 years, 1 month ago
Ravi Dwivedi
Jul 10, 2015

Method 1: Using Inclusion exclusion principle

Total number of arrangements= 5 ! 5!

We need to subtract the cases when cards are in right places given that Card numbered 1 1 is always placed in envelope 2 2

Total number of ways= 5 ! ( 4 4 ! ( 4 2 ) 3 ! + ( 4 3 ) 2 ! 1 ) = 53 5! - (4 \cdot 4! -{4 \choose 2} \cdot 3! + {4 \choose 3}\cdot 2! -1) =53

Method 2: Dearrangement

If we place card 2 2 in envelope 1 1 then we need to dearrange 4 4 things which can be done in 9 9 ways (Because D 4 = 9 D_{4}=9 )

If card 2 2 doesn't go in 1 1 we need to dearrange 5 5 things which can be done in 44 44 ways.

Answer= 9 + 44 = 53 9+44=\boxed{53}

Moderator note:

Great approaches, which are essentially the same due to using PIE to calculate Dearrangements.

What is D D and how to calculate it?

MD Omur Faruque - 5 years, 9 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...