Permutation and Combination — Complete Guide
Table of Contents
- Introduction to the Topic
- Basic Concepts and Terminology
- Fundamental Counting Principles
- Permutation Formulas
- Combination Formulas
- Type 1: Basic Arrangements
- Type 2: Arrangements with Restrictions
- Type 3: Circular Permutations
- Type 4: Basic Selections/Combinations
- Type 5: Combinations with Restrictions
- Type 6: Word/Letter Arrangement Problems
- Common Shortcuts and Tricks
- Common Mistakes to Avoid
- Solved Examples (25 fully worked problems)
- Practice Question Bank (50 questions)
- Answer Key with Quick Solutions
1. Introduction to the Topic
Permutation and Combination (P&C) tests systematic counting — how many ways can things be arranged (permutation, order matters) or selected (combination, order doesn’t matter). While less frequent than core arithmetic chapters, SSC CGL Tier-2, RRB JE, and banking exams include 1-3 questions from this chapter, and it’s a near-mandatory topic in reasoning-adjacent sections too. The key skill is correctly identifying whether a problem is about ARRANGING (order matters → permutation) or SELECTING (order doesn’t matter → combination).
2. Basic Concepts and Terminology
Factorial (n!): The product of all positive integers up to n. n! = n×(n−1)×(n−2)×…×2×1. By convention, 0!=1.
Permutation: An arrangement of objects in a specific order.
Combination: A selection of objects where order does not matter.
3. Fundamental Counting Principles
Multiplication Principle: If one event can occur in m ways and a second (independent) event can occur in n ways, then both events together can occur in m×n ways.
Addition Principle: If an event can occur in m ways OR in n ways (mutually exclusive), it can occur in m+n ways.
4. Permutation Formulas
Formula 1: Number of permutations of n distinct objects taken r at a time: ⁿPᵣ = n! / (n−r)!
Formula 2: Number of permutations of n distinct objects taken all at a time = n!
Formula 3 (permutations with repetition allowed): If repetition is allowed, the number of arrangements of n objects taken r at a time = nʳ
Formula 4 (permutations with some identical objects): Number of arrangements of n objects where p are alike of one kind, q alike of another kind, etc.: n! / (p! × q! × …)
Formula 5 (circular permutations): Number of ways to arrange n distinct objects in a circle = (n−1)! If clockwise and anticlockwise arrangements are considered the same (e.g., necklace, garland): (n−1)!/2
5. Combination Formulas
Formula 6: Number of combinations of n distinct objects taken r at a time: ⁿCᵣ = n! / [r!(n−r)!]
Formula 7 (relationship between permutation and combination): ⁿPᵣ = ⁿCᵣ × r!
Formula 8 (key properties): - ⁿC₀ = ⁿCₙ = 1 - ⁿC_r = ⁿC_(n−r) - ⁿCᵣ + ⁿC_(r−1) = ⁿ⁺¹Cᵣ (Pascal’s rule) - ⁿC₁ = n
Formula 9 (total number of combinations, taking any number of objects): Total subsets of an n-element set (including empty set) = 2ⁿ. Excluding the empty set = 2ⁿ−1.
6. Type 1: Basic Arrangements
Pattern: “In how many ways can 5 distinct books be arranged on a shelf?” - 5! = 120 ways
Pattern: “In how many ways can 3 letters be selected and arranged from the word MATH?” - ⁴P₃ = 4!/1! = 24 ways
7. Type 2: Arrangements with Restrictions
Pattern (specific objects together): “In how many ways can 5 people be arranged in a row such that 2 specific people always sit together?” - Treat the 2 people as one “block”: now arranging 4 units (the block + 3 others) = 4! ways. Within the block, the 2 people can arrange in 2! ways. - Total = 4! × 2! = 24×2 = 48 ways
Pattern (specific objects never together): “In how many ways can 5 people be arranged such that 2 specific people never sit together?” - Total arrangements − arrangements with them together = 5! − 48 = 120−48 = 72 ways
Pattern (specific positions): “In how many ways can 4 people be arranged in a row such that a specific person is always first?” - Fix that person in position 1; arrange the remaining 3 in the other 3 positions: 3! = 6 ways
8. Type 3: Circular Permutations
Pattern: “In how many ways can 6 people be seated around a round table?” - (6−1)! = 5! = 120 ways
Pattern (necklace/garland): “In how many ways can 7 different beads be arranged to form a necklace?” - (7−1)!/2 = 6!/2 = 720/2 = 360 ways
9. Type 4: Basic Selections/Combinations
Pattern: “In how many ways can a committee of 3 be selected from 8 people?” - ⁸C₃ = 8!/(3!5!) = (8×7×6)/(3×2×1) = 56 ways
Pattern: “In how many ways can a cricket team of 11 be chosen from 15 players?” - ¹⁵C₁₁ = ¹⁵C₄ = (15×14×13×12)/(4×3×2×1) = 1365 ways
10. Type 5: Combinations with Restrictions
Pattern (specific person must be included): “In how many ways can a committee of 4 be formed from 10 people if a specific person must always be included?” - Fix that person; choose 3 more from the remaining 9: ⁹C₃ = 84. 84 ways
Pattern (specific person must be excluded): “…if a specific person must never be included?” - Choose all 4 from the remaining 9: ⁹C₄ = 126 ways
Pattern (at least/at most): “A committee of 5 is to be formed from 6 men and 4 women, with at least 3 women. Find the number of ways.” - Cases: exactly 3 women+2 men, or exactly 4 women+1 man. - ⁴C₃×⁶C₂ + ⁴C₄×⁶C₁ = 4×15 + 1×6 = 60+6 = 66 ways
11. Type 6: Word/Letter Arrangement Problems
Pattern (all letters distinct): “In how many ways can the letters of the word CHAIR be arranged?” - 5! = 120 ways
Pattern (repeated letters): “In how many ways can the letters of the word STATISTICS be arranged?” - Total letters=10. S appears3 times, T appears3 times, I appears2 times, A once, C once. - Arrangements = 10!/(3!×3!×2!) = 3628800/(6×6×2) = 3628800/72 = 50,400 ways
Pattern (vowels together): “In how many ways can the letters of the word MOBILE be arranged so that vowels always come together?” - Vowels in MOBILE: O, I, E (3 vowels). Consonants: M, B, L (3 consonants). - Treat vowels as one block: arrange (block + 3 consonants) = 4 units = 4! ways. Within block, vowels arrange in 3! ways. - Total = 4! × 3! = 24×6 = 144 ways
12. Common Shortcuts and Tricks
- The key decision: does order matter? If YES → permutation (nPr); if NO → combination (nCr). Reread the question to confirm this before choosing a formula.
- “Together” restriction: bundle the together-items into one block, arrange blocks, then multiply by internal arrangements of the block.
- “Never together” restriction: total arrangements MINUS “together” arrangements — always faster than direct counting.
- “At least” / “at most” problems: break into mutually exclusive cases and sum, or use complement (total − cases NOT satisfying the condition).
- Repeated letters in a word: divide n! by the factorial of each repeat count — never treat repeated letters as distinct.
- Circular arrangements: always (n−1)! for distinct arrangements; divide by 2 additionally only when reflections (clockwise/anticlockwise) are considered identical (necklaces, garlands — NOT for seating arrangements, which are directional in real life unless stated otherwise).
- ⁿCᵣ = ⁿC₍ₙ₋ᵣ₎ — use this to simplify calculations when r is closer to n than to 0 (e.g., ¹⁵C₁₁ = ¹⁵C₄, which is much faster to compute).
- Total ways to select ANY number of objects from n distinct objects (including selecting none) = 2ⁿ.
13. Common Mistakes to Avoid
- Using permutation formula when the problem is actually about selection (order doesn’t matter), or vice versa.
- Forgetting to multiply by internal arrangements when treating a group as a single “block” in together-restriction problems.
- In repeated-letter word arrangements, forgetting to divide by the factorial of EACH repeated letter’s count (not just one of them).
- For “at least” problems, forgetting to sum ALL qualifying cases (not just the minimum case).
- Confusing (n−1)! circular permutation with n! linear permutation.
- Forgetting the /2 for reflection-symmetric circular arrangements (necklace/garland) when required, or wrongly applying it to simple round-table seating (where clockwise and anticlockwise ARE typically different unless stated otherwise).
- Double-counting or under-counting in complex restriction problems — always sanity check with a simpler analogous case if possible.
14. Solved Examples (25 Fully Worked Problems)
Example 1. In how many ways can 6 distinct books be arranged on a shelf? Solution: 6! = 720 ways.
Example 2. Find the value of ⁷P₃. Solution: 7!/(4!) = 7×6×5 = 210.
Example 3. Find the value of ⁸C₅. Solution: 8!/(5!3!) = (8×7×6)/(3×2×1) = 56.
Example 4. In how many ways can 4 boys and 3 girls be arranged in a row such that all girls sit together? Solution: Treat girls as 1 block: arrange (block+4boys)=5 units=5!. Within block, girls arrange in3!. Total=5!×3!=120×6=720 ways.
Example 5. In how many ways can a committee of 4 be selected from 6 men and 5 women, with exactly 2 men and 2 women? Solution: ⁶C₂×⁵C₂=15×10=150 ways.
Example 6. In how many ways can the letters of the word BANANA be arranged? Solution: Total letters=6. A appears3 times, N appears2 times. Arrangements=6!/(3!2!)=720/12=60 ways.
Example 7. In how many ways can 8 people be seated around a circular table? Solution: (8−1)!=7!=5040 ways.
Example 8. In how many ways can 5 different flowers be strung into a garland? Solution: (5−1)!/2=4!/2=24/2=12 ways.
Example 9. From a group of 7 men and 6 women, in how many ways can a committee of 5 be formed with at least 3 men? Solution: Cases: 3men+2women, 4men+1woman, 5men+0women. ⁷C₃×⁶C₂ + ⁷C₄×⁶C₁ + ⁷C₅×⁶C₀ = 35×15 + 35×6 + 21×1 = 525+210+21=756 ways.
Example 10. How many 4-digit numbers can be formed using the digits 1,2,3,4,5 without repetition? Solution: ⁵P₄ = 5!/1! = 120 numbers.
Example 11. How many 3-digit numbers can be formed from 1,2,3,4,5 if repetition is allowed? Solution: 5×5×5 = 125 numbers.
Example 12. In how many ways can the letters of the word MISSISSIPPI be arranged? Solution: Total letters=11. I appears4 times, S appears4 times, P appears2 times, M appears1 time. Arrangements=11!/(4!4!2!)=39916800/(24×24×2)=39916800/1152=34,650 ways.
Example 13. A committee of 5 is to be chosen from 8 people, with 2 specific people never both included together. Find the number of ways. Solution: Total ways=⁸C₅=56. Ways with both specific people included=⁶C₃=20 (choosing 3 more from remaining 6). Required=56−20=36 ways.
Example 14. In how many ways can 3 men and 3 women be seated in a row such that men and women alternate? Solution: Arrangements starting with a man: M_M_M_ pattern, men in 3! ways, women in 3! ways=6×6=36. Starting with a woman similarly=36. Total=36+36=72 ways.
Example 15. How many diagonals does a hexagon have (using combination formula)? Solution: Total line segments between vertices=⁶C₂=15. Subtract 6 sides. Diagonals=15−6=9.
Example 16. In how many ways can a cricket team of 11 be selected from 16 players if 2 particular players must always be included? Solution: Fix 2 players; choose 9 more from remaining 14: ¹⁴C₉=¹⁴C₅=(14×13×12×11×10)/120=2002 ways.
Example 17. In how many ways can 5 different balls be distributed into 3 different boxes (each box can hold any number, including zero)? Solution: Each ball has 3 choices independently: 3⁵=243 ways.
Example 18. How many words (with or without meaning) can be formed using all letters of the word EQUATION, using each letter once? Solution: EQUATION has 8 distinct letters. 8!=40,320 words.
Example 19. In how many ways can 4 red balls and 3 blue balls (balls of the same color identical) be arranged in a row? Solution: Total balls=7. Arrangements=7!/(4!3!)=35 ways.
Example 20. From 5 novels and 4 biographies, in how many ways can one select 3 novels and 2 biographies? Solution: ⁵C₃×⁴C₂=10×6=60 ways.
Example 21. In how many ways can the letters of the word ORANGE be arranged so that vowels occupy only odd positions? (ORANGE has 6 letters, positions 1-6, odd positions are 1,3,5 — 3 odd positions; vowels O,A,E = 3 vowels) Solution: 3 vowels in 3 odd positions: 3! ways. 3 consonants (R,N,G) in 3 even positions: 3! ways. Total=3!×3!=6×6=36 ways.
Example 22. How many 5-letter words can be formed from the word COMPUTER such that no letter repeats? Solution: COMPUTER has 8 distinct letters. ⁸P₅=8!/3!=8×7×6×5×4=6720 words.
Example 23. In how many ways can 10 identical balls be distributed among 4 distinct children such that each gets at least one ball? (stars and bars method) Solution: Using the formula for distributing n identical items into r groups with each ≥1: ⁽ⁿ⁻¹⁴C₍ᵣ₋₁₎ = ⁹C₃ = (9×8×7)/6 = 84 ways.
Example 24. A polygon has 44 diagonals. Find the number of sides. Solution: Diagonals=n(n−3)/2=44⇒n(n−3)=88⇒n²−3n−88=0⇒(n−11)(n+8)=0⇒n=11 sides.
Example 25. In how many ways can 4 boys and 4 girls be seated around a round table such that boys and girls alternate? Solution: Fix one boy’s position to remove circular symmetry: remaining 3 boys arrange in 3! ways. 4 girls arrange in the 4 gaps in 4! ways. Total=3!×4!=6×24=144 ways.
15. Practice Question Bank (50 Questions)
Set A — Basic Permutations (Q1–Q10) 1. In how many ways can 7 distinct books be arranged on a shelf? 2. Find the value of ⁶P₄. 3. Find the value of ⁹P₂. 4. In how many ways can 4 letters be selected and arranged from the word NUMBER? 5. How many 3-digit numbers can be formed from digits 1-9 without repetition? 6. How many 4-digit numbers can be formed from digits 0-9 without repetition (leading digit cannot be 0)? 7. In how many ways can 5 people be arranged in a row? 8. In how many ways can 3 out of 8 distinct trophies be awarded to 3 different students (one each)? 9. Find the number of ways to arrange the letters of the word FLOWER? 10. In how many ways can the letters A, B, C, D be arranged if A must always be first?
Set B — Restricted Arrangements (Q11–Q18) 11. In how many ways can 6 people be arranged in a row such that 2 specific people always sit together? 12. In how many ways can 6 people be arranged such that 2 specific people never sit together? 13. In how many ways can 5 books be arranged on a shelf such that 2 specific books are never adjacent? 14. In how many ways can 4 men and 4 women be seated in a row so that men and women alternate? 15. In how many ways can 5 people be seated in a row if 2 specific people must occupy the end seats? 16. In how many ways can the letters of the word DELHI be arranged so that vowels are always together? 17. In how many ways can 7 students be arranged in a row such that 3 specific students always sit together? 18. In how many ways can 6 flags of different colors be arranged such that 2 specific flags are never together?
Set C — Circular Permutations (Q19–Q24) 19. In how many ways can 5 people be seated around a round table? 20. In how many ways can 9 different beads be arranged to form a necklace? 21. In how many ways can 6 people be seated around a round table such that 2 specific people always sit together? 22. In how many ways can 8 people be seated around a round table such that 2 specific people never sit together? 23. In how many ways can 4 couples be seated around a round table such that each couple sits together? 24. In how many ways can 6 beads of different colors be arranged to form a bracelet (reflection symmetric)?
Set D — Basic Combinations (Q25–Q34) 25. Find the value of ⁹C₄. 26. Find the value of ¹²C₃. 27. In how many ways can a committee of 5 be selected from 10 people? 28. In how many ways can 3 balls be chosen from 5 red and 4 blue balls (total 9), with no restriction on color? 29. In how many ways can a hand of 5 cards be dealt from a standard 52-card deck? 30. From 6 men and 4 women, find the number of ways to select a committee of 4 with exactly 2 men and 2 women? 31. In how many ways can a team of 6 be chosen from 8 boys and 5 girls with exactly 4 boys and 2 girls? 32. Find the number of diagonals in a decagon (10 sides). 33. In how many ways can 4 books be chosen from 10 different books? 34. How many ways can a group of 3 be selected from 12 people if 2 specific people must be included?
Set E — Combinations with Restrictions (Q35–Q42) 35. From 7 men and 5 women, form a committee of 6 with at least 4 men. 36. From 6 boys and 4 girls, form a group of 5 with at most 2 girls. 37. In how many ways can a committee of 5 be chosen from 6 men and 6 women such that it has at least 1 woman? 38. From 5 novels and 6 textbooks, select 4 books with at least 2 novels. 39. A bag has 7 distinct balls. In how many ways can a non-empty subset be selected? 40. From a group of 10 people, in how many ways can a committee of 4 be formed excluding 2 specific people? 41. In how many ways can 3 letters be selected from the word EQUATIONS (9 distinct letters) if a specific letter must be included? 42. From 8 red and 6 blue balls, select 5 balls with at least 3 red.
Set F — Word Arrangements & Mixed/Advanced (Q43–Q50) 43. In how many ways can the letters of the word ARRANGEMENT be arranged? (count repeated letters first) 44. In how many ways can the letters of the word SUCCESS be arranged? 45. In how many ways can the letters of the word BALLOON be arranged so that the two O’s are always together? 46. In how many ways can the letters of MATHEMATICS be arranged? (identify repeats: M-2,A-2,T-2, rest single, total 11 letters) 47. A polygon has 35 diagonals. Find the number of sides. 48. In how many ways can 12 identical pens be distributed among 3 children such that each gets at least 2 pens? 49. In how many ways can the letters of the word LEADER be arranged? 50. How many 4-letter words (with repetition allowed) can be formed from the 5 vowels?
16. Answer Key with Quick Solutions
Set A 1. 7!=5040 2. 6!/2!=360 3. 9!/7!=9×8=72 4. ⁶P₄=6!/2!=360 5. ⁹P₃=9×8×7=504 6. first digit9choices(1-9),remaining3from9!/6!arrangement:9×⁹P₃=9×(9×8×7)=9×504=4536 7. 5!=120 8. ⁸P₃=8×7×6=336 9. 6!=720 10. fix A first,arrange remaining3:3!=6
Set B 11. treat2as1block:5!×2!=120×2=240 12. total6!−together=720−240=480 13. total5!−together(treat2as1block:4!×2!=48)=120−48=72 14. 2×(4!×4!)=2×576=1152 15. 2specific people in2endseats:2!ways;remaining3inmiddle:3!ways;total=2×6=12 16. DELHI vowels E,I(2vowels),consonantsD,L,H(3).block+3=4units:4!;within block:2!.total=24×2=48 17. treat3as1block:(7−3+1)=5units:5!;within block:3!.total=120×6=720 18. total6!−together(5!×2!=240)=720−240=480
Set C 19. (5−1)!=4!=24 20. (9−1)!/2=8!/2=40320/2=20160 21. treat2as1block:circular with5units:(5−1)!=4!=24;within block2!.total=24×2=48 22. total circular(8−1)!=5040;together=treat2as1block,7units circular:(7−1)!=720;within2!:1440.never together=5040−1440=3600 23. treat each couple as1block:4blocks circular:(4−1)!=3!=6;within each couple2!,4couples:2⁴=16.total=6×16=96 24. (6−1)!/2=5!/2=120/2=60
Set D 25. 9!/(4!5!)=126 26. 12!/(3!9!)=220 27. ¹⁰C₅=252 28. ⁹C₃=84 29. ⁵²C₅=2,598,960 30. ⁶C₂×⁴C₂=15×6=90 31. ⁸C₄×⁵C₂=70×10=700 32. n(n−3)/2=10×7/2=35 33. ¹⁰C₄=210 34. fix2,choose1from remaining10:10 ways
Set E 35. cases4men+2women,5men+1woman,6men+0women:⁷C₄×⁵C₂+⁷C₅×⁵C₁+⁷C₆×⁵C₀=35×10+21×5+7×1=350+105+7=462 36. cases0girls+5boys(⁶C₅=6),1girl+4boys(⁴C₁×⁶C₄=4×15=60),2girls+3boys(⁴C₂×⁶C₃=6×20=120).total=6+60+120=186 37. total¹²C₅−allmen(⁶C₅=6)=792−6=786 38. cases2novels+2textbooks,3novels+1textbook,4novels+0textbooks:⁵C₂×⁶C₂+⁵C₃×⁶C₁+⁵C₄×⁶C₀=10×15+10×6+5×1=150+60+5=215 39. 2⁷−1=127 40. choose4from remaining8:⁸C₄=70 41. fix specific letter,choose2morefrom remaining8:⁸C₂=28 42. cases3red+2blue,4red+1blue,5red+0blue:⁸C₃×⁶C₂+⁸C₄×⁶C₁+⁸C₅×⁶C₀=56×15+70×6+56×1=840+420+56=1316
Set F 43. ARRANGEMENT:11letters,A-2,R-2,N-2,othersunique(G,E-2actually let’s recount:A-R-R-A-N-G-E-M-E-N-T:A2,R2,N2,E2,G1,M1,T1=11letters).arrangements=11!/(2!2!2!2!)=39916800/16=2,494,800 44. SUCCESS:7letters,S-3,C-2,U-1,E-1.arrangements=7!/(3!2!)=5040/12=420 45. BALLOON:7letters,B,A,L,L,O,O,N.treatOOasblock:total units=6(B,A,LL,block,N—wait L also repeats2).lettersexcludingOO-block:B,A,L,L,N=5units+1block=6units,witharrangement6!/2!(forLL)=720/2=360;within OO block,only1way(identical).total=360 46. MATHEMATICS:11letters,M-2,A-2,T-2,H-1,E-1,I-1,C-1,S-1.arrangements=11!/(2!2!2!)=39916800/8=4,989,600 47. n(n−3)/2=35⇒n(n−3)=70⇒n²−3n−70=0⇒(n−10)(n+7)=0⇒n=10 48. giveeach2first(6pensused),distributeremaining6identicalamong3(noconstraint):⁸C₂=28… formula:(n−1)C(r−1)afteradjusting:remaining6pens,3children,anydistribution(≥0each)=⁽⁶⁺³⁻¹⁾C₍₃₋₁₎=⁸C₂=28 ways 49. LEADER:6letters,allunique(L,E,A,D,E,R—waitEappearstwice:L,E,A,D,E,R=6letters,E-2).arrangements=6!/2!=720/2=360 50. 5⁴=625
End of Permutation and Combination study material. The systematic counting skills here directly underpin the Probability module that follows, where combinations are used to count favorable and total outcomes.