- Iia-2. Theory of Equations
- Iia 3. Matrices
- IIA-1. Quadratic Expressions Final
- IB-08Planes(36-40)
- IB 03change Axes(8 10)
- IB 14tanget Normal(66 70)
- 04_1PROBABILITY
- Iib-9.Definite Integration 69-79
- Iib-3.Parabola 18-29
- 04_2random Variable and Distributions
- IB-05pair-straightlines(17-24)
- IA 15propeties of Triangles(69 78)
- IIB-1.Circles 1-10
- 01 4binomial Theorem
- Iib-2.System of Circles _11-17
- IB-06three_di_geometry(25-28)
- 02_5HYPERBOLA_37-43_
- IA-05Vector Product of Two Vectors(28-30)
- 03 Indefinite Integration 53-68
- IA 17complex Numbers(86 95)
- IA-09multiple and Sub Multiple Angles(45-47)
- IB-07Direction Ratios and Direction Cosines(29-35)
- IIB-4. ELLIPSE_30-36_
- IB 01 Coordinate System(1 5)
- IB 04 Straight Lines(11 16)
- 03 5 Differential - Equations 84-96
- IA-06Triple Product and Product of Four Vectors(31-36)
- Iib-6.Polar Coordinates 44-48
- IB-02Locus(6-7)
- IA Compound Angles(41 44)
- 17.Organic Chemistry Alkyl Halides
- 10.VA Group Elements 171-175
- 09.METALLURGY_154-170_
- 13.OC Alkanes and Cycloalkanes
- 7.Alkalimetals _IA__153-164_
- 13. Transition Elements 204-223
- 11.via Group Elements 176-191
- 12.VIIA Group Elements 192-203
- 12.Environmental Chemistry 211-221
- 11.Group 18th Elements _zero Groups Elements__201-210
- 6.Hydrogen Its Comopunds 119-152
- 08.Thermodynamics 133-153
- 07.Surface Chemistry 117-132
- 6.Hydrogen Its Comopunds 119-152
- 10.Group 14 Elements _IV A__187-200_
- 4.State of Matter _Gases and Liquids__72-95
- 11Atomic Physics 227-257
- 01. Solutions_01-25_
- 2.Classification of Elements and Periodicity in Properties
- 3.Chemical Bonding and Molecular Structure_42-71
- 10A.C. Circuits_221-226_
- 02.Solid State_26-37_
- 12Nuclear Physics 258-274
- 5. Stoichiometry_96-118_
- 1.Atomic Structure 1-24
- 03.Electrochemistry_38-65_
- 04.Chemical Kinetics 66-82
- 05.Chemical Equilibrium 83-92
- 06.Acids and Bases 93-116
- Semiconductor Device 275-292

com

**4. PERMUTATIONS AND COMBINATIONS Quick Review
**

1. 2. 3. 4. An arrangement that can be formed by taking some or all of a finite set of things (or objects) is called a permutation. A permutation is said to be a linear permutation if the objects are arranged in a line. A linear permutation is simply called as a permutation. A permutation is said to be a circular permutation if the objects are arranged in the form of a circle (a closed curve). The number of (linear) permutations that can be formed by taking r things at a time from a set of n dissimilar things (r ≤ n) is denoted by n Pr or P(n, r) or P ⎜ ⎟ . ⎜r ⎟

⎝ ⎠ ⎛n⎞

5. 6.

The number of permutations of n dissimilar things taken r at a time is equal to the number of ways of filling of r blank places arranged in a row by n dissimilar things. Fundamental counting principle : If an operation can be performed in m ways and a second operation can be performed in n ways corresponding to each performance of the first operation, then the two operations in succession can be performed in mn ways. If in k operations, the first operation can be performed in n1 ways, the second operation can be performed in n2 ways, third operation can be performed in n3 ways and so on, then the k operations in succession can be performed in n1 n2 n3 … nk ways.

n

7.

8. 9.

Pr =

n(n – 1)(n – 2)…(n – r + 1).

If n is a non-negative integer, then factorial n is denoted by n! or ∠n and defined as follows.

**(i) 0! = 1; (ii) If n > 0 then n! = n × (n – 1)! 10. If n is a positive integer, then n! is the product of first n positive integers. i.e., n! = 1.2.3…n. 11.
**

n

Pr =

n! (n − r )!

**12. The number of permutations of n dissimilar things taken all at a time is n Pn = n!. 13.
**

n

Pr =

(n −1)

Pr + r (n−1)Pr −1 .

14. The number of injections (one-one functions) that can be defined from a set containing r elements into a set containing n elements is n Pr . 15. The number of bijections (one-one onto functions) that can be defined from a set containing n elements onto a set containing n elements is n!. 16. The number of permutations of n dissimilar things taken r at a time when repetition of things is allowed any number of times is nr. 17. The number of permutations of n dissimilar things taken not more than r at a time, when each thing may occur any number of times is

n(nr − 1) n −1

.

18. The number of functions that can defined from a set containing r elements into a set containing n elements is nr. 1

Powered by www.myengg.com

Powered by www.myengg.com

Permutation and combination 19. The number of permutations of n things taken all at a time when p of them are all alike and the rest all different is

n! . p!

20. If p1 things are alike of one kind, p2 things are alike of second kind, p3 things are alike of third kind and so on, pk things are alike of kth kind in p1+p2+…+pk things, then the number of permutations obtained by taking all the things is

(p1 + p 2 + ... + p k )! . p1! p 2 !...p k !

n

21. The number of circular permutations on n different things taken r at a time is

Pr r

.

**22. The number of circular permutations of n different things taken all at a time is (n – 1)!.
**

n

23. The number of circular permutations of n things taken r at a time in one direction is 24. The number of circular permutations of n things taken all at a time in one direction is 25. (i) n Pr + r.n Pr −1 =(n +1) Pr

n

Pr 2r

.

1 (n − 1)! . 2

(ii) (iii)

n −1

Pr =n Pr −1

n n

Pr = n − r + 1. Pr −1

26. If n is a positive integer and p is a prime number then the exponent of p in n! is ⎡n⎤ ⎡ n ⎤ ⎡ n ⎤ ⎢ p ⎥ + ⎢ p 2 ⎥ + ⎢ p3 ⎥ + ... where [x] denotes the greatest integer ≤ x. ⎣ ⎦ ⎣ ⎦ ⎣ ⎦ 27. The number of ways in which m (first type of different) things and n(second type of different) things (m + 1 ≥ n) can be arranged in a row so that no two things of second kind come together is m! (m +1) Pn . 28. The number of ways in which m (first type of different) things and n(second type of different) things can be arranged in a row so that all the second type of things come together is n! (m+1)!. 29. The number of ways in which n(first type of different) things and n(second type of different) things can be arranged in a row alternatively is 2 × n! × n!. 30. Sum of the numbers formed by taking all the given n digits (excluding 0) is (Sum of all the n digits) × (n – 1)! × (111…n times). 31. Sum of the numbers formed by taking all the given n digits (including 0) is (Sum of all the n digits) [(n – 1)! × (111…n times) – (n – 2)! (111…(n – 1) times)]. 32. Sum of all r-digit numbers formed by taking the given n digits (without zero) is (sum of all the n digits) × n −1Pr −1 × (111…r times). 33. Sum of all the r-digit numbers formed by taking the given n digits (including 0) is (sum of all the n digits) [ n −1Pr −1 × (111………r times) – n − 2 Pr − 2 × {111…(r–1) times}].

2

Powered by www.myengg.com

Powered by www.myengg.com

**Permutation and combination
**

34. The number of ways in which m (first type of different) things and n (second type of different) things, (m ≥ n) can be arranged in a circle so that no two things of second kind come together is (m – 1)! m Pn . 35. The number of ways in which m (first type of different) things and n(second type of different) things can be arranged in a circle so that all the second type of things come together is m! n!. 36. The number of ways in which m (first type of different) things and n(second type of different) things can be arranged in the form of garland so that all the second type of things come together is m! n!/2. 37. A selection that can be formed by taking some or all of a finite set of things (or objects) is called a combination. 38. Formation of a combination by taking r elements from a finite set A means picking up an r element subset of A. 39. The number of combinations of n dissimilar things taken r at a time is equal to the number of r element subsets of a set containing n elements. 40. The number of combinations of n dissimilar things taken r at a time is denoted by n Cr or C(n, r) or C ⎜ ⎟ or ⎜ ⎟ . ⎜r ⎟ ⎜r ⎟ ⎝ ⎠ ⎝ ⎠ 41. 42. 43. 44.

n

⎛n⎞

⎛n⎞

Cr =

Cr Cr

n! r! (n − r )!

n

n

=

Pr n(n − 1)(n − 2)...(n − r + 1) . = r! 1.2.3....r

n

n

= n Cn − r .

Cr + n Cr −1 = (n + 1) Cr .

**45. If n Cr = n C s , then r = s or r + s = n. 46. The number of diagonals in a regular polygon of n sides is n C 2 − n =
**

(m + n)! . m! n! n(n − 3) . 2

47. The number of ways in which (m + n) things can be divided into two different groups of m and n things respectively is

(2n)! 2! (n! ) 2

48. The number of ways in which 2n things can be divided into two equal groups of n things each is .

(n1 + n 2 + ... + nk )! . n1! n 2 !...nk !

49. The number of ways in which (n1 + n2 +…nk) things can be divided into k different groups of n1 things, n2 things, n3 things, ………… nk things respectively is

**50. The number of ways in which kn things can be divided into k equal groups of n things each is
**

(kn)! k! (n! )k

.

51. The total number of combinations of (p + q) things taken any number at a time when p things are alike of one kind and q things are alike of a second kind is (p + 1) (q + 1). 3

Powered by www.myengg.com

Powered by www.myengg.com

**Permutation and combination
**

52. The total number of combinations of p + q things taken any number at a time, includes the case in which nothing will be selected. 53. The total number of combinations of (p + q) things taken one or more at a time when p things are alike of one kind and q things are alike of a second kind is (p + 1)(q + 1) – 1. 54. The total number of combinations of (p1+p2+…+pk) things taken any number at a time when p1 things are alike of one kind, p2 things are alike of a second kind, … pk things are alike of kth kind, is (p1 + 1) (p2 + 1) … (pk + 1). 55. The total number of combinations of (p1+p2+…+pk) things taken one or more at a time when p1 things are alike of one kind, p2 things are alike of a second kind, … pk things are alike of kth kind, is (p1 + 1) (p2 + 1) … (pk + 1) – 1. 56. The total number of combinations of n different things taken any number at a time is 2n . 57. The total number of combinations of n different things taken one or more at a time is 2n –1. 58.

n

C 0 + n C1 + n C 2 + ...n Cn = 2n .

α α α 59. If n is a positive integer, then n can be uniquely expressed as n = p1 1p 2 2 ...pk k where p1, p2,…pk are primes in increasing order and α1, α2, …αk are non-negative integers. This representation of n is called prime factorisation of n in canonical form or prime power factorisation of n. α α α 60. The number of positive divisors of a positive integer n = p1 1p 2 2 ...pk k (the prime factorisation) is (α1 + 1)(α2 + 1)(α3 + 1)…(αk + 1).

61. (i) n Cr = n Cn − r

n

(ii) n Cr + n Cr −1 = (n +1) Cr

n

(iii) n Cr = n C s ⇒ r = s or r + s = n

n

62. (i)

Cr

n

Cr −1

=

n −r +1 r

(ii)

(n −1)

Cr Cr

=

n n−r

(iii)

(n − 1)

Cr Cr −1

=

n r

63. The number of parallelograms formed when a set of m parallel lines are intersecting another set of n parallel lines is m C 2 × n C 2 . 64. If there are n points in a plane no three of which are on the same straight line excepting p points which are collinear, then (i) (ii) the number of straight lines formed by joining them is n C 2 − p C 2 + 1. the number of triangles formed by joining them is n C 3 − p C3 .

65. The number of ways that n sovereigns can be given away when there are k applicants and any applicant may have either 0, 1, 2, 3, 4, 5 …… or n sovereigns is (n + k −1) Ck −1 . 66. (i) The number of ways in which exactly r letters can be placed in wrongly addressed

⎡ 1 1 1 1⎤

envelopes when n letters are putting in n addressed envelopes is n Pr ⎢1 − + − + ... + ( −1) r ⎥ . r !⎦ ⎣ 1! 2 ! 3 ! (ii) The number of ways in which n different letters can be put in their n addressed envelopes so that all the letters are in the wrong envelopes = n! ⎢1 − + − + ... + ( −1) n ⎥ . n! ⎦ ⎣ 1! 2 ! 3 ! 67. (i) (ii) The number of ways of answering one or more of n questions is 2n − 1 . The number of ways of answering one or more of n questions when each question have an alternative is 3 n − 1 . 4

⎡ 1 1 1 1⎤

Powered by www.myengg.com

Powered by www.myengg.com

**Permutation and combination
**

(iii) The number of ways of answering all of n questions when each question have an alternative is 2n .

**k 68. The number of distinct positive integral divisors of p11pk 2 ...pkr where p1, p2, …,pr are primes in r 2 ascending order, is (k1 + 1)(k2 + 1) …(kr + 1).
**

k 69. The sum of distinct positive integral divisors of p11pk 2 ...pkr where p1, p2, …,pr are primes in r 2

ascending order, is

k p11 + 1 − 1 p k 2 + 1 − 1 pk r +1 − 1 ⋅ 2 . .... r p1 − 1 p2 − 1 pr − 1

5

Powered by www.myengg.com

- Iia-2. Theory of EquationsUploaded byeamcetmaterials
- Iia 3. MatricesUploaded byeamcetmaterials
- IIA-1. Quadratic Expressions FinalUploaded byeamcetmaterials
- IB-08Planes(36-40)Uploaded byeamcetmaterials
- IB 03change Axes(8 10)Uploaded byeamcetmaterials
- IB 14tanget Normal(66 70)Uploaded byeamcetmaterials
- 04_1PROBABILITYUploaded byeamcetmaterials
- Iib-9.Definite Integration 69-79Uploaded byeamcetmaterials
- Iib-3.Parabola 18-29Uploaded byeamcetmaterials
- 04_2random Variable and DistributionsUploaded byeamcetmaterials
- IB-05pair-straightlines(17-24)Uploaded byeamcetmaterials
- IA 15propeties of Triangles(69 78)Uploaded byeamcetmaterials
- IIB-1.Circles 1-10Uploaded byeamcetmaterials
- 01 4binomial TheoremUploaded byeamcetmaterials
- Iib-2.System of Circles _11-17Uploaded byeamcetmaterials
- IB-06three_di_geometry(25-28)Uploaded byeamcetmaterials
- 02_5HYPERBOLA_37-43_Uploaded byeamcetmaterials
- IA-05Vector Product of Two Vectors(28-30)Uploaded byeamcetmaterials
- 03 Indefinite Integration 53-68Uploaded byeamcetmaterials
- IA 17complex Numbers(86 95)Uploaded byeamcetmaterials
- IA-09multiple and Sub Multiple Angles(45-47)Uploaded byeamcetmaterials
- IB-07Direction Ratios and Direction Cosines(29-35)Uploaded byeamcetmaterials
- IIB-4. ELLIPSE_30-36_Uploaded byeamcetmaterials
- IB 01 Coordinate System(1 5)Uploaded byeamcetmaterials
- IB 04 Straight Lines(11 16)Uploaded byeamcetmaterials
- 03 5 Differential - Equations 84-96Uploaded byeamcetmaterials
- IA-06Triple Product and Product of Four Vectors(31-36)Uploaded byeamcetmaterials
- Iib-6.Polar Coordinates 44-48Uploaded byeamcetmaterials
- IB-02Locus(6-7)Uploaded byeamcetmaterials
- IA Compound Angles(41 44)Uploaded byeamcetmaterials

- 17.Organic Chemistry Alkyl HalidesUploaded byeamcetmaterials
- 10.VA Group Elements 171-175Uploaded byeamcetmaterials
- 09.METALLURGY_154-170_Uploaded byeamcetmaterials
- 13.OC Alkanes and CycloalkanesUploaded byeamcetmaterials
- 7.Alkalimetals _IA__153-164_Uploaded byeamcetmaterials
- 13. Transition Elements 204-223Uploaded byeamcetmaterials
- 11.via Group Elements 176-191Uploaded byeamcetmaterials
- 12.VIIA Group Elements 192-203Uploaded byeamcetmaterials
- 12.Environmental Chemistry 211-221Uploaded byeamcetmaterials
- 11.Group 18th Elements _zero Groups Elements__201-210Uploaded byeamcetmaterials
- 6.Hydrogen Its Comopunds 119-152Uploaded byeamcetmaterials
- 08.Thermodynamics 133-153Uploaded byeamcetmaterials
- 07.Surface Chemistry 117-132Uploaded byeamcetmaterials
- 6.Hydrogen Its Comopunds 119-152Uploaded byeamcetmaterials
- 10.Group 14 Elements _IV A__187-200_Uploaded byeamcetmaterials
- 4.State of Matter _Gases and Liquids__72-95Uploaded byeamcetmaterials
- 11Atomic Physics 227-257Uploaded byeamcetmaterials
- 01. Solutions_01-25_Uploaded byeamcetmaterials
- 2.Classification of Elements and Periodicity in PropertiesUploaded byeamcetmaterials
- 3.Chemical Bonding and Molecular Structure_42-71Uploaded byeamcetmaterials
- 10A.C. Circuits_221-226_Uploaded byeamcetmaterials
- 02.Solid State_26-37_Uploaded byeamcetmaterials
- 12Nuclear Physics 258-274Uploaded byeamcetmaterials
- 5. Stoichiometry_96-118_Uploaded byeamcetmaterials
- 1.Atomic Structure 1-24Uploaded byeamcetmaterials
- 03.Electrochemistry_38-65_Uploaded byeamcetmaterials
- 04.Chemical Kinetics 66-82Uploaded byeamcetmaterials
- 05.Chemical Equilibrium 83-92Uploaded byeamcetmaterials
- 06.Acids and Bases 93-116Uploaded byeamcetmaterials
- Semiconductor Device 275-292Uploaded byeamcetmaterials