Professional Documents
Culture Documents
DEFINITIONS, CONCEPTS AND FORMULAE 16. The number of one-one functions that can be
defined from set A into set B is n(B)Pn(A).
1. Permutation : An arrangement that can be formed
17. The number of onto functions that can be defined
by taking some or all of a finite set of things is
from set A onto set B if n(A) = n and n(B) = 2, is
called ‘permutation’.
2n-2.
2. A permutation is said to be a ‘linear permutation’
18. The number of bijections that can be defined from
if the objects are arranged in a line.
set A onto A is [n(A)]!.
3. Fundamental principle or counting principle : If an
19. Combination : A selection that can be formed by
operation can be done in ‘m’ ways and second
taking some or all of a finite set of things is called
operation can be done is ‘n’ ways then the two
a combination.
operations can be done in ‘mn’ ways.
4. The number of permutations of ‘n’ dissimilar things n!
taken r(rn) things at a time is 20. nCr = (n - r)! r! .
n!
n
Pr = n(n - 1) (n - 2) ..... (n - r + 1) = (n - r)! 21. nCo = 1, nCn = 1, nC1 = n, nCr = nCn-r.
5. nPr = r. n-1Pr-1 + n-1Pr.
n n
Pr Cr n - r +1
6. The number of permutations of ‘n’ dissimilar things 22. r! = n , n =
Cr Cr -1 r
taken all at a time = npn = n! (when repetitions are
not allowed).
23. nCr+nCr-1 = n+1Cr.
7. The number of permutations of ‘n’ things taken ‘r’ AIMS
24. If nCr = nCs then r = s or n = r + s.
at a time, when repetition of things is allowed any
number of times is nr. 25. The number of ways in which (m+n) things can
be divided into two different groups of m and n
8. The number of permutations of n dissimilar things taken
‘r’ at a time with atleast one repetition is nr - nPr. (m + n)!
things respectively is m! n!
9. The number of permutations of ‘n’ things taken
all at a time when p of them are alike and rest 26. The number of ways in which 2n things can be
n! divided
all are different is .
P! (2n)!
10. If p things are alike of first kind, q things are alike i) into two equal groups of n things each is .
2!(n!)2
of second kind, r things are alike of third kind,
then the number of permutations formed with p+q+r (2n)!
ii) among two persons equally is
(p + q + r)! (n!)2
things is p! . q! . r! .
27. The number of ways in which (m+n+p) things can
11. A permutation is said to be a ‘circular permutation’ be divided into three different groups of m, n and p
if the objects are arranged in the form a circle (or (m + n + p)!
a closed curve). things respectively is m!n!p!
12. The number of circular permutations formed with
28. The number of ways in which 3n things can be
n
Pr divided
‘n’ objects taken ‘r’ at a time is .
r
(3n)!
13. The number of circular permutations formed with i) into three equal groups of n things each is
3!(n!)3
‘n’ objects (persons) is (n-1)!.
(3n)!
14. The number of circular permutations with ‘n’ ii) among three persons equally is .
(n!)3
1
dissimilar flowers (beads etc.) is (n-1)!. 29. The total number of combinations of p+q things
2
taken any number of things at a time when p things
15. The number of functions that can be defined from are alike of one kind and q things are alike of
set A into set B is n(B)n(A).
56 ! 51 r ! 30800 6 elements.
x A: Required number of injections (one - one functions).
50 r ! 54 !
= n(B)
Pn(A) = 6P4 = 6.5.4.3 = 360.
56 55 54 ! 51 r 50 r !
x 30800
50 r ! 54 ! 10.Find the number of surjections from a set A
containing 6 elements onto a set B containing
56 55 51 r 30800 2 elements.
30800 A: Required no. of surjections (onto functions)
51 4 51 r 10 r 41 .
56 x 55 = 2n(A) - 2 - 26 - 2 = 64 - 2 = 62.
4. In a class there are 30 students. On the New 11. Find the number of bijections from a set A
Year day, every student posts a greeting card containing 7 elements into itself.
to all his/her classmates. Find the total number A: Required number of bijections - n(A)! = 7!..
of greeting cards posted by them.
A: Total number of greeting cards posted by the 12.Find the number of ways of arranging 7 gents,
students = 30
P2 = 30 x 29 = 870. 4 ladies around a circular table if no two ladies
wish to sit together.
5. If there are 25 railways stations on a railway A: First we arrange 7 gents around a circular table as
line, how many types of single second class
(7 - 1)! = 6!.
tickets must be printed, so as to enable a
passenger to travel from one station to In between there are 7 gaps, these 7 gaps can be
another. filled with 4 ladies as 7P4 ways.
AIMS
A: The number of single second class tickets must Total number of ways = 6! x 7P4.
be printed = 25P2 = 25 x 24 = 600.
13.Find the number of ways of arranging the
6. Find the number of ways in which 4 letters letters of the word
can be put in 4 addressed envelopes so that i) INDEPENDENCE
no letter goes into the envelop meant for it. ii) INTERMEDIATE
A: Formula : The number of dearrangements of ‘n’ iii) PERMUTATION
distinct things is iv) COMBINATION
1 1 1 1 n 1 A: Given word contains 12 letters
n! ........... 1
2! 3! 4! 5! n! In which there are 3N’s, 2D’s, 4E’s
1 1 1 12!
Required number of ways = 4! The number of required arrangements =
2! 3! 4! 3!2! 4!
1 1 1 12 4 1 ii) The no. of letters in the word
24 24 24 9.
2 6 24
‘INTERMEDIATE’ = 12
7. Find th number of palindromes with 6 digits In this there are 2I’s, 2T’s, 3E’s.
that can be formed using the digits 12!
(i) 0, 2, 4, 6, 8 (ii) 1, 3, 5, 7, 9 The number of required arrangements = .
2!2!3!
A: (i) The number of palindromes formed
= 4 x 54/2 = 4 x 52 = 100. iii) Given word ‘PERMUTATION’ contains 11 letters
(ii) The number of palindromes formed in which there are 2T’s
= 56/2 = 53 = 125. (11)!
The number of required arrangements = .
2!
8. Find the number of functions from a set A
iv) Given word ‘COMBINATION’ contains 11 letters.
containing 5 element s into a set B containing
4 elements. In which there are 2O’s, 2I’s, 2N’s
A: Required number of functions = [n(B]n(A) The number of required arrangements =
= 45 = 1024.
8x7x6x5 5x4x3
70 x 10 700 . LEVEL II (SAQ)
4 x 3 x 2 x1 3 x 2 x1
1. If the letters of the word PRISON are permuted
16.Find the number of parallelograms formed by in all posible ways and the words thus formedAIMS
the set of ‘m’ parallel lines intersects an other are arranged in dictionary order, find the rank
set of ‘n’ parallel lines. of the word ‘PRISON’.
A: We shall find the rank of the word ‘PRISON’.
Alphabetical order of the letters is INOPRS.
No. of 6 letter words formed which being with ‘’ = 5!
No. of 6 letter words formed which being with ‘N’ = 5!
A: A parallelogram is formed with 2 lines from the
first set of ‘m’ lines and 2 lines from the second No. of 6 letter words formed which being with ‘O’ = 5!
set of ‘n’ lines. No. of 6 letter words formed which being with ‘P’ = 4!
The number of required parallelograms = C2 x C2.m n No. of 6 letter words formed which being with ‘PN’ = 4!
17.If there are 5 alike pens, 6 alike pencils and 7 No. of 6 letter words formed which being with‘PO’ = 4!
alike erasers, find the no. of ways of selecting No. of 6 letter words formed which being with ‘PRN’ = 2!
any number of (one or more) things out of
them. No. of 6 letter words formed which being with ‘PRO’ = 2!
A: Formula: If ‘p; things are alike of one kind ‘q’ things No. of 6 letter words formed which being with ‘PRSN’ = 1!
are alike of second kind and ‘r’ things are alike of Next word formed is PRISON = 1.
third kind then the no. of ways of selecting any number Rank of ‘PRISON’.
of things (one or more) is (p + 1) (q + 1) (r + 1) -1. = 3(5!) + 3(4!) + 2(2!) + 1 + 1.
The required number of ways = 3(120) + 3(24) + 2(2) + 1 + 1.
= (5 + 1) (6 + 1) (7 + 1) - 1 = 360 + 72 + 4 + 2
= 6.7.8 - 1 = 336 - 1 = 335. = 438.
18.Find the no. of zeros in 100!
2. There are 9 objects and 9 boxes. Out of 9
A: 100! 2 35 7................ 100 22 x 52
objects, 5 cannot fit in three small boxes. How
where
many arrangements can be made such that
100 100 100 100 100 100
each object can be put in one box only.
2 22 23 24 25 26
A: 5 big objects can be put in 6 big boxes in 6P5 ways.
10 Permutations and Combinations
Second Year Maths - IIA AIMSTUTORIAL
Then 4 small objects can be put 1 big box and 3 A: Now 12Cr+1 = 12C3r-5
small boxes in P4 ways.
4
r = s or n = r + s.
By the counting principle, total number of required r + 1 = 3r - 5 12 = r + 1 + 3r - 5
arrangements = 6P5 x 4! 2r = 6 4r = 16
= 720 x 24 r = 3 r=4
= 17280. r = 3 or 4