- the addition and multiplication principle
- permutations
- permutation with distinct objects
- permutation with identical objects
- permutation allowing repetition
- circular permutation
The addition and multiplication principle
- The addition principle is used in the case that you have a few different ways to complete a task.
- The multiplication principle is used in the case that you have different stages in a task and you have a few ways to complete each stage.
Permutation with distinct objects
- When you choose r objects from n distinct projects (the order of choosing matters), the no. of ways that you can do so is \[_{}^{n}\textrm{P}_{r}\]
In the another way, we can use the multiplication principle. To choose the first object, we have n choices , i.e. n no. of ways. To choose the second object, we are left with (n-1) choices, i.e. (n -1) ways. Hence, the no. of ways to choose r objects is n(n-1)(n-2)...(n-r+1)
- In the GC, you can find "nPr" in MATH -> PRB
Permutation with identical objects
- If we are to arrange r objects with r1 of type 1, r2 of type 2,... and rn of type n, where r1+r2+...rn=r, the no. of ways is given by r!/(r1!r2!...rn!)
- The rationale behind this formula:
r! is the no. of ways to arrange the objects if all of the objects are different. If some of them are identical, we actually overcount the no. of ways by a factor, which is the no. of ways we can arrange those identical objects.
Permutation allowing repetition
- If we choose r objects taken from n distinct objects in order, and each object can be used more than once, the no. of ways to do so is \[n^{r}\], since each time when we choose an object, we have n choices.
Circular permutation
- The no. of ways to arrange n distinct objects in a circle is (n-1)!
- The rationale behind the formula:
First of all, we can consider the permutation of n distinct objects, which is n!. However, when we arrange them in a circle, we found that some of the arrangement becomes identical. In fact, since we only care about the order in the clockwise manner and ignore the starting position, every identical arrange is repeated n times. Hence, in the end, the no. of different arrangement is n!/n, which is (n-1)!
Remark: circular permutation with identical objects do not have a general formula. You might want to think about the reason.