CLASS

XI
CHAPTER
-7
PERMUTATIO
NS
AND
COMBINATIO
FUNDAMENT
AL
PRINCIPLE
Consider 3 pens
and 2 markers. COUNTIN
P1 P2 P3
M1 M2
G

i) How can we select an item out of this i) How can we select 1 pen and 1
5 items? marker?
Either you OR
can means
select ADDITION. So we P1 M1 AND means
P1 M1can select an item in 5 ways. M2 MULTIPLICATION. So we
P2 or M23 ways(pen) + 2 P2 M1 can select an item in 6 ways.
P3 ways(marker) = 5 ways M2 3 ways(pen) * 2 ways(marker)
P3 M1 = 6 ways
M2
LEARNING OBJECTIVES

FUNDAMENTAL PRINCIPLE OF COUNTING:

After studying this lesson students will be able:
•To identify the number of outcomes in a problem
•To apply the Fundamental principle of counting to
find out the total number of outcomes in a problem
•To draw the tree diagram for the outcomes.
•To develop an understanding of the concept of the
basic principle.
•To apply the knowledge of the principle in practical
and unknown situations.
FUNDAMENTAL
PRINCIPLE
If an operation can be
performed in ‘m’ different
ways and another in ‘n’
different ways then the
two operations can be
performed in ‘mn’ ways.
Consider, A person is travelling
from Hyderabad to Chennai via
Vijayawada. If there are 2 ways
of travelling from Hyderabad to
Vijayawada and 3 ways of
travelling from Vijayawada to
Chennai.

We will find the number of

different ways of travelling from
Hyderabad to Chennai.
Suppose the person can travel from
Hyderabad to Vijayawada either by Train(T)
or by Bus (B) and from Vijayawada to
Chennai by Train (T) or Bus (B) or Plane (P).

The different ways of reaching Chennai are:

1). TT 2). TB 3). TP

4). BT 5). BB 6). BP

Hence, there are 6 in number which is equal

to 2X3 which is in accordance with the
fundamental principle.
 Generalization of
fundamental
principle
This principle can be generalized for multiple
items. That is ‘If an event can occur in ‘m’
different ways, following which another event
can occur in ‘n’ different ways, following which a
third event can occur in ‘p’ different ways, then
the total number of occurrence to ‘the events in
the given order is m × n × p.”
Given 4 flags of different colours, how many
different signals can be generated, if a signal
requires the use of 2 flags one below the
other?
SOLUTION:
The total number of signals is equal to the
4 ways
number of ways of filling in 2 vacant places
in succession by four flags of different
colours. The upper vacant place can be filled
in 4 different ways by anyone of the 4 flags;
3 ways
following which, the lower vacant place can
be filled in 3 different ways by any one of the
remaining different flags
Hence, by the fundamental principle of
multiplication, the requires number of
signals is 4*3=12
FACTORIA
L
 Learning
Objectives
After studying this lesson students
will be able:

⮚ To use the factorial notation

⮚ To understand the concept of the
factorial notation.
⮚ To tell that n! is the product of first
'n' natural numbers
⮚ To understand that factorial is not
defined for negative numbers and
decimals.
⮚ To know the value of 0!.
 WHAT IS A
FACTIORIAL
 FACTORIAL
Factorial: The continued
product of first ‘n’
natural numbers is called
the “n factorial” and is
denoted by n! or

i,e n!=1*2*3*4*……*n

Ex: 5!=1*2*3*4*5=120
DEDUCTION-1
We know that,
By definition,
n!=1*2*3*4*5*………*n
n!= 1*2*3*4*5*…..(n-1)*n
n!= (n-1)!*n
n!= n*(n-1)!
Application:

Using the above

deduction,
We can write:
8!= 8x7!
5!= 5x4!
10!=10x9!
 ZERO FACTORIAL
Prove that 0!=1
We know that
n!= n*(n-1)!
Now Put n=1
We get
1!= 1*(1-1)!
1!=1*(0)!
1= 1*0!
Which gives that 0!=1
THINGS TO REMEMBER

1.n! is defined for positive integers

only.
2.0!=1
3.1!=1
4.n!=n*(n-1)!
5. Factorials of proper fractions is
not defined.
6.Factorial n is defined only for
whole numbers.
PROBLEMS
FOR
PRACTICE
 Problems:
1. Compute

Solution:
We know that, n!=n*(n-1)!.
Using this
5. Which of the following is true:
(a). (2+3)!=2!+3!. (b). (2x3)!
=2!x3!
(a). LHS= (2+3)!=(5)!=120.
RHS=2!+3!
=(1*2)+(1*2*3)=2+6=8.
Hence, LHS≠ RHS
Thus, (2+3)!≠2!+3!

(b). LHS= (2X3)!=(6)!=6!=720

RHS= 2!X3!
=(1*2)*(1*2*3)=2*6=12
Hence, LHS≠ RHS
Thus, (2*3)!≠2!*3!
THANKY
OU
2. Find ‘n’ if (n+2)!= 2550xn!

Solution:
Given that,
(n+2)!= 2550*n!
(n+2)*(n+1)!= 2550*n!
(n+2)*(n+1)*n!= 2550*n! ( cancel n! on both sides)
(n+2)*(n+1) =2550
n2+n+2n+2 =2550
n2+3n+2-2550=0
n2+3n-2548=0
n2+52n-49n-2548=0 (Splitting middle term )
n(n+52)-49(n+52)=0
(n+52)(n-49)=0
PERMUTATION
Permutation:
Each of the arrangements which can
be made by taking some or all of a
number of things is called a
permutation.

Hence a permutation is an
arrangement in a definite order of a
number of objects or things or
numbers taking some or all at a
time.
For example:
If there are three objects a,b,c then,
the permutations of these objects,
taking two at a time are:

ab, ba, bc, cb, ac, ca

We can arrange them in 6 ways

Permutation
Permutation is an arrangement
in a definite order of things.

Example: Arrange 3 distinct balls

namely, Green, Red & Blue balls.

We can arrange in 6
ways
 In how many ways we can
arrange (1,2,3,4)? 4 ways

1234 2134 3124 4123

6 1243 2143 3142 4132
w 1324 2314 3214 4213
a 1342 2341 3241 4231
y
s 1423 2431 3421 4321
1432 2413 3412 4312

There are 24 ways of arranging

the numbers 1,2,3,4. ( 24 = 4 *
3 * 2 * 1)
It is very difficult to find the number of
arrangement by actually arranging them if the
number of items is more. E.g.: if we want to
know how many ways we can arrange
1,2,3,4,5,6,7,8,9. It will be difficult to tell by
actually arranging it. That is when permutation
come to help us.
Permutation formula gives us easy way to
find number of arrangements for a given data.
 SYMBOLIC
REPRESENTATION

• Permutation means arrangement of things.

• Order of things is important.
Permutation with distinct
objects
Let’s assume the word “LIST” with
distinct objects L, I, S,& T. How many
4 letter words can we form using
letters of LIST, when repetition of
letters is not allowed

1 2 3 4
 Permutation with distinct
objects

Solution: Since we need to create 4 letters word,

let’s assume we have 4 boxes.

1 2 3 4
In this case, box 1 can have any of the 4 letters
“L, I , S , T” . That is 4 choices
Box 2 can have any of the remaining 3 letters as
one letter is now inside bucket 1, that is 3 choices
Box 3 will can any of the remaining 2 letters that
is 2 choices
Box 4 will have only 1 choice that is the remaining
letter. Thus 1 choice.
B
B B2
B2 B3 B4
1
1

4
4 3
3 2 1

If you multiple all these choices : 4* 3 * 2 *1 , you will

get the number of possible 4 letter words with “L I S T”,
without repetition
Thus number of 4 letter possible words are : 4* 3 * 2
*1 = 24 words when repetition is not allowed.
Now the same problem can be
solved using the permutation
formula as follows:

Total number of letters in the given

word ‘LIST’=n=4
Number of letters taken at a
time=r=4
 Symbols Used in permutations

n!=1*2*3*----
*n
Numerical: Find (i) 8P5
How many ways 3 people can stand in a queue?

In this case it is implicit that repetition

is not allowed, as we can’t repeat a
person.
6 ways to arrange the people (3*2*1=6)
Solution: Using Permutations,
we can find the no of
arrangements

6 ways to arrange the people (3*2*1=6)

P2: vacant seats, 6 people standing, how many
ways they can sit.

Now let’s solve this using the formula. Number

of possible arrangement is nPr
In this case n = 6 & r=4. Applying this in
formula we get Number of arrangement is 6P4,
that is (6!)/(6-4)! = 360
P3. Find 3 digit numbers formed from
(1,3,5,7,9) when repetition is allowed allowed

1 2 3

Lets solve using formula.

Total number of 3 digit numbers with repetition is nr ,
here n=5 & r =3
So, Total number of 3 digit numbers with repetition
53 = 125
COMBINATION
Combination means selection of things.
Here, Order of things has no
importance.
The different combinations of 4 letters A,B,C,D are

AB,AC,AD,BC,BD.

A B
C D
COMBINATIO
NS
AB AC
AD

BC BD
 NOTATION FOR
COMBINATION

The number of all combinations of ‘n’

objects by taking ‘r’ at a time is
denoted by nCr and is given by
Example

From a class of 32 students, 4

are to be chosen for a
competition. In how many ways
can this be done?
 Example
In how many ways can 3
gentlemen and 2 ladies be
selected from a group of 5
gentlemen and 6 ladies ?

3 gentlemen can be selected from the 5

gentlemen in C(5,3) ways; and for each of
these ways the 2 ladies can be selected
from the 6 ladies in C(6,2) ways.
Therefore, the number of ways of
selection.
C(5,3)*C(6,2)=10*15=150
 Example
In how many can 5 red and 4
white balls be drawn from a bag
containing 10 red and 8 white
balls?

Total number of red balls=10

Number of red balls required=5
Therefore, number of ways of selecting 5
red balls out of 10=C(10,5)=252
Total number of white balls=8
No. of white balls required=4
Therefore, No. of ways of selecting 4 white
balls out of 8=C(8,4)=70
Hence no. of ways of selecting 5 red and 4
white balls=252*70=17,640
PROPERTIES OF
n
Cr
THANK YOU!