0% found this document useful (0 votes)
35 views6 pages

CH 6

Download as pdf or txt
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 6

er 6 &

Cha
pt
ion s
t at
rm u ion s
Pe in a t
om b
C

Introduction

/padhleakshay
• Permutations: It means "arrangement" of a number of objects in a definite "order".
• Combination: It means "selection" of a number of objects.
Example:
Suppose we are given some alphabets = a, b, c, d, e, f and we are told to select any
two alphabets. Then we may select alphabets as follows:
Selection : ab, ac, ad, ae, af, bc, bd, be, bf, .......................etc.
Arrangement : ab => ab, ba ; ad => ad, da ; ae => ae, ea ; abc => abc, bac, bca, cab,.....
(Please note that selection me hum already selected outcome ko repeat nhi kar sakte
jaise hamne 'ab' select kar liya tha toh abb ham 'ba' nhi select kar sakte kyuki dono
me kuch farak nhi hai).

/padhleakshay
Fundamental Principle of Counting
"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 is m×n."
Example:
Suppose Mohan has 3 pants and 2 shirts. How many different pairs of a pant and a
shirt, can he dress up with?
Dekho yaha par ek pant ko choose karne ke 3 ways hai kyuki available pants hi 3 hain.
Similarly ek shirt ko choose karne ke 2 ways hain.
Toh we can say ki pant ki har choice ke liye, shirt ki 2 choices hain..right.
Therefore, by using 'fundamental principle of counting' there are 3 × 2 = 6 pairs of a
pant and a shirt.

(*dekho yaar agar aise nhi bhi samaj aaya toh diagram se samajhte hain ho jayega
clear... don't worry)
DIAGRAM:
S1 P1 S 1
(Pant1) P1
S2 P1S2

S1 P2S1
(Pant2) P2

/padhleakshay
S2 P2S2

S1 P3S1
(Pant3) P3
S2 P3S2
6ways
So, possible no of ways in which mohan can wear 3 pant & 2 shirts = 6 ways

Example:
Find the number of 4 letter words, which can be formed out of the letters of the word
ROSE, where the repetition of the letters is not allowed.
ANS: The given word is R O S E . Suppose there are 4 vacant boxes which can be filled by
the 4 letters R, O, S, E.
i ii iii iv

/padhleakshay
4 3 2 1
Here, 1st place can be filled in 4 ways ;
2nd place can be filled in 3 ways ;
3rd place can be filled in 2 ways ;
4th place can be filled in 1 way, keeping in mind that the repetition
is not allowed.
So the no of ways in which the 4 places can be filled is 4 × 3 × 2 × 1 = 24.
Hence, the required number of words is 24.
If the repetition of the letters was allowed, then we can observe that each of the 4
vacant boxes can be filled in 4 different ways.
So, the required number of words = 4 × 4 × 4 × 4 = 256.
Factorial notation
(denoted by ! or / )

/
"The notation n! represents the product of first n natural numbers".
For e.g: 5! = 1 × 2 × 3 × 4 × 5 = 120
6! = 1 × 2 × 3 × 4 × 5 × 6 = 720
*Please note that instead of writing like above we prefer to write any factorial expansion
in reverse order like

/padhleakshay
5! = 5 × 4 × 3 × 2 × 1 = 120
6! = 6 × 5 × 4 × 3 × 2 × 1 = 720
#IMPORTANT RESULTS
1) Factorial of 0 is 1 i.e. 0! = 1
2) Factorial of 1 is 1 i.e. 1! = 1
3) Different ways of writing a given factorial:
For e.g. 8! = 8 × 7 × 6 × 5 × 4 × 3 × 2 × 1 and 4! = 4 × 3 × 2 × 1
4!

}
8! = 8 × 7 × 6 × 5 × 4!
or 8! = 8 × 7! Imp result hai acche se samaj lo....Ok!
or 8! = 8 × 7 × 6!

/padhleakshay
Example:
Evaluate: (i) 8! (ii) 4! - 3! (iii) 7! - 5!
Solution: (i) 8! = 8 × 7 × 6 × 5 × 4 × 3 × 2 × 1 = 40320
(ii) 4! - 3! = 4 × 3 × 2 × 1 - 3 × 2 × 1 = 24 - 6 = 18
OR
4! - 3! = 4 × 3! - 3! = 3! (4 - 1) = 3! × 3 = 3 × 2 × 1 × 3 = 18
(iii) 7! - 5! = 7 × 6 × 5! - 5! = 5! (7 × 6 - 1) = 5! (42 - 1)
= 5 × 4 × 3 × 2 × 1 × 41 = 4920.
Example: Is 3! + 4! = 7! ?
SOLUTION: LHS = 3! + 4! RHS = 7!
= 3! + 4 × 3! =7×6×5×4×3×2×1
= 3! (1 + 4) = 5040
= 3! × 5
=3×2×1×5
= 30
Since 30 =/ 5040 , so 3! + 4! =/ 7!
Permutation formula

n n! , 0 <_ r <_ n
Pr =
(n - r)!
where n = total no of objects given
r = no of objects to be arranged at a time.

/padhleakshay
(*Always remember that permutation formula is applicable only when the repitition of
objects is not allowed).
Example: How many 3-digit numbers can be formed from the digits 1, 2, 3, 4, 5 when
repitition of digits is not allowed?
SOLUTION: Here total no of digits given is 5 i.e n = 5
and 3-digit numbers are to be formed i.e r = 3.
Now, using the Permutation formula, we have
5 5! = 5! = 5×4×3×2! = 60
P3 =
(5 - 3)! 2! 2!
Hence, total 3-digit numbers that can be formed are 60.

Example: How many 4-digit numbers can be formed by using the digits 1 to 9 when

/padhleakshay
repitition of digits is not allowed?
SOLUTION: Here, total no of digits given to us is 9 i.e n = 9
and there are 4-digit numbers to be formed i.e r = 4.
Now, using permutation formula, we have

9
P4 = 9! =
9! = 9×8×7×6×5! = 3024
(9 - 4)! 5! 5!
Hence, total 4-digit numbers that can be formed are 3024.
#IMPORTANT RESULTS:
• When r = n then the permutation formula becomes:
n n! n! n! = n!
Pn = = =
(n - n)! 0! 1
• When r = 0 then the permutation formula becomes:
n n! n! =
P0 = =
n!
1
(n - 0)!
Combination formula
n
n
Cr = Pr n! n!
= =
r! (n - r)! (n - r)!r!
r!
• n n!
Cr =

/padhleakshay
• •
(n - r)!r!
*Always remember nPr lilhne ka matlab hota hai ki hame n elements me se r ko
n
"arrange" karna hai jabki C r likhne ka matlab hame n me se r elements ko "select"
karna hai......Ok hamesha yaad rakhna ye interpretation hai dono formulas ki.

Other formulas for combinations:


1) nCr = nCn-r , implies n = r + n - r (Imp hai)
n
2) nCn = C0 = 1
3) nCr + nCr-1 = n+1Cr
n
Example: (i) If nC8 = nC2 , find nC2 (ii) If
n
C9 = nC8 , find C17 .
n n
SOLUTION: (i) We know that Cr = Cn-r , implies n = r + n - r

/padhleakshay

•• n=8+2
n = 10
n
Now to find C2 or 10C2 we use combination formula
10!
10
C2 = = 10! = 10×9×8!
(10-2)! 2! 8! 2! 8! × 2!

= 10 × 9 = 45
2×1
(ii) Similarly as part(i) n = 9 + 8
n = 17
• 17 17! 17! 17!
• • C17 = = =
1 × 17!
(17-17)! 17! 0! × 17!

= 17! = 1
17!
Example: In how many ways can a team of 3 boys and 3 girls be selected from
5 boys and 4 girls?
SOLUTION: A team of 3 boys and 3 girls is to be selected from 5 boys and 4 girls.
5
3 boys can be selected from 5 boys in C 3 ways.
4
3 girls can be selected from 4 girls in C 3 ways.
Therefore, by multiplication principle, no of ways in which a team of

/padhleakshay
3 boys and 3 girls can be selected are
5
= C 3 × 4C 3
5! 4! 5×4×3! 4×3!
=
3! 2!
× 3! 1!
=
3! × 2×1
× 3!
= 10 × 4 = 40

Example: How many chords can be drawn through 21 points on a circle?


SOLUTION: For drawing one chord on a circle, only 2 points are required.

A• •B

• 21
• • here n = 21 and r = 2 & we need to find C2 .

/padhleakshay
21!
C2 (21-2)! 2! = 19!21!2!
21 =

21×20×19!
= = 21 × 10
19! × 2×1
= 210

*After studying from


these notes

*Note: Worksheet (important questions of all typology with answers) is


provided as a separate PDF on website padhleakshay.com

You might also like