Scribd
Upload
29 views7 pages

Unit 4

This document covers the principles of counting, including the multiplication and addition principles, and defines factorial, permutations, and combinations. It outlines important results and properties related to permutations and combinations, including circular permutations and the total number of ways to select items. The document emphasizes the mathematical formulations for calculating permutations and combinations of distinct and identical objects.

Uploaded by

mevoni8999
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
29 views7 pages

Unit 4

This document covers the principles of counting, including the multiplication and addition principles, and defines factorial, permutations, and combinations. It outlines important results and properties related to permutations and combinations, including circular permutations and the total number of ways to select items. The document emphasizes the mathematical formulations for calculating permutations and combinations of distinct and identical objects.

Uploaded by

mevoni8999
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

UNIT-4

Permutations and Combinations

Fundamental Principles of Counting


Multiplication Principle
If first operation can be performed in m ways and then a second operation can be
performed in n ways. Then, the two operations taken together can be performed in
mn ways. This can be extended to any finite number of operations.

Addition Principle
If first operation can be performed in m ways and another operation, which is
independent of the first, can be performed in n ways. Then, either of the two
operations can be performed in m + n ways. This can be extended to any finite
number of exclusive events.

Factorial
For any natural number n, we define factorial as n ! or n = n(n – 1)(n – 2) … 3 x 2 x 1
and 0!=
1!= 1

Permutation
Each of the different arrangement which can be made by taking some or all of a
number of things is called a permutation.

Mathematically The number of ways of arranging n distinct objects in a row taking r (0 ≤


r ≤ n) at a time is denoted by P(n ,r) or npr

Properties of Permutation
Important Results on Permutation
1. The number of permutations of n different things taken r at a time,
allowing repetitions is nPr.
2. The number of permutations of n different things taken all at a time is nPn= n!
3. The number of permutations of n things taken all at a time, in which p are alike
of one kind, q are alike of second kind and r are alike of third kind and rest are different is

.
4. The number of permutations of n things of which p1 are alike of one kind
p2 are alike ofsecond kind, p3 are alike of third kind,…, Pr are alike of rth kind
such that p1 + p2 + p3 +…+pr = n

is .
Circular Permutation
In a circular permutation, firstly we fix the position of one of the objects and then
arrange the other objects in all possible ways.

(i) Number of circular permutations of n different things taken all at a time


is (n -1)!

(ii) Number of circular permutations of n different things taken all at a time,

when clockwise or anti-clockwise order is not different .

(iii) If we mark numbers 1 to n on chairs in a round table, then n persons


sitting around table is n!.

Combination
Each of the different groups or selections which can be made by some or all of a
number of given things without reference to the order of the things in each group is
called a combination.

Mathematically
The number of combinations of n different things taken r at a time is
Properties of Permutation

Important Results on Combination


▪ The total number of ways of selection of some or all of n things at a time is nC1 +
n
C2 +….+ nn1 = 2n — 1.
▪ The number of selections of r objects out of n identical objects is 1.
▪ Total number of selections of zero or more objects from n identical objects is n + 1.

You might also like