mgv‡ek(Combination)

A combination is the selection of a certain number of objects taken from a

group of object without regarding to order.

mgv‡e‡ki †ÿ‡Î, order (µg) AMÖvn¨ Kiv nq hv web¨v‡mi †ÿ‡Î aZ©e¨

n
We use the symbol 𝐶 r to indicate that we have five objects taken there at a
time without regard to order.

A, B, C GB wZbwU Aÿi †_‡K cÖwZev‡i 2-wU K‡i wb‡j wb¤œiƒc mgv‡ek cvIqv hvqt

AB, AC, BC→ 3wU mgv‡ek

web¨vm n‡j n‡Zv: AB, AC, BC, CA, BA → 6wU web¨vm|

Solution: We let the first letter in each word indicate the color, then we list
possible combination as follows.

RGW RGY RWY GWY

If we rearrange the first group, RGW, to from GWR or RWG we still have the
color combination; therefore order is not important.

The previous examples are completely within our capabilities, but suppose we
20 boys and wish to know how many different basket ball teams we could form
at a time, from these boys. Our listing would be quite lengthy and we would has
difficult task to determine that we had all of the possible combinations. In fact,
would be over 15,000 combinations we would have to list. The indicates the
near a formula for combinations.

Formulas:
n
n msL¨K wRwbm ‡_‡K r msL¨K wRwbm evQvB Kiv n‡j G‡K cÖKvk Kiv nq 𝐶 r, Øviv

n !
(i) 𝐶 r =
!( )!

This formula is read: The number of combination of n objects taker r at a time

is equal to n factorial divided by r factorial times n minus r factorial.

(ii) n𝐶 r= n𝐶 n-r
 (iii) n𝐶 r+ n𝐶 r-1= n+1𝐶 r

Avðh©‡evaK wPýwU (!) d¨v‡±vwiqvj †bv‡Ukb (factorial notation) ejv nq|

‡hgbt n hw` GKwU Positive integer nq (abvZœK c~b©msL¨v) Z‡e 1 ‡_‡K n ch©šÍ mKj
¯^vfvweK msL¨vi ¸Ydj‡K factorial n Øviv cÖKvk Kiv nq| cÖKv‡ki ixwZ †hgb, n! A_ev, ∟𝑛

D`vniY,

3 !=1. 2. 3 [1‡_‡K 3 ch©šÍ msL¨v¸wji ¸Ydj]

6!=1. 2. 3.4.5.6 [1‡_‡K 6 ch©šÍ msL¨v¸wji ¸Ydj]

n!=1. 2. 3. ............. (n – 1).n [1‡_‡K n ch©šÍ msL¨v¸wji ¸Ydj]

jÿ¨ Ki‡ebt n𝐶 n= 1 n
𝐶 1=n

GZÿ‡Y, combination Gi basic concept wbðq Clear n‡q‡Q| evi evi GK_v eySv‡bv n‡”Q
†h, combination Gi †ÿ‡Î ABC Avi CBA GKB K_v| †Kbbv, Avgiv GLv‡b ïay order
change KiwQ wKš‘ element ‡Zv GKB Av‡Q| myZivs Avgiv combination-G mvRv‡bv
(arrangement) we‡ePbv bv K‡i KZfv‡e †bIqv hvq ZvB †`L‡ev|

Simple example w`‡q eySv hvK

12. Example: If there are 20 boys, how many different basketball teams could
be formed?

There are 5 boys needed in each team.

n !
𝐶r = here, n=20, r = 5
!( )!

Now, we put value,

20 ! ! × × × × × !
𝐶5 = = =
!( )! !× ! !× !

× × × ×
= =15,504
 Combination & Permutation

1413. Example: A man has in his pocket a silver dollar, a half-dollar, a quarter,
a dime, a nickel, a penny. If he reaches into his pocket and pulls out three coins,
how many different sums may be have?

Lye mnR! GLv‡b RwUj wPšÍvi wKQz †bB| Rvb‡Z PvIqv n‡”Q †h, GKev‡i 3wU coin nv‡Z DV‡j Kq
ai‡bi combination m¤¢e?

[Order ‡Kvb factor bq G‡ÿ‡Î]

6 !
∴The no. of possible combination is 𝐶 3 = = 20
!( )!
3
(II) Find the value of 𝐶 3

3 ! !
Solution: 𝐶 3 = = = 1 [∵ 0! = 1 ]
!( )! ! !

Permutations
cÖ_‡g wKQz Basic Av‡jvPbv Kiv hvK| hw` GKwU KvR m msL¨K Dcv‡q m¤úbœ Kiv hvq Ges Aci
GKwU KvR c„_Kfv‡e n msL¨K Dcv‡q m¤úbœ Kiv hvq, Z‡e H `ywU KvR GK‡Î 𝑚 × 𝑛 msL¨K
Dcv‡q Kiv hvq| †hgb aiæb,
Lyjbv †_‡K XvKv hvIqvi Rb¨ †cøb, †ij, ÷xgvi Ges evm GB Pvi cÖKvi hvb-evn‡bi e¨e¯’ v Av‡Q|
Avevi XvKv †_‡K PÆMÖvg hvIqvi Rb¨ †cøb, †ij evm GB wZb cÖKvi hvb-evn‡bi e¨e¯’v Av‡Q| GLb,
cÖkœ n‡jv GKRb †jvK KZ Dcv‡q Lyjbv †_‡K XvKv n‡q PÆMÖvg ‡h‡Z cvi‡e? wb‡Pi wPÎwU jÿ¨
Kiæbt
‡cøb XvKv PÆMÖvg

Lyjbv ‡ij
XvKv PÆMÖvg
÷xgvi

evm XvKv PÆMÖvg

XvKv PÆMÖvg
∴ ‡jvKwU Lyjbv †_‡K Pvi cÖKvi wfbœ wfbœ Dcv‡q XvKv †h‡Z cv‡i|
Avevi Lyjbv †_‡K XvKv hvIqvi cÖwZ Dcv‡qi Rb¨ XvKv †_‡K PÆMÖvg hvIqvi wZbwU Dcvq Av‡Q|
myZivs Lyjbv †_‡K XvKv n‡q PÆMÖvg hvIqvi Rb¨ †gvU 3+3+3+3 A_ev 4 ∙ 3 = 12 wU Dcvq Av‡Q
hw` †Kvb KvR m msL¨K Dcv‡q m¤úbœ Kiv hvq Ges H Kv‡Ri Dci wbf©ikxj wØZxq KvRwU hw` n
msL¨K Dcv‡q Kiv hvq, Z‡e KvR `ywU †gvU 𝑚 ∙ 𝑛 msL¨K Dcv‡q Kiv hvq| Avevi H `ywU Kv‡Ri
Dci wbf©ikxj Z„Zxq KvRwU hw` p msL¨K Dcv‡q Kiv hvq Z‡e H wZbwU KvR †gvU 𝑚 ∙ 𝑛 ∙ 𝑝
msL¨K Dcv‡q Kiv hv‡e| Dc‡ii D`vni‡Yi mv‡_ wgwj‡q †`Lyb|
aiv hvK, PviwU wfbœ wfbœ Aÿi 𝑎, 𝑏, 𝑐, 𝑑 ‡`Iqv Av‡Q| Zv †_‡K cÖ‡Z¨Kevi hw` `ywU K‡i wbB Ges
wewfbœfv‡e mvRvB Z‡e Aÿi¸‡jv‡K wb‡¤œ³ 12 iK‡g mvRv‡bv †h‡Z cv‡i| †hgb,
𝑎𝑏, 𝑏𝑎, 𝑎𝑐, 𝑐𝑎, 𝑎𝑑, 𝑑𝑎, 𝑏𝑐, 𝑐𝑏, 𝑏𝑑, 𝑑𝑏, 𝑐𝑑, 𝑑𝑐 - GB eviwUi cÖwZwUB GK GKwU web¨vm|
myZivs, PviwU wfbœ wRwbm †_‡K cÖwZ evi `ywU K‡i wb‡q †gvU 12-wU web¨vm MVb Kiv hvq|
web¨v‡mi †ÿ‡Î mvRv‡bvi µg (𝑜𝑟𝑑𝑒𝑟) ev avivevwnKZv we‡ePbv Kiv nq| Zvi gv‡b, †K Av‡M, †K
c‡i, Zv ¸iæZ¡c~Y©!
Avevi PviwU Aÿi 𝑎, 𝑏, 𝑐, 𝑑 ‡_‡K cÖwZevi `ywU K‡i wb‡q Ges cÖwZwU evQvB‡q Aÿi¸‡jvi µg
hw` we‡ePbv bv Kwi Z‡e wb‡¤œv³ QqwU (6) mgv‡ek MVb Kiv hvq|
‡hgb, 𝑎𝑏, 𝑎𝑐, 𝑎𝑑, 𝑏𝑐, 𝑏𝑑, 𝑐𝑑. → ‡gvU 6 wU mgv‡ek ev Combination | Zvi gv‡b, G‡ÿ‡Î
combine (Kg&evB&b&) ev GKÎ KivUvB ¸iæZ¡c~Y© - 𝑎 Ges 𝑏 GKÎ n‡jB n‡jv, 𝑎 Av‡M, bv, 𝑏 Av‡M
Zv ¸iæZ¡c~Y© bq|
ABC, ACB, BAC, BCA, CAB, CBA
Suppose we have two letters, A and B, and wish to know how many
arrangements of these letters can be made. It is obvious that the answer is two.
That is,
AB and BA
If we extend this to the three letters A, B, and C, we find the answer to be
We had three choices for the first letter, and after we chose the first letter, we
have only two choices for the second letter, and after the second letter, we had
only one choice. This is shown in the “tree” diagram in figure. Notice that there
is a total of different paths to the ends of the “branches” of the “tree” diagram.
First Second Third
Choice Choice Choice

B C
A
C B

Starting A C
x B
Point
C A

A B
C
B A

“Tree” Diagram.
 Combination & Permutation
If the number of objects is large, the tree would become very complicated;
therefore, we approach the problem in another manner, using parentheses to
show the possible choices. Suppose we were to arrange six objects in as many
different orders as possible. A_©vr, g‡b Kiæb 6-wU wRwbm‡K hZ iKgfv‡e m¤¢e mvRv‡Z n‡e|
We have for the first choice six objects.
(6) ( ) ( ) ( ) ( ) ( )
For the second choice we have only five choices.
(6) (5) ( ) ( ) ( ) ( )
For the third choice we have only four choices.
(6) (5) (4) ( ) ( ) ( )
These may be continued as follows:
(6) (5) (4) (3) (2) (1)
By applying the principle of choice we find the total possible ways of arranging
the objects to be the product of the individual choices. That is,
6 × 5 × 4 × 3 × 2 × 1 Ges G¸wj‡K 6! wjLv hvq|

This leads to the statement: The number of permutation of 𝑛 objects, taken all
together, is equal to 𝑛! A_©vr, 𝑛 msL¨K wRwbm ‡_‡K cÖwZevi 𝑛 msL¨K wb‡j web¨vm msL¨v n‡e
𝑛!-Gi mgvb|
n
mvaviYZt 𝑛 msL¨K wRwbm †_‡K cÖwZevi 𝑟 msL¨K wb‡q MwVZ web¨vm‡K P r cÖZxK Øviv Ges
n
mgv‡ek msL¨v‡K C r Øviv m~wPZ Kiv nq| 𝑟 - Gi gvb 𝑛 A‡cÿv e„nËi n‡Z cv‡i bv| ZvB 𝑛 Ges
n n
𝑟 Df‡qB abvZ¥K c~Y©msL¨v Ges 𝑛 ≥ 𝑟. jÿ¨ Kiæbt 𝑃1 = 𝑛 𝑃n = 𝑛!

!
1414. Example: Find the value of
!
! . . . .
= = 20 (𝑏𝑦 𝑠𝑖𝑚𝑝𝑙𝑖𝑓𝑖𝑐𝑎𝑡𝑖𝑜𝑛)
! . .
n n
B. Calculator-Gi mvnv‡h¨ wKš‘ factorial P r , C r BZ¨vw` †ei Kiv hvq wKš‘ cixÿvq
†h‡nZz Calculator use-Gi my‡hvM ‡bB, ZvB Avcbv‡K nv‡Z-Kj‡g factorial ‡ei Kiv
wkL‡Z n‡e| Avi Avcwb hw` G‡Kev‡i 1 ch©šÍ factorial ‡ei Ki‡Z hvb Z‡e AwZ
g~j¨evb mgq AcPq Qvov Avi wKQzB n‡e bv| GRb¨ short-cut method Rvb‡Z n‡e|
c~‡e©i Example-wUB †Lqvj Kiæb|
GLv‡b Avgiv hw` 5! G‡Kev‡i 1 ch©©šÍ we¯Í…Z bv K‡i 3! ch©šÍ wjwL, Z‡e wKš‘ wb‡Pi
ivwki mv‡_ wgwj‡q hvq Ges Dc‡i-wb‡P KvUvKvwU hvq|

! × × ! × × !
‡hgb, = A_©vr [3! = 1.2.3] = 5 ∙ 4 = 20
! ! !

eyS‡jb †Zv, GLv‡b Avgiv 3! = 1. 2. 3 A_ev 5! = 5 ∙ 4 ∙ 3 ∙ 2 ∙ 1 bv wj‡L wb‡Pi

ivwki mv‡_ wgwj‡q 3! ch©šÍ we¯Í…Z Kijvg| Gfv‡e †KŠkj cÖ‡qvM Kiv Af¨vm Ki‡Z
n‡e|

! !
1415.Example: Find the value of
!
6! ‡K 4! ch©šÍ we¯Í…Z K‡i Zvi ci 4! common wb‡Z n‡e Dc‡ii ivwk‡Z| Zvn‡j Dc‡i-wb‡P 4!
! ! !( × )
KvUvKvwU hvq| 6! = 6 ∙ 5 ∙ 4! ∴ = = 29
! !
Avgiv wd‡i Avwm Avgv‡`i web¨v‡mt

meKqwU wRwbm wfbœ(different)t

𝑛 msL¨K wRwbm †_‡K cÖwZevi 𝑟 msL¨K wb‡q hZ iK‡g Permutation n‡Z cv‡i Zv wb¤œiƒct-

cÖKZ
… c‡ÿ GwU eySvq †h, 𝑛 msL¨K wRwbm †_‡K 𝑟 msL¨K k~b¨¯’vb KZ iK‡g c~iY Kiv hvq|

𝑛 msL¨K wRwb‡mi †h‡Kvb GKwU‡K ewm‡q cÖ_g k~b¨¯’vbwU 𝑛 msL¨K Dcv‡q cyiY Kiv hvq| cÖ_g
k~b¨¯’vb 𝑛 msL¨K Dcv‡q †h †Kvb GK Dcv‡q c~iY Kivi ci wØZxq k~b¨ c`wU‡Z Aewkó (𝑛 − 1)
msL¨v wRwbm¸‡jvi †h †Kvb GKwU‡K emv‡bv †h‡Z cv‡i| myZivs cÖ_g `ywU k~b¨c` GK‡Î †gvU
𝑛(𝑛 − 1) msL¨K Dcv‡q c~iY Kiv hvq|

n n
∴ 𝑃2 = 𝑛(𝑛 − 1) GBfv‡e, 𝑃3 = 𝑛(𝑛 − 1)(𝑛 − 2)
n
hw` 𝑟 = 𝑛 n‡q _v‡K A_v©r 𝑛 msL¨K wRwbm w`‡q 𝑛 msL¨K ¯’vb c~Y© Kiv nq Z‡e, 𝑃n = 𝑛!
N.B. 0! = 1 [Factorial 0 (Zero) = 1]
n !
mvaviYfv‡e, 𝑃r = [GwU gyL¯Í _vK‡Z n‡e]
( )!
1416. Example: How many permutations of seven different letters may be
made? Solution: The easiest solution is to use the previous statement and write
7 ! ! !
𝑃7 = = = = 7!
( )! !

08. There are six different models Who are to appear in a fashion show. Two
are from Europe, two are from South America, and two are from North
America. If all the models from the same continent are to stand next to
each other, how many ways can the fashion show organizer arrange the
models?
A) 48 B) 64 C)24 D) 8 E) 72
15. How many different 3 digit numbers can be formed, such that 1st and 3rd
place should be filled up with odd numbers?
A) 400 B) 250 C) 150 D) 120 E) None of these

More Practice:
1. How many Permutations of the letters of the word APPLE are there?
A) 600 B) 120 C) 240 D) 60
Answer: Option D
Solution:
APPLE = 5 letters.
But two letters PP is of same kind.
Thus, required permutations,
!
=
!
=
= 60

2. In how many ways 4 boys and 3 girls can be seated in a row so that they are
alternate.
A) 144 B) 288 C) 12 D) 256
Answer: Option A
Solution:
Let the Arrangement be,
BGBGBGB
4 boys can be seated in 4! Ways
Girl can be seated in 3! Ways
Required number of ways,

= 4! × 3!
= 144

3. In how many ways 2 students can be chosen from the class of 20 students?
A) 190 B) 180 C) 240 D) 390
Answer: Option A
Solution:
Number of ways
= 20C2
!
=
!× !
= 190

4. Three gentlemen and three ladies are candidates for two vacancies. A voter
has to vote for two candidates. In how many ways can one cast his vote?
A) 9 B) 30 C) 36 D) 15
Answer: Option D
Solution:
There are 6 candidates and a voter has to vote for any two of them.
So, the required number of ways is,
= 6C2
!
=
!× !
= 15

5. A letter lock consists of 4 rings, each ring contains 9 non-zero digits. This
lock can be opened by setting four digit code with the proper combination of
each of the 4 rings. Maximum how many codes can be formed to open the lock?
9
A) 4 B) 9 C) P4 D) None of these
Answer: Option B
Solution:
There are 9 non-zero digits to arrange themselves at 4 different position. Each
letter can be arrange at different position in 9 different ways.
So, required number of ways,
=9×9×9×9
=9

6. In how many ways can six different rings be worn on four fingers of one
hand?
A) 10 B) 12 C) 15 D) 16
Answer: Option C
Solution:
Required number of ways,
= 6C4
×
=
= 15 ways

7. There are three prizes to be distributed among five students. If no students

gets more than one prize, then this can be done in:
A) 10 ways B) 30 ways C) 60 ways D) 80 ways
Answer: Option A
Solution:
3 prize among 5 students can be distributed in,

5
C3 ways = 10 ways.

Combination & Permutation

1425. A man ordering dinner has a choice of one meat dish from four, a choice
of four vegetables from seven, one salad from three and one dessert from four.
How many different menus are possible?

Solution: The individual combinations are as follows:

4
C1 = 4
meat.........................................................
7 !
Vegetables............................................... C4 = )!
= 35
!(
3
Salad ................................... C1 = 3; dessert............................... 4C1 = 4
Therefore, there are (4)(35)(3)(4) = 1680 different menus available to man.

1433. Example: How many arrangements can be made using the letters in the
word ADAPTATION?
!
Solution: We use ; where 𝑛 = 10 and 𝑟 = 2(two T’s) and 𝑟 =
! !….
3(three A’s)
! ! × × × × × ×
Then = = = 302,400
! ! ! !
1434. Practice yourself: Find the no. of possible arrangements of letters in the
following words:
Answer:
1) STRUCTURE 1) 45, 360
2) BOOK 2) 12
3) TENNESSEE 3) 3780
4) MILLIAMPERE 4) 2,494,800