This document discusses permutation, combination, and the fundamental principle of counting. It defines a permutation as an arrangement of objects in a definite order, while a combination is a selection of objects without regard to order. The fundamental counting principle states that if there are p ways to do one thing and q ways to do another, there are p×q total ways to do both. An example shows a boy has 4 shirts and 3 pants, giving him 4×3=12 total outfits. Formulas for permutation, combination, and their relationships are also presented.

1. Permutation &
Combination
Chapter-07

2. Permutation:-
Apermutationisdefined asanarrangementinadefiniteorderof anumberofobjects
taken,some orallatatime. Countingpermutations aremerely countingthenumberof
waysinwhichsome orallobjects atatimearerearranged.Theconvenient expression to
denote permutation isdefined as“nPr”.
Combination:-
Acombinationisaselection ofall orpartofasetofobjects, withoutregardtotheorderin
whichobjectsare selected. For example, suppose wehaveaset of three letters: A,B, and
C. Wemightaskhowmanywayswe canselect 2 letters fromthatset. Eachpossible
selection wouldbeanexample ofacombination.

3. Fundamental Principle of Counting:-
• The Fundamental Counting Principle (also called the counting rule)
is a way to figure out the number of outcomes in a probability
problem. Basically, you multiply the events together to get the
total number of outcomes. The fundamental counting principle
states that if there are p ways to do one thing, and q ways to do
another thing, then there are p×q ways to do both things.
• Example:- A boy has 4 T-shirts and 3 pairs of pants. Find the total
number of possible outfits the boy has.
Solution: The above question is one of the fundamental counting
principle examples in real life.
According to the question, the boy has 4 t-shirts and 3 pairs of
pants.
So, the total number of outfits with the boy are: Total number of
outfits = 4 x 3 = 12The boy has 12 outfits with him.

4. Addition Principle &
Factorial
• Addition Principle: If an operation A can be performed in m ways and another operation S, which is
independent of A, can be performed in n ways, then A and B can performed in (m + n) ways. This can be
extended to any finite number of exclusive events.
• Factorial:
The continued product of first n natural number is called factorial ‘n’.
It is denoted by n! or n! = n(n – 1)(n – 2)… 3 × 2 × 1 and 0! = 1! = 1

5. # Important Results of Permutation:
•The number of permutation of n things taken r at a time, when
repetition of object is allowed is nr.
•The number of permutation of n objects of which p1 are of one
kind, p2 are of second kind,… pk are of kth kind such that p1 +
p2 + p3 + … + pk = n is
𝑛!
𝑃1!𝑃2!𝑝3!−𝑃𝑘!
•Number of permutation of n different objects taken r at a time,
When a particular object is to be included in each arrangement is
r. n-1Pr-1
•When a particular object is always excluded, then number of
arrangements = n-1Pr.
•Number of permutations of n different objects taken all at a time
when m specified objects always come together is m! (n – m +
1)!.
•Number of permutation of n different objects taken all at a time
when m specified objects never come together is n! – m! (n – m +

6. Relationship between Permutation &
Combination:-
• Inpermutationandcombination forclass11,therelationshipbetweenthe
twoconceptsisgivenbytwotheorems.Theyare-
𝑛𝑃𝑟
= 𝑛𝐶𝑟
r! , if 0 < r ≤ n
𝑛𝐶𝑟+𝑛𝑐 𝑟−1
= 𝑛 + 1 𝐶𝑟

7. AllFormulasinPermutation&Combination:-

8. THANK YOU
Presented By Ashutosh Kumar Yadav (Roll 08) and
Harshit Singh(Roll 14)