16806 per com
DESCRIPTION
TRANSCRIPT
![Page 1: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/1.jpg)
Permutations and Combinations
Quantitative Aptitude & Business Statistics
![Page 2: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/2.jpg)
The Fundamental Principle of Multiplication
• If there are • n1 ways of doing one operation, • n2 ways of doing a second
operation, n3 ways of doing a third operation , and so forth,
Quantitative Aptitude & Business Statistics:Permutations and Combinations 2
![Page 3: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/3.jpg)
• then the sequence of k operations can be performed in n1 n2 n3….. nk ways.
• N= n1 n2 n3….. nk
Quantitative Aptitude & Business Statistics:Permutations and Combinations 3
![Page 4: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/4.jpg)
Example 1 • A used car wholesaler has agents
who classify cars by size (full, medium, and compact) and age (0 - 2 years, 2- 4 years, 4 - 6 years, and over 6 years).
• Determine the number of possible automobile classifications.
Quantitative Aptitude & Business Statistics:Permutations and Combinations 4
![Page 5: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/5.jpg)
Solution
Quantitative Aptitude & Business Statistics:Permutations and Combinations 5
Full(F)
Compact
(C)
Medium
(M)
0-2 2-4 4-6 >6
0-2 2-4 4-6 >6
0-2 2-4 4-6 >6
The tree diagram enumerates all possible classifications, the total number of which is 3x4= 12.
![Page 6: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/6.jpg)
Example 2 • Mr. X has 2 pairs of trousers, 3
shirts and 2 ties. • He chooses a pair of trousers, a
shirt and a tie to wear everyday. • Find the maximum number of
days he does not need to repeat his clothing.
Quantitative Aptitude & Business Statistics:Permutations and Combinations 6
![Page 7: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/7.jpg)
Solution
• The maximum number of days he does not need to repeat his clothing is 2×3×2 = 12
Quantitative Aptitude & Business Statistics:Permutations and Combinations 7
![Page 8: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/8.jpg)
1.2 Factorials
• The product of the first n consecutive integers is denoted by n! and is read as “factorial n”.
• That is n! = 1×2×3×4×…. ×(n-1) ×n
• For example, • 4!=1x2x3x4=24, • 7!=1×2×3×4×5×6×7=5040. • Note 0! defined to be 1.
Quantitative Aptitude & Business
Statistics:Permutations and Combinations 8
![Page 9: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/9.jpg)
Quantitative Aptitude & Business Statistics:Permutations and Combinations 9
•The product of any number of consecutive integers can be expressed as a quotient of two factorials, for example,
• 6×7×8×9 = 9!/5! = 9! / (9 – 4)!
• 11×12×13×14×15= 15! / 10!
=15! / (15 – 5)!
In particular,
• n×(n – 1)×(n – 2)×...×(n – r + 1)
• = n! / (n – r)!
![Page 10: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/10.jpg)
1.3 Permutations
• (A) Permutations • A permutation is an arrangement
of objects. • abc and bca are two different
permutations.
Quantitative Aptitude & Business Statistics:Permutations and Combinations 10
![Page 11: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/11.jpg)
• 1. Permutations with repetition
– The number of permutations of r objects, taken from n unlike objects,
– can be found by considering the number of ways of filling r blank spaces in order with the n given objects.
– If repetition is allowed, each blank space can be filled by the objects in n different ways.
Quantitative Aptitude & Business Statistics:Permutations and Combinations 11
![Page 12: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/12.jpg)
• Therefore, the number of permutations of r objects, taken from n unlike objects,
• each of which may be repeated any number of times
= n × n × n ×.... × n(r factors) = nr
Quantitative Aptitude & Business Statistics:Permutations and Combinations 12
n n n n n 1 2 3 4 r
![Page 13: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/13.jpg)
2. Permutations without repetition
• If repetition is not allowed, the number of ways of filling each blank space is one less than the preceding one.
Quantitative Aptitude & Business Statistics:Permutations and Combinations 13
n n-1 n-2 n-3 n-r+1 1 2 3 4 r
![Page 14: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/14.jpg)
Therefore, the number of permutations of r objects, taken from n unlike objects, each of which can only be used once in each permutation
=n(n— 1)(n—2) .... (n—r + 1)
Various notations are used to represent the number of permutations of a set of n elements taken r at a time;
Quantitative Aptitude & Business Statistics:Permutations and Combinations 14
![Page 15: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/15.jpg)
• some of them are
Quantitative Aptitude & Business Statistics:Permutations and Combinations 15
),(,, rnPPP rnn
r ),(,, rnPPP rnn
r ),(,, rnPPP rnn
r ),(,, rnPPP rnn
r ),(,, rnPPP rnn
r ),(,, rnPPP rnn
r
),(,, rnPPP rnn
r
nrP
rnnnnrn
rnrnnnnrn
n
=
+−−−=⋅⋅−
⋅⋅−+−−−=
−
)1)....(2)(1(123)...(
123)...)(1)....(2)(1()!(
!
Since
We have )!(
!rn
nP nr −=
![Page 16: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/16.jpg)
Example 3
• How many 4-digit numbers can be made from the figures 1, 2, 3, 4, 5, 6, 7 when
• (a) repetitions are allowed; • (b) repetition is not allowed?
Quantitative Aptitude & Business Statistics:Permutations and Combinations 16
![Page 17: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/17.jpg)
• Solution • (a) Number of 4-digit numbers = 74 = 2401. • (b) Number of 4 digit numbers =7 ×6 ×5 ×4 = 840.
Quantitative Aptitude & Business Statistics:Permutations and Combinations 17
![Page 18: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/18.jpg)
Example 4
• In how many ways can 10 men be arranged
• (a) in a row, • (b) in a circle? • Solution
• (a) Number of ways is
= 3628800
Quantitative Aptitude & Business Statistics:Permutations and Combinations 18
1010P
![Page 19: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/19.jpg)
• Suppose we arrange the 4 letters A, B, C and D in a circular arrangement as shown.
• Note that the arrangements ABCD, BCDA, CDAB and DABC are not distinguishable.
Quantitative Aptitude & Business Statistics:Permutations and Combinations 19
A
D
C
B
![Page 20: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/20.jpg)
• For each circular arrangement there are 4 distinguishable arrangements on a line.
• If there are P circular arrangements, these yield 4P arrangements on a line, which we know is 4!.
Quantitative Aptitude & Business Statistics:Permutations and Combinations 20
!3)!14(4!4
=−==PHence
![Page 21: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/21.jpg)
• The number of distinct circular arrangements of n objects is (n —1)!
• Hence 10 men can be arranged in a circle in 9! = 362 880 ways.
Quantitative Aptitude & Business Statistics:Permutations and Combinations 21
Solution (b)
![Page 22: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/22.jpg)
(B) Conditional Permutations
• When arranging elements in order , certain restrictions may apply.
• In such cases the restriction should be dealt with first..
Quantitative Aptitude & Business Statistics:Permutations and Combinations 22
![Page 23: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/23.jpg)
Example 5 How many even numerals between 200
and 400 can be formed by using 1, 2, 3, 4, 5 as digits
(a) if any digit may be repeated; (b) if no digit may be repeated?
Quantitative Aptitude & Business Statistics:Permutations and Combinations 23
![Page 24: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/24.jpg)
• Solution (a) • Number of ways of choosing the
hundreds’ digit = 2. • Number of ways of choosing the
tens’ digit = 5. • Number of ways of choosing the
unit digit = 2. • Number of even numerals
between 200 and 400 is 2 × 5 × 2 = 20.
Quantitative Aptitude & Business Statistics:Permutations and Combinations 24
![Page 25: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/25.jpg)
•Solution (b) •If the hundreds’ digit is 2, then the number of ways of choosing an even unit digit = 1, and the number of ways of choosing a tens’ digit = 3. •the number of numerals formed 1×1×3 = 3.
Quantitative Aptitude & Business Statistics:Permutations and Combinations 25
![Page 26: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/26.jpg)
If the hundreds’ digit is 3, then the
number of ways of choosing an even. unit digit = 2, and the number of ways of choosing a tens’ digit = 3.
• number of numerals formed = 1×2×3 = 6. • the number of even numerals
between 200 and 400 = 3 + 6 = 9 Quantitative Aptitude & Business
Statistics:Permutations and Combinations 26
![Page 27: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/27.jpg)
Example 6 In how many ways can
7 different books be arranged on a shelf (a) if two particular books are together;
Quantitative Aptitude & Business Statistics:Permutations and Combinations 27
![Page 28: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/28.jpg)
• Solution (a)
• If two particular books are together, they can be considered as one book for arranging.
• The number of arrangement of 6 books
= 6! = 720. • The two particular books can be
arranged in 2 ways among themselves.
• The number of arrangement of 7 books with two particular books together
Quantitative Aptitude & Business Statistics:Permutations and Combinations 28
![Page 29: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/29.jpg)
(b) if two particular books are separated?
• Solution (b)
• Total number of arrangement of 7 books = 7! = 5040.
• the number of arrangement of 7 books with 2 particular books separated = 5040 -1440 = 3600.
Quantitative Aptitude & Business Statistics:Permutations and Combinations 29
![Page 30: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/30.jpg)
(C) Permutation with Indistinguishable Elements
• In some sets of elements there may be certain members that are indistinguishable from each other.
• The example below illustrates how to find the number of permutations in this kind of situation.
Quantitative Aptitude & Business Statistics:Permutations and Combinations 30
![Page 31: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/31.jpg)
Example 7 In how many ways can the letters of
the word “ISOS CELES” be arranged to form a new “word” ?
• Solution • If each of the 9 letters of
“ISOSCELES” were different, there would be P= 9! different possible words.
Quantitative Aptitude & Business Statistics:Permutations and Combinations 31
![Page 32: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/32.jpg)
• However, the 3 S’s are indistinguishable from each other and can be permuted in 3! different ways.
• As a result, each of the 9! arrangements of the letters of “ISOSCELES” that would otherwise spell a new word will be repeated 3! times.
Quantitative Aptitude & Business Statistics:Permutations and Combinations 32
![Page 33: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/33.jpg)
• To avoid counting repetitions resulting from the 3 S’s, we must divide 9! by 3!.
• Similarly, we must divide by 2! to avoid counting repetitions resulting from the 2 indistinguishable E’s.
• Hence the total number of words that can be formed is
9! ÷3! ÷2! = 30240 Quantitative Aptitude & Business
Statistics:Permutations and Combinations 33
![Page 34: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/34.jpg)
• If a set of n elements has k1 indistinguishable elements of one kind, k2 of another kind,
and so on for r kinds of elements, then the number of permutations of the set of n elements is
Quantitative Aptitude & Business Statistics:Permutations and Combinations 34
!!!!
21 rkkkn
⋅⋅⋅⋅
![Page 35: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/35.jpg)
1.4 Combinations
• When a selection of objects is made with no regard being paid to order, it is referred to as a combination.
• Thus, ABC, ACB, BAG, BCA, CAB, CBA are different permutation, but they are the same combination of letters.
Quantitative Aptitude & Business Statistics:Permutations and Combinations 35
![Page 36: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/36.jpg)
• Suppose we wish to appoint a committee of 3 from a class of 30 students.
• We know that P330 is the number of
different ordered sets of 3 students each that may be selected from among 30 students.
• However, the ordering of the students on the committee has no significance,
Quantitative Aptitude & Business Statistics:Permutations and Combinations 36
![Page 37: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/37.jpg)
• so our problem is to determine the number of three-element unordered subsets that can be constructed from a set of 30 elements.
• Any three-element set may be ordered in 3! different ways, so P3
30 is 3! times too large. • Hence, if we divide P3
30 by 3!,the result will be the number of unordered subsets of 30 elements taken 3 at a time. Quantitative Aptitude & Business
Statistics:Permutations and Combinations 37
![Page 38: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/38.jpg)
• This number of unordered subsets is also called the number of combinations of 30 elements taken 3 at a time, denoted by C3
30 and
Quantitative Aptitude & Business Statistics:Permutations and Combinations 38
4060!3!27
!30!3
1 303
303
==
= PC
![Page 39: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/39.jpg)
• In general, each unordered r-element subset of a given n-element set (r≤ n) is called a combination.
• The number of combinations of n elements taken r at a time is denoted by Cn
r or nCr or C(n, r) .
Quantitative Aptitude & Business Statistics:Permutations and Combinations 39
![Page 40: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/40.jpg)
• A general equation relating combinations to permutations is !)!(
!!
1rrn
nPr
C nr
nr −
==
Quantitative Aptitude & Business Statistics:Permutations and Combinations 40
![Page 41: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/41.jpg)
• Note: • (1) Cn
n = Cn0 = 1
• (2) Cn1 = n
• (3) Cnn = Cn
n-r
Quantitative Aptitude & Business Statistics:Permutations and Combinations 41
![Page 42: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/42.jpg)
Example8
• If 167 C 90+167 C x =168 C x then x is
• Solution: nCr-1+nCr=n+1 Cr • Given 167 C90+167c x =168C x
• We may write • 167C91-1 + 167 C91=167+1 C61
• =168 C91 • X=91
Quantitative Aptitude & Business Statistics:Permutations and Combinations 42
![Page 43: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/43.jpg)
Example9
• If 20 C 3r= 20C 2r+5 ,find r • Using nCr=nC n-r in the right –side
of the given equation ,we find , • 20 C 3r =20 C 20-(2r+5) • 3r=15-2r • r=3
Quantitative Aptitude & Business Statistics:Permutations and Combinations 43
![Page 44: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/44.jpg)
Example 10
• If 100 C 98 =999 C 97 +x C 901 find x. • Solution 100C 98 =999C 98 +999C97 • = 999C901+999C97
• X=999
Quantitative Aptitude & Business Statistics:Permutations and Combinations 44
![Page 45: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/45.jpg)
Example11
• If 13 C 6 + 2 13 C5 +13 C 4 =15 C x ,the value of x is
• Solution : • 15C x= 13C 6 + 13 C 5 + 13 C 4 = • =(13c 6+13 C 5 ) + • (13 C 5 + 13 C 4) • = 14 C 6 +14 C 5 =15C6 • X=6 or x+6 =15 • X=6 or 8
Quantitative Aptitude & Business Statistics:Permutations and Combinations 45
![Page 46: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/46.jpg)
Example12
• If n C r-1=36 ,n Cr =84 and n C r+1 =126 then find r
• Solution
• n-r+1 =7/3 * r
• 3/2 (r+1)+1 =7/3 * r • r=3
Quantitative Aptitude & Business Statistics:Permutations and Combinations 46
37
3684
1
==−r
r
nCnC
23
841261 ==+
r
r
nCnC
![Page 47: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/47.jpg)
Example 13
• How many different 5-card hands can be dealt from a deck of 52 playing cards?
Quantitative Aptitude & Business Statistics:Permutations and Combinations 47
![Page 48: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/48.jpg)
Solution
• Since we are not concerned with the order in which each card is dealt, our problem concerns the number of combinations of 52 elements taken 5 at a time.
• The number of different hands is C52
5= 2118760.
Quantitative Aptitude & Business Statistics:Permutations and Combinations 48
![Page 49: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/49.jpg)
Example 14
6 points are given and no three of them are collinear. (a) How many triangles can be formed by using 3 of the given points as vertices?
Quantitative Aptitude & Business Statistics:Permutations and Combinations 49
![Page 50: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/50.jpg)
Solution:
• Solution • (a) Number of triangles • = number of ways • of selecting 3 points out of 6 • = C6
3 = 20.
Quantitative Aptitude & Business Statistics:Permutations and Combinations 50
![Page 51: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/51.jpg)
• b) How many pairs of triangles can be formed by using the 6 points as vertices ?
Quantitative Aptitude & Business Statistics:Permutations and Combinations 51
![Page 52: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/52.jpg)
• Let the points be A, B, C, D, E, F. • If A, B, C are selected to form a
triangles, then D, E, F must form the other triangle.
• Similarly, if D, E, F are selected to form a triangle, then A, B, C must form the other triangle.
Quantitative Aptitude & Business Statistics:Permutations and Combinations 52
![Page 53: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/53.jpg)
• Therefore, the selections A, B, C and D, E, F give the same pair of triangles and the same applies to the other selections.
• Thus the number of ways of forming a pair of triangles
= C63 ÷ 2 = 10
Quantitative Aptitude & Business Statistics:Permutations and Combinations 53
![Page 54: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/54.jpg)
Example 15
• From among 25 boys who play basketball, in how many different ways can a team of 5 players be selected if one of the players is to be designated as captain?
Quantitative Aptitude & Business Statistics:Permutations and Combinations 54
![Page 55: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/55.jpg)
Solution
• A captain may be chosen from any of the 25 players.
• The remaining 4 players can be chosen in C254
different ways. • By the fundamental counting principle, the
total number of different teams that can be formed is
25 × C244=265650.
Quantitative Aptitude & Business Statistics:Permutations and Combinations 55
![Page 56: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/56.jpg)
(B) Conditional Combinations
• If a selection is to be restricted in some way, this restriction must be dealt with first.
• The following examples illustrate such conditional combination problems.
Quantitative Aptitude & Business Statistics:Permutations and Combinations 56
![Page 57: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/57.jpg)
A committee of 3 men and 4 women is to be
selected from 6 men and 9 women.
If there is a married couple among the 15 persons, in how many
ways can the committee be selected so that it contains the married
couple?
Quantitative Aptitude & Business Statistics:Permutations and Combinations 57
![Page 58: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/58.jpg)
• Solution • If the committee contains the
married couple, then only 2 men and 3 women are to be selected from the remaining 5 men and 8 women.
• The number of ways of selecting 2 men out of 5 = C5
2 = 10.
Quantitative Aptitude & Business Statistics:Permutations and Combinations 58
![Page 59: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/59.jpg)
• The number of ways of selecting 3 women out of 8 =C8
3 = 56. • the number of ways of selecting
the committee = lO × 56 = 560.
Quantitative Aptitude & Business Statistics:Permutations and Combinations 59
![Page 60: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/60.jpg)
Example 17
• Find the number of ways a team of 4 can be chosen from 15 boys and 10 girls if (a) it must contain 2 boys and 2 girls,
Quantitative Aptitude & Business Statistics:Permutations and Combinations 60
![Page 61: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/61.jpg)
• Solution (a) • Boys can be chosen in C15
2 = 105 ways
• Girls can be chosen in C102
= 45 ways.
• Total number of ways is 105 × 45 = 4725.
Quantitative Aptitude & Business Statistics:Permutations and Combinations 61
![Page 62: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/62.jpg)
(b) it must contain at least 1 boy and 1 girl.
• Solution : • If the team must contain at least 1
boy and 1 girl it can be formed in the following ways:
• (I) 1 boy and 3 girls, with C151 × C10
3
= 1800 ways, • (ii) 2 boys and 2 girls, with 4725
ways, • (iii) 3 boys and 1 girl, with C15
3 × C10
1 = 4550 ways.
• the total number of teams is
Quantitative Aptitude & Business Statistics:Permutations and Combinations 62
![Page 63: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/63.jpg)
Example 18
• Mr. .X has 12 friends and wishes to invite 6 of them to a party. Find the number of ways he may do this if (a) there is no restriction on choice,
Quantitative Aptitude & Business Statistics:Permutations and Combinations 63
![Page 64: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/64.jpg)
• Solution (a) • An unrestricted choice of 6
out of 12 gives C126=
924.
Quantitative Aptitude & Business Statistics:Permutations and Combinations 64
![Page 65: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/65.jpg)
• (b) two of the friends is a couple and will not attend separately,
Quantitative Aptitude & Business Statistics:Permutations and Combinations 65
![Page 66: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/66.jpg)
B Solution
• If the couple attend, the remaining 4 may then be chosen from the other 10 in C10
4 ways.
• If the couple does not attend, then He simply chooses 6 from the other 10 in C10
6 ways.
• total number of ways is C104 +
C106 = 420.
Quantitative Aptitude & Business Statistics:Permutations and Combinations 66
![Page 67: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/67.jpg)
Example 19 Find the number of ways in which 30 students can be divided into
three groups, each of 10 students, if the order of the groups and the arrangement of the students in a
group are immaterial.
Quantitative Aptitude & Business Statistics:Permutations and Combinations 67
![Page 68: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/68.jpg)
• Solution
• Let the groups be denoted by A, B and C. Since the arrangement of the students in a group is immaterial,
• group A can be selected from the 30 students in C30
10 ways .
Quantitative Aptitude & Business Statistics:Permutations and Combinations 68
![Page 69: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/69.jpg)
• Group B can be selected from the remaining 20 students in C20
10 ways.
• There is only 1 way of forming group C from the remaining 10 students.
Quantitative Aptitude & Business Statistics:Permutations and Combinations 69
![Page 70: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/70.jpg)
• Since the order of the groups is immaterial, we have to divide the product C30
10 × C2010 × C10
10 by 3!,
• hence the total number of ways of forming the three groups is
Quantitative Aptitude & Business Statistics:Permutations and Combinations 70
1010
2010
303!3
1 CCC ×××
![Page 71: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/71.jpg)
Example20 • If n Pr = 604800 10 C r =120 ,find
the value of r
• We Know that nC r .r P r = nPr . • We will use this equality to find r • 10Pr =10Cr .r| • r |=604800/120=5040=7 | • r=7
Quantitative Aptitude & Business Statistics:Permutations and Combinations 71
![Page 72: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/72.jpg)
Example 21
• Find the value of n and r • n Pr = n P r+1 and n C r = n C r-1
Solution : Given n Pr = n P r+1 n –r=1 (i) n C r = n C r-1 n-r = r-1 (ii) Solving i and ii r=2 and n=3
Quantitative Aptitude & Business Statistics:Permutations and Combinations 72
![Page 73: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/73.jpg)
Multiple choice Questions
Quantitative Aptitude & Business Statistics:Permutations and Combinations 73
![Page 74: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/74.jpg)
1. Eleven students are participating in a race. In how many ways the first 5 prizes can be won?
A) 44550 B) 55440 C) 120 D) 90 Quantitative Aptitude & Business
Statistics:Permutations and Combinations 74
![Page 75: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/75.jpg)
1. Eleven students are participating in a race. In how many ways the first 5 prizes can be won?
A) 44550 B) 55440 C) 120 D) 90 Quantitative Aptitude & Business
Statistics:Permutations and Combinations 75
![Page 76: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/76.jpg)
• 2. There are 10 trains plying between Calcutta and Delhi. The number of ways in which a person can go from Calcutta to Delhi and return
• A) 99. • B) 90 • C) 80 • D) None of these
Quantitative Aptitude & Business Statistics:Permutations and Combinations 76
![Page 77: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/77.jpg)
• 2. There are 10 trains plying between Calcutta and Delhi. The number of ways in which a person can go from Calcutta to Delhi and return
• A) 99. • B) 90 • C) 80 • D) None of these
Quantitative Aptitude & Business Statistics:Permutations and Combinations 77
![Page 78: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/78.jpg)
• 3. 4P4 is equal to • A) 1 • B) 24 • C) 0 • D) None of these
Quantitative Aptitude & Business Statistics:Permutations and Combinations 78
![Page 79: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/79.jpg)
• 3. 4P4 is equal to • A) 1 • B) 24 • C) 0 • D) None of these
Quantitative Aptitude & Business Statistics:Permutations and Combinations 79
![Page 80: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/80.jpg)
• 4.In how many ways can 8 persons be seated at a round table?
• A) 5040 • B) 4050 • C) 450 • D) 540
Quantitative Aptitude & Business
Statistics:Permutations and Combinations 80
![Page 81: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/81.jpg)
• 4.In how many ways can 8 persons be seated at a round table?
• A) 5040 • B) 4050 • C) 450 • D) 540
Quantitative Aptitude & Business
Statistics:Permutations and Combinations 81
![Page 82: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/82.jpg)
• 5. If then
value of n is
• A) 15 • B) 14 • C) 13 • D) 12
Quantitative Aptitude & Business Statistics:Permutations and Combinations 82
n n+113 12P : P =3 : 4
![Page 83: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/83.jpg)
• 5. If then
value of n is
• A) 15 • B) 14 • C) 13 • D) 12
Quantitative Aptitude & Business Statistics:Permutations and Combinations 83
n n+113 12P : P =3 : 4
![Page 84: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/84.jpg)
• 6.Find r if 5Pr = 60 • A) 4 • B) 3 • C) 6 • D) 7
Quantitative Aptitude & Business Statistics:Permutations and Combinations 84
![Page 85: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/85.jpg)
• 6.Find r if 5Pr = 60 • A) 4 • B) 3 • C) 6 • D) 7
Quantitative Aptitude & Business Statistics:Permutations and Combinations 85
![Page 86: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/86.jpg)
• 7. In how many different ways can seven persons stand in a line for a group photograph?
• A) 5040 • B) 720 • C) 120 • D) 27
Quantitative Aptitude & Business Statistics:Permutations and Combinations 86
![Page 87: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/87.jpg)
• 7. In how many different ways can seven persons stand in a line for a group photograph?
• A) 5040 • B) 720 • C) 120 • D) 27
Quantitative Aptitude & Business Statistics:Permutations and Combinations 87
![Page 88: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/88.jpg)
• 8. If then the value of n is ______
A) 0 B) –2 C) 8 D) None of above
Quantitative Aptitude & Business Statistics:Permutations and Combinations 88
18 18n n+2C = C
![Page 89: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/89.jpg)
• 8. If then the value of n is ______
A) 0 B) –2 C) 8 D) None of above
Quantitative Aptitude & Business Statistics:Permutations and Combinations 89
18 18n n+2C = C
![Page 90: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/90.jpg)
• 9. The ways of selecting 4 letters from the word EXAMINATION is
• A) 136. • B) 130 • C) 125 • D) None of these
Quantitative Aptitude & Business Statistics:Permutations and Combinations 90
![Page 91: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/91.jpg)
• 9. The ways of selecting 4 letters from the word EXAMINATION is
• A) 136. • B) 130 • C) 125 • D) None of these
Quantitative Aptitude & Business Statistics:Permutations and Combinations 91
![Page 92: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/92.jpg)
• 10 If 5Pr = 120, then the value of r is
• A) 4,5 • B) 2 • C) 4 • D) None of these
Quantitative Aptitude & Business Statistics:Permutations and Combinations 92
![Page 93: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/93.jpg)
• 10 If 5Pr = 120, then the value of r is
• A) 4,5 • B) 2 • C) 4 • D) None of these
Quantitative Aptitude & Business Statistics:Permutations and Combinations 93
![Page 94: 16806 per com](https://reader034.vdocuments.net/reader034/viewer/2022051609/545cea17af7959be0e8b49f8/html5/thumbnails/94.jpg)
THE END
Permutations and Combinations