# Class 11 Maths Revision Notes for Permutations and Combinations of Chapter 7 â€“ Free PDF Download

Free PDF download of Class 11 Maths revision notes & short key-notes for Permutations and Combinations of Chapter 7 to score high marks in exams, prepared by expert mathematics teachers from latest edition of CBSE books.

 Chapter Name Permutations and Combinations Chapter Chapter 7 Class Class 11 Subject Maths Revision Notes Board CBSE TEXTBOOK MatheMatics Category REVISION NOTES

## CBSE Class 11 Maths Revision Notes for Permutations and Combinations of Chapter 7

Fundamental Principles of Counting
Multiplication Principle: Suppose an operation A can be performed in m ways and associated with each way of performing of A, another operation B can be performed in n ways, then total number of performance of two operations in the given order is mxn ways. This can be extended to any finite number of operations.
Addition Principle:Â If an operation A can be performed in m ways and another operation S, which is independent of A, can be performed in n ways, then A and B can performed in (m + n) ways. This can be extended to any finite number of exclusive events.
Factorial
The continued product of first n natural number is called factorial â€˜nâ€™.
It is denoted by n! or n! = n(n â€“ 1)(n â€“ 2)â€¦ 3 Ã— 2 Ã— 1 and 0! = 1! = 1
Permutation
Each of the different arrangement which can be made by taking some or all of a number of objects is called permutation.
Permutation of n different objects
The number of arranging of n objects taking all at a time, denoted byÂ nPn, is given byÂ nPnÂ = n!
The number of an arrangement of n objects taken r at a time, where 0 < r â‰¤ n, denoted by nPrÂ is given by
nPrÂ =Â $\frac { n! }{ \left( n-r \right) ! }$
Properties of Permutation

Important Results on Permutation
The number of permutation of n things taken r at a time, when repetition of object is allowed is nr.
The number of permutation of n objects of which p1 are of one kind, p2 are of second kind,â€¦ pk are of kth kind such that p1Â + p2Â + p3Â + â€¦ + pkÂ = n isÂ $\frac { n! }{ { { p }_{ 1 }!{ { p }_{ 2 }!{ p }_{ 3 }!.....{ p }_{ k }! } } }$
Number of permutation of n different objects taken r at a time,
When a particular object is to be included in each arrangement is r.Â n-1Pr-1
When a particular object is always excluded, then number of arrangements =Â n-1Pr.
Number of permutations of n different objects taken all at a time when m specified objects always come together is m! (n â€“ m + 1)!.
Number of permutation of n different objects taken all at a time when m specified objects never come together is n! â€“ m! (n â€“ m + 1)!.
Combinations
Each of the different selections made by taking some or all of a number of objects irrespective of their arrangements is called combinations. The number of selection of r objects from; the given n objects is denoted byÂ nCr, and is given by
nCrÂ =Â $\frac { n! }{ r!\left( n-r \right) ! }$
Properties of Combinations