Permutation & Combination
Download as PPTX, PDF45 likes37,680 views
The document covers permutations and combinations, detailing the fundamental principles of counting, definitions, theorems, and examples for both concepts. It explains how to calculate arrangements when order matters (permutations) and when it does not (combinations). Additionally, it provides specific examples illustrating various scenarios for better understanding of the application of these mathematical principles.
Permutation & Combination
- 2. Topics • Fundamental Principal of Counting. • Permutation – Theorem 1 – Theorem 2 – Theorem 3 – Examples • Combination – Examples
- 3. Fundamental Principal of Counting If an event can occur in ‘m’ different ways, following which another event can occur in ‘n’ different ways, then total number of events which occurs is ‘m X n’.
- 4. Example Rohan has 3 shirts and 2 pants, in how many are the combinations possible. He can select any shirt from 3 shirts and any pant from 3 pants. 3 ways 2 ways Total = 3 X 2 = 6 ways
- 5. Permutation per·mu·ta·tion A way, esp. one of several possible variations, in which a set or number of things can be ordered or arranged. Definition: A permutation is an arrangement in a definite order of a number of objects taken some or all at a time. Note: Whenever we deal with permutations order is important.
- 6. Theorem 1 Number of permutations of n different objects taken r at a time is:
- 7. Example How many different signals can be made by 3 flags from 4-flags of different colors? Here n= 4 and r =3 as we need to make a combination of 3 flags out of 4 flags. Therefore…
- 8. Analytically… = 4 ways = 3 ways = 2 ways 1 2 3 Total = 4 X 3 X 2 = 24 ways
- 9. Theorem 2 Number of permutations of ‘n’ different objects taken ‘r’ at a time, and repetition is allowed is: nr
- 10. Example How many 3 letter words with or without meaning can be formed by word NUTS when repetition is allowed? Any letter N/U/T/S can be filled here. Thus 4 ways. As repetition is allowed thus again any letter N/U/T/S can be filled here. Thus 4 ways. Similarly here also in 4 ways i.e. 4 X 4 X 4 = 64 word
- 11. How many 3 letter words with or without meaning can be formed by word NUTS when repetition is allowed? Solution: Here: n = 4 (no of letters we can choose from) r = 3 (no of letters in the required word) Thus by Theorem 2: nr = 43 = 64 Thus 64 words are possible
- 12. Theorem 3 The number of permutations of n objects where p1 objects are of one kind, p2 objects are of second kind… pk objects are of kTH kind is:
- 13. Example Find number of permutations of word ALLAHABAD. Here total number of word (n) = 9 Number of repeated A’s (p1)= 4 Number of repeated L’s (p2)= 2 Rest all letters are different. Thus applying theorem 3, we have:
- 14. Example In how many ways can 4 red, 3 yellow and 2 green discs be arranged in a row if the discs of the same color are indistinguishable ? Sol: Total number of discs are 4 + 3 + 2 = 9. Out of 9 discs, 4 are of the first kind (red), 3 are of the second kind (yellow) and 2 are of the third kind (green). Thus number of permutation is:
- 15. Example Find the number of arrangements of the letters of the word INDEPENDENCE. In how many of these arrangements, (i) do the words start with P (ii) do all the vowels always occur together (iii) do the vowels never occur together (iv) do the words begin with I and end in P? (v) Repeat part (iv) with I and P interchangeable.
- 16. Solution
- 19. (v) Repeat same parts as part (iv) As I and P are interchangable they can furthur be arranged in 2! ways. Thus 12600 X 2! = 25200 ways
- 20. Combinations com·bi·na·tion The act or an instance of combining; the process of being combined. Definition: A Combination is a selection of some or all of a number of different objects. It is an un-ordered collection of unique sizes. Note: Whenever we deal with combinations order is not important.
- 21. Combinations Suppose we have 3 teams . A,B and C. By permutation we have 3P2 = 6. But team AB and BA will be the same. Similarly BC and CB will be the same. And AC and CA are same. Thus actual teams = 3. This is where we use combinations.
- 22. Formula
- 23. Example A committee of 3 persons is to be constituted from a group of 2 men and 3 women. In how many ways can this be done? Here, order does not matter. Therefore, we need to count combinations. There will be as many committees as there are combinations of 5 different persons taken 3 at a time. Hence, the required number of ways =
- 24. Determining a question is of Permutation or Combination If the problem says " find in how many ways can they be Arranged / Lined Up, made, ...." then it is a problem on Permutations. If the problem says " find in how many ways can it/they be Selected / Chosen / Drawn / Taken/ grouped......" then, it is a problem on Combinations.