Scribd
Upload
164 views2 pages

Revision Notes On Permutations: Permutation

Permutations refer to arrangements of objects in a specific order. The total number of permutations of n distinct objects is n!, also written as nPn. The number of permutations of n objects taken r at a time is nPr = n!/(n-r)!. Circular permutations consider arrangements where the clockwise and anticlockwise orders are different, with the number of such arrangements of n objects being (n-1)!.

Uploaded by

yasharthajha
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
164 views2 pages

Revision Notes On Permutations: Permutation

Permutations refer to arrangements of objects in a specific order. The total number of permutations of n distinct objects is n!, also written as nPn. The number of permutations of n objects taken r at a time is nPr = n!/(n-r)!. Circular permutations consider arrangements where the clockwise and anticlockwise orders are different, with the number of such arrangements of n objects being (n-1)!.

Uploaded by

yasharthajha
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

Revision Notes on Permutations

The concept of permutation is used for the arrangement of objects in a


specific order i.e. whenever the order is important, permutation is used.
The total number of permutations on a set of n objects is given by n! and is
denoted as nPn = n!
The total number of permutations on a set of n objects taken r at a time is
given by nPr = n!/ (n-r)!
The number of ways of arranging n objects of which r are the same is given
by n!/ r!
If we wish to arrange a total of n objects, out of which p are of one type, q
of second type are alike, and r of a third kind are same, then such a
computation is done as n!/p!q!r!
Al most all permutation questions involve putting things in order from a line
where the order matters. For example ABC is a different permutation to
ACB.
The number of permutations of n distinct objects when a particular object is
not to be considered in the arrangement is given by n-1Pr
The number of permutations of n distinct objects when a specific object is to
be always included in the arrangement is given by r.n-1Pr-1.
If we need to compute the number of permutations of n different objects, out
of which r have to be selected and each object has the probability of
occurring once, twice or thrice up to r times in any arrangement is given
by (n)r.
Circular permutation is used when some arrangement is to be made in the
form of a ring or circle.
When n different or unlike objects are to be arranged in a ring in such a
way that the clockwise and anticlockwise arrangements are different, then
the number of such arrangements is given by (n 1)!
Trans Web Educational Services Pvt. Ltd
B 147,1st Floor, Sec-6, NOIDA, UP-201301
Website:www.askiitians.com Email. info@askiitians.com
Tel:0120-4616500 Ext - 204

If n persons are to be seated around a round table in such a way that no


person has similar neighbor then it is given as (n 1)!
The number of necklaces formed with n beads of different colors
= (n 1)!
n
P0 =1
n P1 = n
nPn = n!/(n-n)! = n! /0! = n! /1= n!

Trans Web Educational Services Pvt. Ltd


B 147,1st Floor, Sec-6, NOIDA, UP-201301
Website:www.askiitians.com Email. info@askiitians.com
Tel:0120-4616500 Ext - 204

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy