Scribd
Upload
35 views

Permutation and Combination

The document discusses concepts and formulas related to permutation and combination. It defines permutations as arrangements where order matters and combinations as arrangements where order does not matter. It provides examples and formulas for permutations with and without repetition and combinations with and without repetition. The document also includes example problems and their solutions.

Uploaded by

santhoshkumarb9454
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
35 views

Permutation and Combination

The document discusses concepts and formulas related to permutation and combination. It defines permutations as arrangements where order matters and combinations as arrangements where order does not matter. It provides examples and formulas for permutations with and without repetition and combinations with and without repetition. The document also includes example problems and their solutions.

Uploaded by

santhoshkumarb9454
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/ 21

PERMUTATION AND

COMBINATION
OVERVIEW

*CONCEPTS
*FORMULAS
*PROBLEMS
*POINTS TO REMEMBER
CONCEPTS
The Permutation and Combinations concepts helps you to solve problems in
Competitive exams and is also implemented in real life at different situations.
Permutations: A set of objects in which position(order) is important are
permutations. OR The different arrangement of a given number of things by
taking some or all at a time, are called permutation.

There are two types of permutations:


a. Permutations with repetition.
b. Permutations without repetition.
Types Of Permutations:
1. Permutations with Repetition: When we have “n” things to choose from…we
have “n” choices each time!
When choosing “r” of them, the permutations are: n*n*….(r times)
It is exponent of r:n*n*…(r times)=n^r
EX: There are 10 numbers to choose from(0,1,….9) and we choose 3 of them:
Ans: Given, n= 10, r=3
i.e,10*10*…(3 times) = 10^3 = 1000 permutations.
.

2. Permutations without Repetition: We have to reduce the number of available


choices each time.
EX: What order could 16 pool balls be in? After choosing, say number “14” we cant
choose it again. So, first choice has 16 possibilities and our next choice has 15
possibilities, then 14,13, etc and the total permutations are:
16*15*14*13*….=20922789888000
But maybe we don’t want to choose them all, just 3 of them, so that is only:
16*15*14=3360
In other words, there are 3360 different ways that 3 pool balls could be
Arranged out of 16 balls.
.

Without repetition our choices get reduced each time.


The Factorial function(!) just means to multiply a series of descending natural
numbers.
EX: 4! = 4*3*2*1 = 24
1! = 1
0! = 1

Notations:
P(n,r) = nPr = n!/(n-r)!
.

Combinations: A set of objects in which position (order) is NOT important.


Types Of Combinations:
1. Combinations with Repetition:
There are five flavors of ice-cream: Banana, chocolate, lemon, strawberry and
vanilla. We can have three scoops. How many variations will there be?
Let use letters for the flavors: {b,c,l,s,v}
Selections include:
• {c,c,c}(3 scoops of chocolate)
• {b,l,v}(one each of banana, lemon and vanilla)
• {b,v,v}(one of banana, two of vanilla)
There are n = 5 and r = 3, (n+r-1)/(r) =(n+r-1)!/r!(n-1)!
.

There are n = 5 and r = 3, (n+r-1)/(r) =(n+r-1)!/r!(n-1)!


i.e (5+3-1)!/3!(5-1)! = 7!/(3!)(4!) = 5040/6*24 = 35

2. Combinations without Repetition: The order does matter(i.e. permutations), then


alter it is the order does not matter.
EX: 3 letters a, b, c taken all at a time is abc.

Notations:
nCr = n!/(r!)(n-r)! = n(n-1)(n-2)….to r factors/(r!).
FORMULAS
Factorial Notation:
n! = n(n-1)(n-2)…3.2.1.
 Permutation:
nPr = n(n-1)(n-2)…(n-r+1) = n!/(n-r)!
Number of permutations of these n objects = n!/(p1!)(p2!)…(pr!)
Combination:
nCr = n!/(r!)(n-r)! = n(n-1)(n-2)..to r factors/(r!)
nCn = 1 and nC0 = 1
nCr = nC(n-r)
PROBLEMS
6. What is the value of 100P2 ?
A. 12000 B. 5600
C. 9900 D. 9801

100
P2 =100×99=9900
PROBLEMS
5. How many words can be formed by using all letters of the word 'BIHAR'?
A. 720 B. 24
C. 120 D. 60

The word 'BIHAR' has 5 letters and all these 5 letters are different.

Total number of words that can be formed by using all these 5 letters
= 5P5 =5!
=5×4×3×2×1=120
In how many ways can the letters of the word 'LEADER' be arranged?
72
144
360
720
None of these
PROBLEMS
2. In how many ways can a group of 5 men and 2 women be made out of a total of 7 men and 3
women?
A. 64 B. 1
C. 126 D. 63

We need to select 5 men from 7 men and 2 women from 3 women.

Number of ways to do this


= 7C5 × 3C2
= 7C2 × 3C1 [∵ nCr = nC(n-r)]
=7×62×1×3=21×3=63
PROBLEMS
1. Out of 7 consonants and 4 vowels, how many words of 3 consonants and 2 vowels can be
formed?
A. 25200 B. 21300
C. 24400 D. 210

Number of ways of selecting 3 consonants from 7 and 2 vowels from 4


= 7C3 × 4C2
=(7×6×53×2×1)×(4×32×1)=210

It means we can have 210 groups where each group contains total 5 letters (3 consonants and 2 vowels).

Number of ways of arranging 5 letters among themselves


5!=5×4×3×2×1=120

Hence, required number of ways


=210×120=25200
PROBLEMS
3. In how many different ways can the letters of the word 'MATHEMATICS' be arranged such that
the vowels must always come together?
A. 100020 B. 140020
C. 9800 D. 120960
The word 'MATHEMATICS' has 11 letters. It has the vowels 'A','E','A','I' in it and these 4 vowels must always come together. Hence
these 4 vowels can be grouped and considered as a single letter. That is, MTHMTCS(AEAI).

Hence we can assume total letters as 8. But in these 8 letters, 'M' occurs 2 times, 'T' occurs 2 times but rest of the letters are
different.

Hence,number of ways to arrange these letters


=8!/(2!)(2!)=8!/(2!)(2!) =8×7×6×5×4×3×2×1/{(2×1)(2×1)}=10080

In the 4 vowels (AEAI), 'A' occurs 2 times and rest of the vowels are different.

Number of ways to arrange these vowels among themselves =4!2!=4×3×2×12×1=12

Hence, required number of ways


=10080×12=120960
PROBLEMS
7. A question paper has two parts P and Q, each containing 10 questions. If a student needs to
choose 8 from part P and 4 from part Q, in how many ways can he do that?
A. 6020 B. 9450
C. None of these D. 1200

Number of ways to choose 8 questions from part P = 10C8


Number of ways to choose 4 questions from part Q = 10C4

Total number of ways


= 10C8 × 10C4
= 10C2 × 10C4[∵ nCr = nC(n-r)]
=(10×92×1)(10×9×8×74×3×2×1)=45×210=9450
• In a group of 6 boys and 4 girls, four children are to be
selected. In how many different ways can they be selected
such that at least one boy should be there?
• 159
• 194
• 205
• 209
• None of these
PROBLEMS
8. A box contains 4 red, 3 white and 2 blue balls. Three balls are drawn at random. Find out the
number of ways of selecting the balls of different colours?
A. 48 B. 12
C. 24 D. 62

1 red ball can be selected in 4C1 ways.


1 white ball can be selected in 3C1 ways.
1 blue ball can be selected in 2C1 ways.

Total number of ways


= 4C1 × 3C1 × 2C1
=4×3×2=24
• In how many different ways can the letters of the word 'DETAIL'
be arranged in such a way that the vowels occupy only the odd
positions?
• 32
• 48
• 36
• 60
• 120
PROBLEMS
9. In how many different ways can 5 girls and 5 boys form a circle such that the boys and the girls
alternate?
A. 1200 B. 1400
C. 2880 D. 3212

Around a circle, 5 boys can be arranged in 4! ways.

Given that the boys and the girls alternate. Hence there are 5 places for the girls. Therefore the girls can
be arranged in 5! ways.

Total number of ways


=4!×5!=24×120=2880
THANK YOU

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy