0% found this document useful (0 votes)
177 views

Permutation and Combination: Name - Tuhin Nayak Class - XI A' Roll No. - 29

This document provides information about permutation and combination in mathematics. It defines permutation as an arrangement of objects in a definite order, and provides the notation and formula to calculate permutations. Combination is defined as similar to permutation but where order does not matter. The document gives examples of problems involving permutations and combinations, such as the number of ways to select employees for different jobs from a pool of applicants, and the number of possible signals that can be made using different flags. It provides notation and formulas for calculating permutations and combinations.

Uploaded by

Tuhin Nayak
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
177 views

Permutation and Combination: Name - Tuhin Nayak Class - XI A' Roll No. - 29

This document provides information about permutation and combination in mathematics. It defines permutation as an arrangement of objects in a definite order, and provides the notation and formula to calculate permutations. Combination is defined as similar to permutation but where order does not matter. The document gives examples of problems involving permutations and combinations, such as the number of ways to select employees for different jobs from a pool of applicants, and the number of possible signals that can be made using different flags. It provides notation and formulas for calculating permutations and combinations.

Uploaded by

Tuhin Nayak
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 8

Permutation And

Combination
Name Tuhin Nayak
Class XI A
Roll No. - 29

Q. The manager of a coffee


shop needs to hire two
employees, one to work at the
counter and one to work at
the drive-through window.
Sara, Megan, Tricia and Jeff all
applied for a job. How many
possible ways are there for
the manager to place
the applicants?
Ans: There are 12 different
ways for the 4 applicants
to hold the 2 positions.

Fundamental Principle of
Counting

fundamental principle of
The
counting
states that If an event can
occur in m different ways, following
which another event can occur in n
different ways, then the total number of
occurrence of the events in the given
order.

If repetition of n letters are allowed


and there are x vacant place, then
the required number of words =

Example:
Given three flags of different

colours, how many different signal can


be generated, if a signal require the
use of two flags one below the other?
Answer: The flag has two vacant place
(one upper and one lower), and this to
be filled by three flag. If the upper
portion can be filled by 3 different flag
by anyone of the 3 flags then the lower
portion can be filled in 2 different ways
by anyone of the remaining 2 different
flag.
Hence, by multiplication principle, the
required number of signal =

Permutations
A permutation is an arrangement in
a definite order of a number of
objects taken some or all at a time.

Factorial
Notation

The notation n! represents the


product of the first n natural
numbers, i.e., the product is
denoted as n!
For example:
We define
Clearly, for any natural number n

Example:
Evaluate
Answer:

Derivation of the formula nPr


nPr = ,
We know,
n

Pr =

Multiplying numerator and denominator by


We get,
Pr = ,

The
number of permutation of n
different things taken r at a
time, where repetition is not
allowed is given by nPr =
The number of permutation of n
different objects taken r at a
time, where repetition is
allowed, is nr

Example:
How many 4-digit
numbers can be formed by using
the digits 1 to 9 if repetition of
digits is not allowed?
Answer: There will be as many 4
digit numbers as there are
permutations of 9 different digit
taken at a time.
Therefore, the required 4 digit
number =

Combination
Combination
is almost same as

Permutation but here the order


doesnt matter.
The formula for finding the
number of combinations of n
different objects taken r at a
time, denoted by nCr
nPr nCr r!,
nCo

Example:
A committee of 3

persons is to be constituted from
a group of 2 men and 3 women. In
how many ways can this be done?
Answer: Here, the required no of
ways =
5C =
3

THANK YOU!

You might also like