As an astute man Mr Gump once said, Life is like a box of chocolates.

You never k now what you re gonna get. The Permutations & Combinations that life presents us daily is baffling and probably it is because of that inherent fear of choices an d cases that we get intimidated by such questions in the CAT. I understand that P & C is one of the most dreaded topics but I hope that once you understand the fundas given below, your fear will reduce.

Funda 1: De-arrangement If n distinct items are arranged in a row, then the number of ways they can be rea rranged such that none of them occupies its original position is, n! * ((1/0!) (1/1!) + (1/2!) (1/3!) + ((-1)n/n!))

Note: De-arrangement of 1 object is not possible. Dearr(2) = 1; Dearr(3) = 2; Dearr(4) =12 Example, A person has eight letters and eight addressed envelopes corresponding to those letters. In how many ways can he put the letters in the envelopes such that exac tly 5 of them get delivered correctly? Solution, At first, select the five letters that get delivered correctly. That can be done in 8C5 ways. Now, the other three must get delivered to the wrong address. That can be done i n Dearr(3) = 2 ways. So, total ways is 2 x 8C5 = 2 x 56 = 112 ways. 4 + 1 = 9; Dearr(5) = 60 20 + 5 1 = 44

Funda 2: Partitioning n identical items in No restrictions: No group empty: n distinct objects in No restrictions: r distinct groups n+r-1Cr-1 n-1Cr-1 r distinct groups rn

Arrangement in a group is important: (n + r -1)! / (r-1)! Note: Other than standard distribution / partitioning problems, these ideas can

be used to solve questions in which number of solutions are asked. Example, How many solutions are there to the equation a + b + c = 100; given that a) b) a, b and c are whole numbers. a, b and c are natural numbers.

Solution, Case a) is identical to a case in which 100 identical chocolates are being distr ibuted in three kids a, b and c. It is possible that one kid gets all the chocol ates. In this case, we will use the formula for distributing ct groups where n = 100 and r = 3. So, it can be done in 102C2 ways. Case b) is identical to one in which 100 identical chocolates are being distribu ted in three kids a, b and c. Every kid must get at least one chocolate. In this case, we will use the formula for distributing n e no group is empty and n = 100 and r = 3. So, it can be done in 99C2 ways. Example, In how many ways can you distribute 5 rings in a) b) 4 boxes 4 fingers identical items in r distinct groups wher n identical items in r distin

Solution, First of all we need to identify the difference between distributing in boxes an d distributing in 4 fingers. The distinction is that in case of fingers, unlike boxes, the order in which rings are placed matters.

In Case a; Ring 1 can go in any of the four boxes, so it has four choices. Ring 2 can also go in any of the four boxes, so it has four choices. Similarly for Ri ng 3, Ring 4 and Ring 5; there are 4 choices each. So, the total number of ways of dis tribution is = 4 x 4 x 4 x 4 x 4 = 45. This is essentially how the formula rn is derived.

In Case b) Ring 1 can go in any of the four fingers, so it has 4 choices. Ring 2 can go in any of the four fingers but it has five choices. There is a finger, s

ay F3, which contains the ring R1. Now, on F3, R2 has two choices below R1. So, the total number of choices for R2 is 5. it can go above R1 or

Ring 3 can go in any of the four fingers but it now has 6 choices. Ring 4 can go in any of the four fingers but it will now have 7 choices. Ring 5 can go in any of the four fingers but it will now have 8 choices. So, the total number of way of distribution of rings is = 4 x 5 x 6 x 7 x 8 = 8! / 3! This is essentially how the formula (n + r -1)! / (r-1)! is derived.

Funda 3 Number of ways of arranging ke given that p + q + r = n OR Number of ways of distributing n p + q + r = n Is equal to, n! / (p! * q! * r!) I hope that this would help you solve problems in the exam. May be the chocolate you end up getting is a Bournville. Maybe you would have earned it. distinct items, in groups of size p , q and r n items, out of which p are alike, q are alike and r are

given t