P & C Part 1 (Permutations) Prepared by LENG KIEN YUEN 23 July 2011

My Keys to Master (Recommendation) It depends on how many skills (Indicated with number in circle, ie to ) that you have learned and understood, Ability to use all of them flexibly without any confusion, And common sense. Permutations An arrangement of objects in a particular order or a definite order. Order of the objects is important. For example, there are 6 permutations for Apple (A), Orange (O), and Pear (P). They are AOP, APO, OAP, OPA, PAO, and POA. Its like the number of ways / patterns of arranging these 3 fruits if all fruits are chosen. (My interpretation) Permutations are just about the PATTERN! Permutations With Repetition Each object can be chosen more than once. Rarely asked but easy. For example above, the permutations will be 27. They are AAA , AAO, AAP , AOA , AOO , AOP , APA , APO , APP , OAA , OAO , OAP , OOA , OOO , OOP , OPA , OPO , OPP , PAA , PAO , PAP , POA , POO , POP , PPA , PPO , and PPP. Permutation = n is number of objects r is number to be chosen to place in line. Permutations Without Repetition Each distinct object can be chosen only once. It is frequently asked! For example above, it is just the same. Since, Apple, Orange, and Pear are chosen only once.

Permutation = n is number of distinct objects r is number to be chosen to place in line. Only work when n r

Alternative Way (My Preference) 1. Drawing a row of square boxes. 2. Then, fill the boxes with number of selection. 3. I prefer it because it is flexible and easy to visualize. 4. Guide : How many options do you have?
1

P & C Part 1 (Permutations) Prepared by LENG KIEN YUEN 23 July 2011

Permutations With Repetition By using the example above, Apple (A), Orange (O), and Pear (P), 3 fruits are chosen with repetition. (That is n = 3, r = 3) 3 3 3

1) The number of options for 1st object is indicated in 1st square box. How many options do you have? Obviously, there are 3! Either A, O or P.

2) How many options do you have for 2nd object? Since repetition is allowed, there are 3.

3) How many options do you have for last object? It is still 3!

Permutations

consistent with the

With repetition, Mango (M) is added and 5 fruits are chosen. Similarly, with the same skill, we will have the following 4 4 4 4 4 Permutations where n = 4 (4 type of fruits), r = 5 Note: (It is also applicable if skill is used in other type of permutations) From the example above, the number of options for the nth object is indicated in nth square box (Left to Right). Besides that, the position of the object can be also represented by the position of the square box! With repetition, there Apple (A), Orange (O), and Pear (P), Mango (M) and 5 fruits are chosen. An apple is placed on the most left side. Orange is not placed on the most right side. 1 4 4 4 3
1) The position of the most left side is represented by the 1st box. How many options do you have? Only Apple, 1. 2) The most right side is represented by the last box. How many options do you have? 3 since all fruit except Orange! 2

P & C Part 1 (Permutations) Prepared by LENG KIEN YUEN 23 July 2011

Note: You are encouraged to settle those conditional cases first for simplicity! Permutations Without Repetition By using the example above again, Apple (A), Orange (O), and Pear (P), 3 fruits are chosen without repetition. (That is n = 3, r = 3) Using the same logic above 3 2 1

1) How many options do you have for 1st object? Obviously, there are 3! Either A, O or P.

2) How many options do you have for 2nd object? There are 2 since of one of the fruits is taken as 1st object. If A is the 1st object, then left O and P. If O is the 1st object, then left A and P. If P is the 1st object, then left A and O.

3) How many options do you have for last object? It is 1 since you left only 1 fruit.

Permutations

consistent with the

Without repetition, Mango (M) and Durian (D) are added and 3 fruits are chosen. 5 4 3 Permutations Note: I usually treat as number of way for n objects are placed into r number of space. Each space only contains one objects. Question (Guy Version) In a class, there are 10 seats which are arranged in a straight line. There are also 10 students which consist of 5 male students and 5 female students. One of the male student is elected as monitor. 3 of the female students are very pretty like superstars. At the first day, their teacher has ordered the monitor to arrange the seats for everyone.

P & C Part 1 (Permutations) Prepared by LENG KIEN YUEN 23 July 2011

Q1) At first, monitor thinks that if the seats are arranged randomly, then Number of ways of arrangement = ( Easy for the monitor)

Q2) After a while, a male student approaches monitor than requests to be seated between 2 pretty girls. 1. Determine the way of arrangement for a SMALL group of 3 consists of him and 2 pretty girls. 1 3 1 3 1 2
1) First of all, the male student need to be placed in the middle (Represented by the box in the middle). How many options do you have? 1, the only male student. 2) Then fill up the possible way of 3 pretty to be seated left and right of the male student. How many options do you have for left and then for right?

2. We still left 4 male student and 3 female students (1 Pretty ) to be arranged for seats. Besides that, we will treat the small group above as an object (TRICK!!). Hence we will have total of 8 objects (3 male, 2 female & a group). Number of this arrangement 8! Number of ways for the male student to be seated between 2 pretty girls

Q3) After some considerations, the monitor thinks that the male students should not have such privilege and should stay 1 seat away from 3 pretty girls. 6 1 5 Small Group (6 consists of 4 males and another 2 non-pretty females) 8 7 6 5 4 3 2 1 Big Group (Small group is treated as an object) Number of ways The monitor feels that these number above is not correct! Hints : The male student can also be seated either in most left or most right.
4

P & C Part 1 (Permutations) Prepared by LENG KIEN YUEN 23 July 2011

Q4) After a while, the monitor still cant figure out the correct answer but his thought is getting evil. Monitor thinks that he should be seated between pretty girls and the male student should stay 1 seat away from the pretty girls. Hint: You can create 2 small groups and then treated them as 2 object. Q5) After a moment, the 3 pretty girls are walking towards the monitor. While the monitor is looking at them, his thought is emptied. The 3 pretty girls request to be seated ONLY beside him and no negotiation. The monitor is getting frustrated because there are only maximum of 2 seats beside him. They are left and right ONLY. Number of ways The monitor is asking for solution? How many ways can it be done? Hint: What will you do if you are the monitor? Isnt it is a good idea to let one of the pretty girls sit on your thigh? 2 3 1 You have to sit at the middle with one of 3 pretty girls who sits on your thigh. Hence, fill 3 in the middle of 3 boxes. Problems Because of one of the pretty girls is sitting on your thigh, there will be an empty seat. Considering the small group as an object, then we will have 7 objects. Considering the seats, 3 for the small group and 6 for the others. Hence, 9 out of 10 seats are seated while there is an empty seat. Assuming the group only takes up 1 seat, there are 7 objects with 8 seats. Where n = 7, r =8, n < r. What to do? You may need the Ghost Method!

P & C Part 1 (Permutations) Prepared by LENG KIEN YUEN 23 July 2011

Permutation With Undistinguishable Objects (STPM, SPM can c also) The number of permutations of objects of which are of one kind, of second kind, ..., of kth kind is Objects of the same kind are not distinguishable. You cant differentiate them. This formula only works when all objects are selected. In other word, r = n where r is number of objects taken at a time. How many ways can 3 red flags (R) and 4 green (G) flags be placed side by side in the field? , , Permutations With only FIVE flags will be placed. (When n > r) 1. Determine the combinations of these five flags. Trick! 2. Determine the permutations for each combination and sum them together. The combination will be 3R2G, 2R3G, and 1R4G. Step1 For cases 3R2G & 2R3G Step 2 Permutations For case 1R4G Permutations Number of way Ghost Method (Named by Me) It is very effective in solving Permutation (Without Repetition) when n < r. In other words, there are more places than the objects placed. Hence, there will be empty places. For example, 8 students are to be seated in a straight row with 10 seats. There is 2 empty seats.
6

P & C Part 1 (Permutations) Prepared by LENG KIEN YUEN 23 July 2011

We assume that all ghosts are identical and we cant distinguish them from other ghosts. Important! If 8 students are to be seated randomly in a straight row with 12 seats, how many possible seating arrangement? Hence, there will be 4 empty seats. So, we can add 4 ghosts to be seated in these 4 empty seats. Trick! Now we have 8 students and 4 ghosts = 12 objects with 12 seats. With the method , you are able to find the answer! Circular Permutations It can be treated as normal Permutations (w/o Repetition) by fixing a position for an object. Trick! Then the rest are the same! The Fixed object acts as a benchmark and stops the rotation of the objects. Hence, the number of permutations of distinct objects arranged in a circle is . It wont affect small group but will affect the big group in if it is applied in circular permutations.
A B D A C D B C

For the normal permutations, they are different (ABCD, DABC, CDAB, & BCDA). But in circular permutations, they are identical since it can rotate. If the position of A is fixed, it cant rotate anymore and wont generate identical arrangement due to rotation. Redo the Question from the Salty monitor with the seats are arranged in the circular manner. Q1) Q2) The rest are yours!

P & C Part 1 (Permutations) Prepared by LENG KIEN YUEN 23 July 2011

Note: There is another proof, you will notice that if we just rotate the objects, we will have different arrangements in Normal Permutations but they are identical in Circular Permutations. Hence, .

Permutations in The Ring Clockwise and anti-clockwise arrangements are the considered identical. Hence, it shares all properties as Circular Permutation. The only different is the final answer is divided by 2. The number of permutations of distinct objects arranged in a ring is . Note: 1. I understood it based on keychain with few keys 2. Taking a keychain with keys (3 keys or more). 3. Label the keys with Alphabets, ie ABC. 4. Record down the sequence on a paper. 5. Then flip the keychain. 6. Record down the sequence again and compare with previous sequence. 7. They are actually identical! 8. Then compare those sequence with Circular Permutations. Sometimes, it is difficult to explain. Hope you can understand it via steps above. Having Fun!