Lecture 1

What is Mathematical Induction?

Mathematical induction is a specialized form of working on different cases
and coming up with observations. Induction is the compilation from a
particular set of facts. This method is used to determine a wide range of
statements in which we analyze the legitness of the case. The set should
be denumerable in order for mathematical induction to work with an infinite
set, meaning that it should be having a one-to-one correspondence
between the elements of the set in question and the set of positive integers.
In simple terms, this method expresses the set in the form an implied list of
discrete elements such as {1, 2, 3, 4, …}.
Also Refer: Mathematical Induction

Properties of Mathematical Induction

Mathematical induction has to follow statements with respect to the
properties they obey:

 When for the value of n is true for statements such as n ≥ 5, we

should initiate with satisfying the value n=5 i.e. P(5)
 If the statement provided is true for n=k, and if it satisfies the value
n=k then it will also satisfy n=k+1. In order to prove the trueness of
the statement, we have to prove n=k+1.

Inductive Hypothesis
The step mentioned above is the assumption of the trueness of the
statement n=k and is referred to as the inductive step or inductive
hypothesis.
Let us take an example of the following pattern:
1=12=14=22=1+39=32=1+3+516=42=1+3+5+7
Here we can witness the sum of the first two odd natural numbers is square
of the second number which is a natural number and the pattern
continues.
P(n)=1+3+5+7+11..+(2n−1)=n2And P(1) is satisfied, then, it is the first
step and the value will satisfy for all natural numbers.
Page 1
 Lecture 2

The Principle of Mathematical Induction Suppose there is a given statement P(n)

involving the natural number n such that (i) The statement is true for n = 1, i.e.,
P(1) is true, and (ii) If the statement is true for n = k (where k is some positive
integer), then the statement is also true for n = k + 1, i.e., truth of P(k) implies the
truth of P (k + 1). Then, P(n) is true for all natural numbers n.

Lecture 3
Page 2
Question Prove by induction 3/n3 - n V n ∈ z+

Lecture 4
Page 3
Question Prove by induction sum of first n terms in AP is (n/2)(2a+(n-1)d)

Lecture 5

Page 4
What is a sequence? It is a set of numbers which are written in some particular
order. For example, take the numbers 1, 3, 5, 7, 9, . . . .

Here, we seem to have a rule. We have a sequence of odd numbers. To put this
another way, we start with the number 1, which is an odd number, and then each
successive number is obtained by adding 2 to give the next odd number. Here is
another sequence: 1, 4, 9, 16, 25, . . . . This is the sequence of square numbers.
And this sequence, 1, −1, 1, −1, 1, −1, . . . , is a sequence of numbers alternating
between 1 and −1. In each case, the dots written at the end indicate that we must
consider the sequence as an infinite sequence, so that it goes on for ever.

On the other hand, we can also have finite sequences. The numbers 1, 3, 5, 9
form a finite sequence containing just four numbers. The numbers 1, 4, 9, 16 also
form a finite sequence. And so do these, the numbers 1, 2, 3, 4, 5, 6, . . ., n . These
are the numbers we use for counting, and we have included n of them. Here, the
dots indicate that we have not written all the numbers down explicitly. The n after
the dots tells us that this is a finite sequence, and that the last number is n. Here
is a sequence that you might recognise: 1, 1, 2, 3, 5, 8, . . . .

This is an infinite sequence where each term (from the third term onwards) is
obtained by adding together the two previous terms. This is called the Fibonacci
sequence. We often use an algebraic notation for sequences.

We might call the first term in a sequence u1, the second term u2, and so on.
With this same notation, we would write un to represent the n-th term in the
sequence. So u1, u2, u3, . . ., un would represent a finite sequence containing n
terms.

Properties of Arithmetic Progressions

 If the same number is added or subtracted from each term of an A.P, then
the resulting terms in the sequence are also in A.P with the same common
difference.
 If each term in an A.P is divided or multiply with the same non-zero number,
then the resulting sequence is also in an A.P

Page 5
 Three number x, y and z are in an A.P if 2y = x + z
 If we select terms in the regular interval from an A.P, these selected terms
will also be in AP

Lecture 6

Page 6
Arithmetic progressions An arithmetic progression, or AP, is a sequence where
each new term after the first is obtained by adding a constant d, called the
common difference, to the preceding term.

If the first term of the sequence is a then the arithmetic progression is a, a + d, a +

2d, a + 3d, . . . where the n-th term is a + (n − 1)d.

Example, our first sequence could be written as 1, 3, 5, 7, 9, . . . 1, 1 + 2, 1 + 2 × 2,

1 + 3 × 2, 1 + 4 × 2, . . . , and this can be written as

a, a + d, a + 2d, a + 3d, a + 4d, . . . where a = 1 is the first term, and d = 2 is the

common difference.

Sum of AP series

The sum of the terms of an arithmetic progression gives an arithmetic series. If

the starting value is a and the common difference is d then the sum of the first n
terms is

Sn = (1 /2) n(2a + (n − 1)d).

If we know the value of the last term ℓ instead of the common difference d then
we can write the sum as

Sn = (1 /2) n(a + ℓ).

Question Find the sum of the first 50 terms of the sequence 1, 3, 5, 7, 9, . . . .

Solution This is an arithmetic progression, and we can write down

a = 1 , d = 2 , n = 50 .

We now use the formula, so that

Sn = (1 /2) n(2a + (n − 1)d)

S50 = 1 2 × 50 × (2 × 1 + (50 − 1) × 2) = 25 × (2 + 49 × 2) = 25 × (2 + 98) = 2500 .

Question Find the sum of the series 1 + 3·5 + 6 + 8·5 + . . . + 101

Page 7
Solution This is an arithmetic series, because the difference between the terms is
a constant value, 2·5.

We also know that the first term is 1, and the last term is 101. But we do not
know how many terms are in the series.

So we will need to use the formula for the last term of an arithmetic progression,
ℓ = a + (n − 1)d to give us 101 = 1 + (n − 1) × 2·5 .

Now this is just an equation for n, the number of terms in the series, and we can
solve it. If we subtract 1 from each side we get 100 = (n − 1) × 2·5 and then
dividing both sides by 2·5 gives us 40 = n − 1 so that n = 41.

Now we can use the formula for the sum of an arithmetic progression, in the
version using ℓ, to give us

Sn = (1 /2) n(a + ℓ)

S41 = (1 /2) × 41 × (1 + 101) = (1 /2) × 41 × 102 = 41 × 51 = 2091

Question An arithmetic progression has 3 as its first term. Also, the sum of the
first 8 terms is twice the sum of the first 5 terms. Find the common difference.

Solution We are given that a = 3. We are also given some information about the
sums S8 and S5, and we want to find the common difference.

So we shall use the formula

Sn = (1 /2) n(2a + (n − 1)d)

for the sum of the first n terms.

This tells us that S8 = (1 /2) × 8 × (6 + 7d) and that S5 = (1 /2) × 5 × (6 + 4d) So,
using the given fact that S8 = 2S5, we see that

(1 /2) × 8 × (6 + 7d) = 2 × (1 /2) × 5 × (6 + 4d)

4 × (6 + 7d) = 5 × (6 + 4d)

24 + 28d = 30 + 20d

Page 8
8d = 6 d = 3/ 4 .

Question The price of bike is rs 35000 and can be sold for rs 8000 after 10 years
determine the value of bike after 6 years assuming value is depreciated linearly?

Solution Since depreciation is linear

a=35000

l=8000

n = 11

l=a+(n-1)d

d=-2700

l=a+6d =35000+6(-2700)

=18,800

Lecture 7

Page 9
 Remark

1. If a, b, are 2 numbers and A is AM then a, AM, b are in AP

2. Sum of n AM between 2 numbers a and b is n times the single AM between

them

3. If a, b, c are in AP then b =(a+c)/2

Question Find the sum of numbers which are divisible by 200 and 400 ?

Solution It will be in AP with first term 203,……399

a=203, d=7, l=399

l=a+(n-1)d

399=203+(n-1)7

196=(n-1)7

n=29

Sn = (1 /2) n(2a + (n − 1)d)=8729

Lecture 8

Page 10
We shall now move on to the other type of sequence we want to explore.
Consider the sequence 2, 6, 18, 54, . . . . Here, each term in the sequence is 3
times the previous term. And in the sequence 1, −2, 4, −8, . . . , each term is −2
times the previous term.

Sequences such as these are called geometric progressions, or GPs for short.

Example 1, 2, 6, 18, 54, 162……..is a G.P.

General nth Term of An G.P.

tn = a rn-1

Properties of GP
1. When each term of a Geometric Progression is multiplied or divided by a same non-zero
quantity, then the new series forms a Geometric Progression having the same common
ratio.
2. In a Geometric Progression the reciprocals of the terms also form a Geometric
Progression.
3. When all the terms of a Geometric Progression be raised to the same power, then the new
series also forms a Geometric Progression.
4. The product of the first and the last term is always equal to the product of the terms
equidistant from the beginning and the end of finite Geometric Progression.
5. When the terms of a Geometric Progression are selected at intervals then the new series
obtained also a Geometric Progression.
6. In a Geometric Progression of non-zero non-negative terms, then logarithm of each term
is form an Arithmetic Progression and vice-versa.
7. When three quantities are in GP, the middle one is called as the geometric mean of the
other two. If a, b and c are three quantities in GP and b is the geometric mean of a and c
i.e. b =√ac
8. The nth term from the end of the G.P. with the last term l and common ratio r is l/(r (n-1))
9. If all the terms of a G.P. be multiplied by the same non-zero number, then the new
numbers form a G.P.
10. . The reciprocals of terms in G.P. form a G.P.
11. If each term of a G.P. be raised to the same resulting terms are in G.P.

Lecture 9

Page 11
Question The number 2048 is which term in the following Geometric sequence
2, 8, 32, 128, . . . . . . . . .
Solution Here a = 2 and r = 4
n t h term G.P is a n = ar n - 1
⇒ 2048 = 2 x ( 4) n-1

⇒ 1024 =( 4) n-1

⇒ ( 4) 5
= ( 4) n-1

⇒n=6

Note Given G.P is simple numbers. So we can find easily by direct multiplication
upto required number.

Question Find the 15 t h term of a G.P Whose 8 t h term is 192 and the common ratio
is ‘2’
Solution Let first term of G.P is ‘a’ and common ratio r = 2
8 t h term of G.P is 192 So
⇒ 192 = a x (2) 7
⇒ a = 192 / (2) 7
Now 15 t h is
a 1 5 = [ 192 / (2) 7 ] (2) 14

a 1 5 = 192 x 2 7
= 3 x 2 6x 2 7
=3x2 13

Question Find ‘a’ so that a, a+2, a+6 are consecutive terms of a geometric
progression.
Solution If a 1 , a 2 , a 3 , . . . . . . is a GP then
i.e Common ratio = r = a 2 / a 1 = a 3 / a 2 = a 4 / a 3 = . . . . .

So ⇒
⇒ a 2 + 6a = a 2 + 4 + 4a
⇒a=2
Question If (a-b), (b-c), (c-a) are the consecutive terms of G.P then find (a +b +
c) 2
Solution As per properties of Geometric Progression

Page 12
⇒ commoon
⇒ b 2 + c 2 – 2bc = ac – a 2 -bc + ba
⇒ a 2 + b 2 + c 2 = ab + bc + ca —————– ( i )
Now take (a +b + c) 2 as per algebraic formula
(a +b + c) 2 = a 2 + b 2 + c 2 + 2 (ab + bc + ca) —————– ( ii )
From the above two equations ( i ) & ( ii )
(a +b + c) 2 = 3 (ab + bc + ca)

Lecture 10

Page 13
 Unit - I
Permutation

Concept of factorial

Let n be a positive integer. The continued product of first n natural numbers is called factorial n
and is denoted as n!.

Remark 1. 0!= 1.

2. When n is a negative or fraction, n! is not defined.

3. n! = n(n-1)(n-2)…………3.2.1.

Question Compute 50!/48!?

Solution 50!/48! = 50X49X48!/48! = 2450.

Question If (n+3)! = 56(n+1)!, find natural number n?

Solution (n+3)! = 56(n+1)!

(n+3)(n+2)(n+1)! = 56(n+1)!

(n+3)(n+2) = 56

(n3 + 5n + 6) = 56

n2 + 5n -50 = 0

n = 5, n = -10

neglect n = -10 (As ‘n’ is natural number)

Therefore, n = 5.

Question Find the l.c.m. of 7!, 8! And 9!?

Solution 8! = 8X7!

9! = 9X8X7!

l.c.m. of [7!, 8!, 9!] = g.c.d. of [7!, 8X7!, 9X8X7!]

= 7!X9X8 = 72X7!=362880.

Page 14
Question Prove that n!/(n-r)!r! + n!/(n-r+1)!(r-1)! = (n+1)!/r!(n-r+1)!

Solution Consider LHS = n!/(n-r)!r! + n!/(n-r+1)!(r-1)!

= n!/(n-r)!(r-1)![1/r + 1/(n-r+1)]

= n!/(n-r)!(r-1)![(n-r+1)/r(n-r+1)]

= n!/(n-r)!(r-1)![(n+1)/r(n-r+1)]

= (n+1)!/(n-r+1)(n-r)!r(r-1)!

= (n+1)!/(n-r+1)!r! = RHS.

Important Results to Remember

1. x! + y! = (x+y)!, x, y>1
Let x = 2, y = 3.

LHS = 2! + 3! = 8.

RHS = (2+3)! = 5! = 120.

Clearly, LHS ≠ RHS.

2. x! –y! ≠ (x –y)!, x, y>1

Let x =5, y = 3

LHS = 5! -3! = 3![5X4 – 1] = 114.

RHS = (5 -3)! = 2! = 2.

Clearly, LHS ≠ RHS.

3. x!.y! ≠ (x.y)!
Let x = 2, y =3

LHS = 2!3! = 12.

RHS = (2X3)! = 6! = 720.

Clearly, LHS ≠ RHS.

4. (x/y)! ≠ x!/y!.
Let x = 6, y =3

LHS = (6/3)! =2! = 2.

Page 15
RHS = 6!/3! = 6.5.4.3!/3! = 120.

Clearly, LHS ≠ RHS.

Fundamental Principle of Counting

1. Multiplication Principle If a work can be done in ‘m’ ways, another work can be
done in ‘n’ ways, and then both of the operations can be performed in ‘m x n’ ways. It can be
extended to any finite number of operations.

2. Addition Principle If two events E1 and E2 can occur independently in exactly m

ways and n ways respectively, then either of the two events can occur in (m + n) ways.

Question There are 8 cars playing between two towns A and B. In how many ways can a person
go from one town to the other and return by a different car?

Solution There are 8 ways of traveling from A to B and seven ways for the return journey, since
he cannot come by the same car. Hence, the number of ways of making both the journeys is 8 x 7
= 56.

Question How many numbers are there between 100 and 1000 such that every digit is either 2 or
9?

Solution Number of ways of filling hundred's place = 2.

Number of ways of filling ten's place = 2.

Number of ways of filling unit's place = 2.

By the fundamental principle of counting, the total number of numbers = 2 x 2 x 2 = 8.

Question Twelve students compete in a race. In how many ways first three prizes are given?

Solution Out of 12 students, first prize can be given in ‘12’ ways.

Out of 11 students left, second prize can be given in ‘11’ ways.

Out of 10 students left, prize can be given in ‘11’ ways.

Question There are 15 books on Mathematics and 19 books on Chemistry in a shop. In how
many ways student can buy either Mathematic book or a Chemistry book.

Solution Out of Mathematics and, Chemistry book, any one has to be selected.

Therefore, number of ways he can buy either one of book is 15+10 =25.

Page 16
Question A person wants to buy one fountain pen, one sketch pen and one ball pen from a shop.
If there ‘15’ varieties of fountain pen, ‘10’ varieties of sketch pen and ‘5’ varieties of ball pen, in
how many ways he can select these articles?

Solution Clearly a person can buy fountain pen in ‘15’ ways. Sketch pen in ‘10’ ways and both
pen in ‘5’ ways.

Therefore, number of ways he can select all these articles: 15 ×10 × 5 = 750.

Definition of Permutation Permutation means arrangement of things. The word arrangement

is used, if the order of things is considered. The symbol nPr or P (n, r) is used to denote the
number of permutations of ‘n’ things taken r at a time (1<r<n).

Example The permutation of the three letters a, b, c taken two at a time are ab, ba, ac, ca, bc, cb
which are 6 in numbers(= P(3,2).

Question If P(5, r) = p(6, r-1), find r?

Solution Consider P(5, r) = p(6, r-1)

5!/(5-r)! = 6!/(7-r)!

5!/(5-r)! = 6X5!/(7-r)(6-r)(5-r)!

1/1 = 6/(7-r)(6-r)

(7-r)(6-r) = 6

r2 – 13r +36 =0

r(r-9)-4(r-9) = 0

(r-9(r-4) = 0.

Therefore, r =4, 9.

Neglect r = 4 as 1<r<n.

Hence, r =4.

Question In how many ways can 5 children stand in a queue?

Solution The number of ways in which 5 children can stand in a queue is same as the number of
arrangements of 5 different things taken all at a time

Therefore, number of ways = P(5, 5) = 5! =120.

Page 17
Question From among the 36 teachers in a school on a principal and one vice – principal are to
be appointed. In how many ways can this be done?

Solution The number of ways in which 2 teachers can be appointed from 36, teachers is the
number of arrangements of 36 teachers taken 2 at a time number of ways = P(36, 2) = 36!/34! =
1260.

Question In how many ways can 6 boys and 5 girls be arranged for a group of photograph if the
girls are to sit on the chairs in a row and the boys are to stand in a row behind them?

Solution The number of ways in which 6 boys can stand behind the girls is same as the number
of arrangements of 6 boys taken all at a time.

Therefore, number of ways = P(6, 6) = 6!

Also the number of ways in which 5 girls can sit on chairs, is same as the number of
arrangements of 5 girls taken all at a time.

Number of ways = P(5, 5) =5!

Therefore, total number of ways = 6! X 5!.

Question If P(n-1, 3): P(n, 4) = 1:9, find n?

Solution P(n-1, 3)/ P(n, 4) = 1/9

(n-1)! /(n-4)! X (n-4)!/n(n-1)! = 1/9

1/n = 1/9

n = 9.

Question If P(n, 4) = 360, find n?

Solution P(n, 4) = 360

n!/(n-4)! = 360

n(n-)(n-2)(n-3) = 360

n =6

Page 18
 Lecture 11
Unit - I
Permutation

Question How many different signals can be made by 5 flags from 8-flags of different colours?

Solution Number of ways taking 5 flags out of 8-flage = 8P5 = 8! / (8-5)!

= 8 x 7 x 6 x 5 x 4 = 6720.

Question How many words can be made by using the letters of the word “SIMPLETON” taken
all at a time?

Solution There are ‘9’ different letters of the word “SIMPLETON”.

Number of Permutations taking all the letters at a time = 9P9 = 9! = 362880.

Question How many words can be formed with the letters of the word ‘OMEGA’ when:

(i) ‘O’ and ‘A’ occupying end places.

(ii) ‘E’ being always in the middle

(iii) Vowels occupying odd-places

(iv) Vowels being never together.

Solution (i) When ‘O’ and ‘A’ occupying end-places

M.E.G. (OA)

Here (OA) are fixed, hence M, E, G can be arranged in 3! ways

But (O, A) can be arranged themselves is 2! ways.

Total number of words = 3! x 2! = 12 ways.

(ii) When ‘E’ is fixed in the middle

O.M.(E), G.A.

Hence four-letter O.M.G.A. can be arranged in 4! i.e 24 ways.

(iii) Three vowels (O, E, A,) can be arranged in the odd-places (1st, 3rd and 5th) = 3! ways.

And two consonants (M, G) can be arranged in the even-place (2nd, 4th) = 2! ways.

Total number of ways= 3! x 2! = 12 ways.

Page 19
(iv) Total number of words = 5! = 120!

If all the vowels come together, then we have: (O.E.A.), M, G.

These can be arranged in 3! ways.

But (O, E, A) can be arranged themselves in 3! ways.

Number of ways, when vowels come-together = 3! X 3! = 36 ways.

Number of ways, when vowels being never-together = 120-36 = 84 ways.

Permutation of objects not all distinct The number of permutation of n things(q1, q2, q3,
…….qn) where q1 = alike of one kind , q 2 = alike of second kind, q 3: alike of third kind, and so
n!
on is .
q 1 ! q 2 ! qn !

Question In how many ways can be the letters of the word ‘UNIVERSITY’ such that vowels
always remain together?

Solution There are ‘10’ letters(not all distinct) in the word ‘UNIVERSITY’, out of which there
are 4 vowels namely U, I, E, E, keeping 4 vowels together and creating them as one, we have to
arrange ‘7’ distinct letters, N, V, R, S, T, Y, [U, I, E, E]. This can be done in 7! Ways. Also ‘4’
vowels together can be arranged in 4! /2!.

Therefore, total number of ways = 7! X 4!/2! = 60480.

Question How many 8 digit telephone numbers cab be constructed with digit 0, 1, 2, 3, 4, 5, 6,7,
8,9 if each number starts with 23 and no digit appears more then once?

Solution We have to construct a 8 digit telephone number. Now digits 2, 3 have already been
used. As no digit appears more than once.

Therefore, we have to fill up 6 places from 8 different digits (1, 4, 0, 5, 6, 7, 8, 9).

Therefore, number of ways = P(8, 6) = 8!/(8-6)1 = 8!/2! = 8X7X6X5X4X3 = 20160.

Question How many words, with or with out meaning can be formed using all the letters of word
DELHI using each letter exactly once.

Page 20
Solution The number of ways in which words can be formed (with or without replacement) is
the number of arrangements of 5 letters taken all at a time.

Therefore, number of ways = 5! = 120.

Question The letters of word ‘RANDOM’ are written in all possible orders and these words are
written out as in a dictionary. Find the rank of the word ‘RANDOM’?

Solution In dictionary words are arranged in the alphabetically order. The words starting with A,
D, N, M, O will come first.

For the word start with A, we have to arrange remaining 5 letters. This can be done in P(5, 5) =5!
Ways.

For the word start with D, we have to arrange remaining 5 letters. This can be done in P(5, 5) =5!
Ways.

For the word start with M, we have to arrange remaining 5 letters. This can be done in P(5, 5)
=5! Ways.

For the word start with N, we have to arrange remaining 5 letters. This can be done in P(5, 5) =5!
Ways.

For the word start with O, we have to arrange remaining 5 letters. This can be done in P(5, 5) =5!
Ways.

Now number of words beginning with R is 5! Out of which one word is RANDOM.

But first we will have words starting with RAD. Which are 3! = 6.

Then, we have words starting with RAD. Which are 3! = 6.

Next word we be RANDMO, and then the word RANDOM

Therefore, Rank of RANDOM = 120 + 120 + 120 + 120 + 6+ 6+1+1 = 614.

Question In how many ways can the letters of the word ‘CASTLE’ be arranged such that

1. ‘L’is always next to T.

2. S andT are always together.
3. Word always starts with S.
Solution 1. Consider ‘TL’ as one letter, then we have to now arrange 5 letters. This can be done
in P(5, 5) = 5! =120 ways.

2. Keeping S and T together and consider it as it one letter.

Page 21
Now again, 5 letters can be arranged in 5! Ways. Also Sand T together can be arranged in 2!
Ways.

Therefore, total number of ways = 5!X 2! = 240.

3. As word always starts with S, together we have to arrange 5 letters which can be done in 5!
ways.

Question Five boys and five girls form a line with the boys and girls alternating. Find the
number of ways of making the line?

Solution Case I Let us first arrange 5 boys in 5 places. This can be done in 5! Ways.

B1 B2 B3 B4 B5

Therefore, 5 girls can be arranged in 5! Ways (in places marked)

Therefore total number of ways = 5X 5!

Case II Let us first arrange 5 girls in 5 places. This can be done in 5! Ways.

G1 G2 G3 G4 G5

Therefore, 5 boys can be arranged in 5! Ways (in places marked)

Therefore total number of ways = 5X 5!

Total number of ways = 5X 5! + 5X 5!

= 2(5!)2.

Question In how many ways can the letters of the word ‘DIRECTOR’ be arranged so that the
three vowels are never together?

Solution In the word ‘DIRECTOR’, we have 5 consonants and 3 vowels. Also letter ‘R’ occurs
twice.

Therefore, Total number of arrangements is 8!/2!.

Now keep ‘3’ vowels together, and complete them as one letter.

We have to arrange 6 letters, out of which letter ‘R’ occurs twice, and ‘3’ vowels together can be
arranged in 3! Ways.

Number of arrangements = 6!/3!X 3!

Total number of arrangements such that three vowels are never together = 8!/2!-6!x3!/2! =
18000.

Page 22
Question In how many ways 10 children be arranged in a row such that

(A) 3 of them, Sita, Neha and Reema are always together?

(B) 3 of them, Sita, Neha and Reema are never together?
Solution (A) Consider, Sita, Neha and Reema as one child.

So total there are 8 children ‘8’ children can be arranged in P(8, 8) = 8! WAYS.

Now, Sita, Neha and Reema can be arranged together in 3! Ways

Therefore, Total number of ways = 8!X 3! ways.

(B)Total number of ways of arranging 10 children = 10!

Now, total number of ways in which Sita, Neha and Reema are never together is obtained by
subtracting number of arrangements in which Sita, Neha and Reema are always together from
the total number of arrangements = 10! – 8!X3! = 84x8!.

Page 23
 Lecture 12
Unit - I
Permutation

Circular Permutation When we arrange the things in circle is called circular permutation.
[Otherwise it is called linear permutation].

Remark There are two cases of circular-permutations:-

(a) If clockwise and anti clock-wise orders are different, then total number of circular-
permutations is given by (n-1)!

(b) If clock-wise and anti-clock-wise orders are taken as not different, then total number of
circular-permutations is given by (n-1)! /2! [e.g. pearls in necklace, flowers in garland
etc.]

Question How many necklaces of 12 beads each can be made from 18 beads of different

colours?

Solution Here clock-wise and anti-clockwise arrangements are same.

Hence total number of circular–permutations: 18P12/2x12 = 18!/(6 x 24).

Question How many numbers of four digits can be formed with digits 1, 2, 3, 4 and 5?

Solution Here n = 5 [Number of digits]

And r = 4 [Number of places to be filled-up]

5
Required number is P4 = 5!/1! = 5 x 4 x 3 x 2 x 1.

Question In a class of students there are 6 boys and 4 girls. In how many ways can they be
seated around a table so that all the girls sit together?

Solution Keeping 4 girls together and considering them as one, we have to arrange 7 students [6
boys + (4 girls as one)] around a table. Since clockwise and anticlockwise arrangements of the
student will be different.

Therefore number of ways = (7-1)! =6!

Also, 4 girls can be arranged among themselves in P(4, 4) = 4! Ways.

Page 24
Therefore, required number of ways = 6! X 4!.

Question In how many ways 5 Indians and 4 Englishmen can be seated at a round table if

(i) There is no restriction

(ii) There are 4 Englishmen sit together
(iii) All the 4 Englishmen do not sit together
(iv) No two Englishmen sit together?
Solution (i) We have total of 9 persons (5 Indians and 4 Englishmen)

Therefore, when there is no restriction, 9 persons can be seated the round table in (9-1)! = 8!
Ways.

(ii) Keeping 4 Englishmen together and considering them as one, we now have total of 6 persons
[ 5 Indians and 4 Englishmen(as one)]

Therefore, number of ways these 6 persons can be seated = (6-1)! = 5!

Also 4 Englishmen can be arranged among themselves in 4! Ways

Therefore, required number of ways = 4! X 5!

(iii) When there is no restriction total number of arrangements = 8!

When all 4 Englishmen sit together

Total number of arrangements = 4! X 5!

When all the 4 Englishmen do not sit together, number of ways = 8!- 5! X 4! = 40320 – 2880 =
37440.

(iv)We have no restriction on Indians

Therefore, 5 Indians can be seated at a round table in (5-1)! = 4! Ways.

Also it is given that no two Englishmen sit together.

Combination Combination means selection of things. The word selection is used, when the
order of things has no importance.

Example Now suppose that we have to make a team of 11 players out of 20 players, this is an
example of combination, because the order of players in the team will not result in a change in
the team. No matter in which order we list out the players the team will remain the same. For a
different team to be formed at least one player will have to be change.

Combination Combination of n objects taken ‘r’ at a time is defined as

C (n, r) = n! / (n-r)! r!

Page 25
Remark Number of combination of ‘n’ different things taken all at a time is 1.

C(n, n) = n!/0!n! = 1.

Question In how many ways can a cricket-eleven be chosen out of 15 players?

Solution Out of 15 players 11 can be chosen in C (15, 11) ways.

Some Important Results

1. C(n, r) = c(n, n-r); 0≤r≤n

Proof C(n, r) = n!/(n-r)!(n-(n-r))!

= n!/(n-r)! r!

= C(n, r).

2. If x+ y= n; where x and y are non negative integers; then C(n, x) = C(n, y)

Proof Consider C(n, x) = C(n, n-x)= C(n, y)

3. If C(n, x) = C(n, y) x = y or x = n –y
Proof If C(n, x) = C(n, y) C(n, x) = C(n, n – y)

x = y or x = n – y

Page 26
 Lecture 13
Unit - I
Combination

Question Find the value of n if C(n, 4) = C(n, 6), find C(12, 6)?

Solution C(n, 4) = C(n, 6)

Therefore, n = 6+ 4 n = 10

Question If C(2n, 3): C(n, 2) = 44:3

Solution C(2n, 3) /C(n, 2) = 44/3

(2n)!/(2n-3)!3! ÷ n!/(n-2)!2! = 44/3

(2n)!/(2n-3)!3! x (n-2)! 2!/n! = 44/3

(2n)(2n-1)(2n-2)/3n(n-1) = 44/3

8n(n2 – 7n +6) = 0

8n = 0 or n2 – 7n +6 = 0

n = 0 (not possible)

n2 – 7n +6 = 0

(n-1)(n-6) = 0

n = 1 or n = 6

n =1 is not possible as n≥r, therefore, n = 6.

Question From a group of 15 cricket players, a team of 11 players is to be chosen. In how many
ways can this be done?

Solution From a group of 15 cricket players, a team of 11 players is to be chosen.

This can be done in C(15, 11) ways = 15!/(15-11)!11!

= 15!/4!11!

= 1365.

Page 27
Question Out of 7 men and 4 ladies a committee of 5 is to be formed. In how many ways can
this e done so as to include at least 3 ladies ?

Solution In a committee of 5 to be formed, we have to include at least 3 ladies

Therefore we have the following cases

(1) 3 ladies and 2 men (total of 5)

(2) 4 ladies and 1 men(total of 5)
Therefore, required number of ways = C(4, 3)X C(7, 2) + C(4, 4)XC(7, 1)

= 4!/1!3! X 7!/5!2! + 4!/0!4!X7!/0!1!

= 4X21 + 7

= 91.

Question How much different word, each containing 2 vowels and 8 consonants can be formed
with 6 vowels and 10 consonants?

Solution 2 vowels out of 6, can be chosen C (6, 2) ways, and 8 consonants out of 10, can be
chosen in C(10, 8) ways. Also “10” letter word can be arranged themselves 10 ways

Therefore, required number of ways = C (6, 2) × C (10, 8) × 10

= (675) 10

Question In how many ways can the letter of word “STRANGE” be arranged such that vowels
always occupy even positions?

Solution There are 7 distinct letters in the word “STRANGE” of which 5 are constants and 2
vowels. Since vowels occupy even places only, So 2 vowels can be arranged in at 2nd, 4th and 6th
position by 3P2 ways and the remaining 5 constants can be arranged by 5P5 ways. So that the total
number of ways so that vowels always occupy even places

=3P2*5P5

=6*120

=720 ways

Result Number of ways of distributing n different things among three groups containing m, k, r
things (m, k, r) and m + k + r =n is n!/m!r!k!

If m=k then number of ways = n!/m!r!k!2!

Page 28
If m=k=r then number of ways = n!/m!r!k!3!

Result Number of ways of distributing m, k, r, things out of n different things among three
persons = n!/m!r!k! x 3!

If m=k then number of ways = n!/m!r!k!2! x 3!

If m=k=r then number of ways = n!/m!r!k!3! x 3!

Question In how many ways 12 different things can be divided equally among 3 persons?

Solution clearly each person get 4 things 4+4+4=12

From result 2 we have 12!/4!4!4!

Question In how many ways 12 things can be divided in 3 sets each having 4 things?

Solution m= k= r = 4

!/4!4!4!3!

Required no of ways = 12

Page 29
 Lecture 14
Unit - I
Combination
Restricted – Combinations

(a) Number of combinations of ‘n’ different things taken ‘r’ at a time, when ‘p’ particular things
are always included = n-pCr-p.

(b) Number of combination of ‘n’ different things, taken ‘r’ at a time, when ‘p’ particular things
are always to be excluded = n-pCr

Question In how many ways can a cricket-eleven be chosen out of 15 players, if

(i) A particular player is always chosen,

(ii) A particular is never chosen.
Solution (i) A particular player is always chosen, it means that 10 players are selected out of
the remaining 14 players.
14
=. Required number of ways = C10 = 14C4

= 14!/4!x19! = 1365

(ii) A particular players is never chosen, it means that 11 players are selected out of 14 players.
14
=> Required number of ways = C11

= 14!/11!x3! = 364

Result Number of ways of selecting zero or more things from ‘n’ different things is given by 2 n-
1

Proof Number of ways of selecting one thing, out of n-things = nC1

Number of selecting two things, out of n-things =nC2

Number of ways of selecting three things, out of n-things =nC3

Number of ways of selecting ‘n’ things out of ‘n’ things = nCn

=>Total number of ways of selecting one or more things out of n different things

Page 30
= nC1 + nC2 + nC3 + ------------- + nCn

= (nC0 + nC1 + -----------------nCn) - nC0

= 2n – 1 [ nC0=1]

Question John has 8 friends. In how many ways can he invite one or more of them to dinner?

Solution John can select one or more than one of his 8 friends.

=> Required number of ways = 28 – 1= 255.

Result Number of ways of selecting zero or more things from ‘n’ identical things is given by
n+1

Question In how many ways, can zero or more letters be selected form the letters AAAAA?

Solution Number of ways of :

Selecting zero 'A's = 1

Selecting one 'A's = 1

Selecting two 'A's =1

Selecting three 'A's = 1

Selecting four 'A's = 1

Selecting five 'A's = 1

=> Required number of ways = 6

Result Number of ways of selecting one or more things from ‘p’ identical things of one type ‘q’
identical things of another type, ‘r’ identical things of the third type and ‘n’ different things
is given by (p+1) (q+1) (r+1)2n – 1.

Question Find the number of different choices that can be made from 3 apples, 4 bananas and 5
mangoes, if at least one fruit is to be chosen.

Solution Number of ways of selecting apples = (3+1) = 4 ways.

Number of ways of selecting bananas = (4+1) = 5 ways.

Number of ways of selecting mangoes = (5+1) = 6 ways.

Total number of ways of selecting fruits = 4 x 5 x 6

But this includes, when no fruits i.e. zero fruits is selected

Page 31
=> Number of ways of selecting at least one fruit = (4x5x6) -1 = 119

Note :- There was no fruit of a different type, hence here n=o

=> 2n = 20=1

Question How many numbers of four digits can be formed with digits 1, 2, 3, 4 and 5?

Solution Here n = 5 [Number of digits]

And r = 4 [ Number of places to be filled-up]

5
Required number is P4 = 5!/1! = 5 x 4 x 3 x 2 x 1

Question In how many ways can the letter of the word “FATHER” be arranged so that

(i)H is always next to T

(ii)H and T are always together
Solution (i) Let us take T, H letter as single letter. Now we have 5 letters to arrange, that can be
done by 5P5=5! / (5-5)! =120 ways. So the total number of ways so that H is always next to T =
120 ways.
(ii)Let us take HT together and consider it as single letter. Now we have 5 letters which can be
arranged by5P5=5! =120 ways but H and T can be put together as HT or TH by 2! Ways. So , the
total number ways so that H and T are always together= 5!*2!=240 ways

Question How many different words can be formed with the letters of the word “EQUATION”
so that

(i)The words begin with E?

(ii)The words end with T?
(iii)The words begin with E and end with T?
(iv)The words begin with a vowel?
Solution The word EQUATION contains 8 different letters out of which 5 are vowel and 3 are
constants.
(i)Now we wish to find the number of words which start with E. So be fix E at the first place.
Remaining 7 letters can be arranged by 7P7 =7! = 5040 ways
(ii)Here we wish to find the number of words which ends with T, so we fix T at 8th place
Remaining 7 letters can be arranged by 7P7 =7! = 5040 ways
(iii)Here we fix E at first place and T at the last place I.e. 8th place. So the remaining 6 letters
can be arranged by 6P6 = 6! = 720 ways.
(iv)In this part we wish to find the number of words which start with a vowel. Since there are 5
vowels so first place can be occupied by any one of these 5 vowels by 5 ways and the remaining
7 places can be filled by 7p7 ways. So total number of such words = 5*7! =5*5040=25200.

Page 32
Question How many four letter words can be formed using the letters of the word ‘JUNGLE’ so
that

(1) U is included in each word?

(2) U is never included in any word?
Solution The ‘JUNGLE’ consists of 6 letters

(1) When letter U is included in every word, we have to choose only 3 letters from remaining
5 letters (J, N, G, L, E)(to make it 4 letter word)
This can be done in C(5, 3) = 10 ways
Also, in all these C(5, 3) selections, 4 letters can be arranged in 4 ways
Therefore, total number of words = C(5, 3)x 4 = 240.
(2) When letter U is never included in every word, we have to choose only 4 letters from
remaining 5 letters (J, N, G, L, E)
This can be done in C(5, 4) = 5 ways
Also, in all these C(5, 4) selections, 4 letters can be arranged in 4 ways
Therefore, total number of words = C(5, 4)x 4 = 120.

Question A tea party is arranged for 16 person’s long two sides of long table with 8 chairs on
each side. Four persons wish to sit on one particular side and two on the other side. In how many
ways can they be seated?

Solution Let the two sides be P & R

4 Persons wish to sit on the side P & 2 persons wish to sit on the side So we re left with 0
persons [6-(4+2)].

Now on each side there re 8 chairs available

Consider side P

4 persons already wish to sit on this side

Total chairs available = 4

Total persons available = 10

Therefore, we have to choose’4’ persons from 10(remaining persons)

This can be done in C(10, 4)

Consider side R

2 persons already wish to sit on this side

Page 33
Total chairs available = 6

Total persons available = 6

This can be done in C (6, 6) ways.

Also, 8 persons in each side can be arranged among themselves in 8 ways

Therefore, total number of ways = C(10, 4)XC(6, 6)x 8 x 8 .

Page 34