## Tuesday, May 6, 2008

### Permutations and Combinations-3 - Revision Points

Revision Points (Text R.D. Sharma)

8.6 Permutations of Objects not all Distinct

Theorems and Formulas

Theorem
The number of mutually distinguishable permutations of n things, taken all at a time, of which p are alike of one kind, q alike of second such that p+q = n, is

n!/p!q!

Formulas based on the above theorem

1. The number of mutually distinguishable permutations of n things, taken all at a time, of which p1 are alike of one kind, p2 alike of second,…, pr alike of of rth kind such that p1+p2+…pr = n, is

n!/p1!p2!…pr!

2. The number of mutually distinguishable permutations of n tings, of which p are alike of one kind, q alike of second and remaining all are distinct is
n!/p!q!

3. suppose there are r things to be arranged, allowing repetitions. Let further p1,p2,…,pr be the integers such that the first object occurs exactly p1 times, the second occurs exactly p2 times, etc. Then the total number of permutations of these r objects to the above condition is

(p1+p2+…+pr)!/p1!p2!…pr!

8.7 Permutations when Objects can Repeat
Theorem
The number of permutations of n different things, taken r at a time, when each may be repeated any number of times in each arrangement is n2 .

8.8 Circular Permutations
If we arrange objects along a closed curve for example a circle, the permutations are known as circular permutations. In a circular permutation, we have to consider one object as fixed and the remaining are arranged as in case of linear arrangement.

Linear arrangement is arrangement in a row.

Theorem
The number of circular permutations of n distinct objects is (n-1)!.

Anti-clock wise and clockwise order of arrangements are considered as distinct permutations in the above theorem.

If the anticlockwise and clockwise order is not distinct as in case of a garland which can be turned over easily, the number of distinct permutations will be ½ (n-1)!..