0% found this document useful (0 votes)
46 views2 pages

Permutations: Properties

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
0% found this document useful (0 votes)
46 views2 pages

Permutations: Properties

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/ 2

Properties

Permutations

Restricted Permutations
The number of ways in which r objects can be arranged from n
dissimilar objects if k particular objects are

● Always included (or never excluded) = n-kCr-k r! = rPk n-kPr-k.


● Always excluded (never included) = n-kCr r! = n-kPr

Distributions into Groups


Distribution of n distinct things into r groups G1, G2, …….., Gr
containing P1, P2, ….., Pr elements respectively.
Permutations
Arranging r objects out of n difference things ● Groups are distinct:
● When repetition is not allowed =
● Groups are identical:
where 0 ≤ r ≤ n
● When repetition is allowed = nr

Factorial Notation
Product of first n natural
numbers is denoted by n!
i.e., n! = n(n - 1)(n - 2) … 3⋅2⋅1
De-arrangements
Any change in the existing order of things is called
Combinations
Combinations
De-arrangement. If m things are arranged in a row, the ● Selecting r objects out of n
number of ways in which they can be deranged so that
difference things given by
none of them occupies its original place (no one of them Properties
occupies the place assigned to it) ➢ n
Pr = nCr r!, 0 ≤ r ≤ n
➢ For 0 ≤ r ≤ n, nCr = nCn-r
➢ For 1 ≤ r ≤ n, nCr + nCr-1 = n+1Cr
➢ n
Ca = nCb ⇒ a = b or n = a + b Fundamental Principle of Counting
n
In an operation A can be performed
➢ C0 + nC1 + … + nCn = 2n in m difference ways and another
operation B can be performed in n
difference ways. Then
Circular Permutations
● Both the operations can be
Restricted combinations (i) Arrangement of an difference things
The number of ways in which r objects can be selected performed in m × n ways.
taken all at a time in form of circle is
from n dissimilar objects if k particular objects are ● Either of the two operations
➔ (n - 1)!, if sense matter.
can be performed in (m + n)
● Always included = n-kCr-k = n-kCn--r ➔ ½(n - 1)!, if sense doesn’t matter ways.
n-k
● Never included (Always excluded) = Cr (ii) Number of circular permutations of n
dissimilar things taken r at a time
= nPr/r if clockwise and anticlockwise
orders are considered as difference.
= nPr/2r if clockwise and anticlockwise
order is considered as same.

You might also like