Permutation and Combination Concepts and FormulasPoints to Remember:1) Factorial: The factorial can be defined as the product of the number (for which we have to find factorial) by its successor till it reaches to one. We can write it as, n! (Factorial of n) = n (n1) (n2)....1 For example: The factorial of 3: 3! = 3*2*1 = 6 Note: The factorial of zero (0) is always 1 because an empty set can arrange in one way only.2) Permutation: It refers to the number of ways a particular set can be arranged, where order of the arrangement matters. A combination lock can be called a permutation lock. For example: i) Let we have three letters a, b, and c and we have to arrange two letters at a time. So, in this case, the permutations of the two letters = ab, ba, bc, cb, ac, and ca. ii) If we have to arrange all letters (a,b,c) simultaneously, the permutation would be: abc, acb, bac, bca, cab, and cba. Formula for calculating number of possible permutations of r things, from a set of n at a time is as follows: For example: i. ^{8}P_{3} = = = (8*7*6) = 336 ii. ^{7}P_{5} = = = 2520 iv. The number of permutations or arrangements of all n things at a time = n! (Factorial of n). 3) Combinations: It refers to the number of ways a particular set can be arranged, where order of the arrangement does not matter which means for a combination of the n number of things there may be different orders. Formula for calculating the possible combination for r things, from a set of n objects at a time is as follows: ^{n}C_{r} = = Note:i) ^{n}C_{n} = 1 ii) ^{n}C_{0} = 1 iii) ^{n}C_{r} = ^{n}C_{(nr)} For examples: i. ^{8}C_{3} = = = = (8*7) = 56 Or, ^{8}C_{3} = ^{8}C_{(83)} = ^{8}C_{5} = = 8*7 = 56 ii. ^{7}C_{5} = ^{7}C_{(75)} = ^{7}C_{2} = = 21 Note:
Note: xy and yx are same in the combination.
Permutation and Combination Test Paper 1 Permutation and Combination Test Paper 2
Next TopicPermutation and Combination Test Paper 1

Ansible
Mockito
Talend
Azure
SharePoint
Powershell
Kali Linux
OpenCV
Kafka
Pandas
Joomla
Reinforcement