Study guide
4.9 Permutations & Combinations
Coal India Management Trainee CIL MT
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: CIL MT Exam Overview & Coal Sector Landscape
1.1 CIL MT Exam Pattern, Marking Scheme & Strategy 1.2 Coal India Limited: Corporate Structure, Maharatna Status & Subsidiaries 1.3 Indian Coal Mining Sector, Energy Mix & Environmental Regulations
2 Chapter 2: Paper-I General Awareness, Polity & Current Affairs
2.1 Indian Constitution, Governance & Statutory Bodies 2.2 Indian Economy, Union Budget & Economic Planning 2.3 Indian Geography, Mineral Belts & Environmental Ecology 2.4 Modern Indian History, Freedom Struggle & Cultural Heritage 2.5 General Science: Physics, Chemistry & Biology Fundamentals 2.6 Inventions, Discoveries & Scientific-Technological Development 2.7 Uses of Internet, Computer Awareness & Digital Governance 2.8 National & International Organisations 2.9 Awards, Honours & Sports 2.10 Books & Authors, Important Monuments & Places of India 2.11 Ports, Power Plants & Infrastructure of India 2.12 Climate Change, SDGs, National Parks & Wildlife Sanctuaries 2.13 Flagship Government Programmes & Current Affairs Method 2.14 World Physical, Social & Economic Geography
3 Chapter 3: Paper-I Reasoning & Logical Ability
3.1 Series Completion, Coding-Decoding & Semantic Analogies 3.2 Syllogisms, Logical Deduction & Venn Diagrams 3.3 Seating Arrangements, Linear/Circular Alignments & Puzzles 3.4 Direction Sense, Blood Relations & Order/Ranking 3.5 Alphabetical & Alphanumeric Series 3.6 Statement & Conclusions, Statement & Arguments 3.7 Clocks & Calendars 3.8 Cubes, Dice & Figure Counting 3.9 Mirror Images, Water Images, Embedded Figures & Non-Verbal Series 3.10 Decision Making & Data Analysis in Reasoning
4 Chapter 4: Paper-I Numerical Ability & Quantitative Aptitude
4.1 Arithmetic Foundations: Percentages, Profit & Loss, Ratio & Proportion 4.2 Averages, Simple/Compound Interest, Alligations & Mixtures 4.3 Time & Work, Pipes & Cisterns, Time, Speed & Distance 4.4 Algebra, Mensuration, Geometry & Data Interpretation (DI) 4.5 Number System, LCM, HCF & Decimal Fractions 4.6 Surds, Indices & Simplification 4.7 Problems on Ages 4.8 Boats & Streams and Problems on Trains 4.9 Permutations & Combinations 4.10 Probability for Quantitative Aptitude
5 Chapter 5: Paper-I General English & Verbal Ability
5.1 English Grammar, Error Spotting & Sentence Correction 5.2 Vocabulary Building: Synonyms, Antonyms, Idioms & Phrases 5.3 Reading Comprehension, Cloze Tests & Para Jumbles 5.4 Fill in the Blanks, Cloze Passages & Sentence Completion 5.5 Jumbled Sentences & Sentence Improvement
6 Chapter 6: Paper-II Engineering Mathematics
6.1 Matrix Algebra, Rank & Systems of Linear Equations 6.2 Eigenvalues, Eigenvectors & the Cayley-Hamilton Theorem 6.3 Limits, Continuity, Differentiability & Mean Value Theorems 6.4 Maxima-Minima, Indeterminate Forms & Taylor Series 6.5 Definite, Improper, Double & Triple Integrals 6.6 Partial Derivatives, Total Derivative & Multivariable Optimisation 6.7 First-Order Differential Equations: Linear & Non-Linear 6.8 Higher-Order Linear Differential Equations & Engineering Applications 6.9 Laplace Transforms & Transfer-Function Methods 6.10 Probability, Conditional Probability & Bayes' Theorem 6.11 Random Variables, Distributions & Descriptive Statistics 6.12 Numerical Methods: Root Finding, Integration & ODE Solvers
7 Chapter 7: Paper-II Engineering Mechanics & Statics-Dynamics
7.1 Force Systems, Coplanar Equilibrium & Lami's Theorem 7.2 Plane Trusses, Friction Mechanics & Screws/Wedges 7.3 Centroids, Center of Gravity & Moment of Inertia 7.4 Kinematics, Kinetics of Particles & Rigid Body Dynamics 7.5 Virtual Work & Lagrange's Equation 7.6 Rolling Friction, Belt-Pulley Drives, Brakes, Clutches & Vehicle Dynamics
8 Chapter 8: Paper-II Mechanics of Materials & Structural Integrity
8.1 Simple Stresses, Strains, Elastic Moduli & Thermal Stresses 8.2 Principal Stresses, Strain Energy & Mohr's Circle 8.3 Shear Force & Bending Moment Diagrams, Beam Bending & Shear Stresses 8.4 Torsion of Circular Shafts, Springs & Column Buckling 8.5 Thin Cylinders, Spheres & Thick-Walled Pressure Vessels 8.6 Deflection of Beams: Double Integration, Macaulay & Moment-Area 8.7 Shear Centre & Unsymmetrical Bending 8.8 Strain Gauges, Rosettes & Experimental Stress Analysis 8.9 Mechanical Testing: Universal Testing Machine, Hardness & Impact
9 Chapter 9: Paper-II Theory of Machines & Mechanical Vibrations
9.1 Simple Mechanisms, Kinematic Inversions & Velocity/Acceleration Diagrams 9.2 Cams & Followers, Toothed Gearing & Epicyclic Gear Trains 9.3 Flywheels, Centrifugal/Inertia Governors & Rotor Balancing 9.4 Free, Damped & Forced Single-Degree-of-Freedom Vibrations 9.5 Gyroscopic Couple & Gyroscopic Effects
10 Chapter 10: Paper-II Machine Design & Failure Theories
10.1 Static Failure Theories & Variable/Fatigue Loading 10.2 Design of Threaded Fasteners, Welded & Riveted Joints 10.3 Design of Shafts, Keys, Couplings & Rolling/Sliding Bearings 10.4 Design of Spur, Helical, Bevel & Worm Gears 10.5 Design of Helical, Leaf & Torsion Springs 10.6 Design of Brakes & Clutches: Energy, Lining Pressure & Heat
11 Chapter 11: Paper-II Fluid Mechanics & Hydraulic Machinery
11.1 Fluid Properties, Hydrostatic Forces & Buoyancy 11.2 Fluid Kinematics, Continuity & Bernoulli's Equation 11.3 Viscous Flow in Pipes, Boundary Layer & Minor Losses 11.4 Hydraulic Turbines, Centrifugal & Reciprocating Pumps 11.5 Dimensional Analysis, Similitude & Model Testing 11.6 Control-Volume Analysis: Continuity, Momentum & Energy
12 Chapter 12: Paper-II Thermodynamics, Thermal Cycles & Turbomachinery
12.1 Fundamental Concepts, First & Second Laws of Thermodynamics 12.2 Entropy, Availability, Exergy & Properties of Pure Substances 12.3 Air-Standard Gas Power Cycles: Otto, Diesel, Dual & Brayton 12.4 Vapour Power Cycles: Ideal, Reheat & Regenerative Rankine Cycles 12.5 Thermodynamic Relations: Maxwell, Clausius-Clapeyron & Joule-Thomson 12.6 Behaviour of Ideal & Real Gases and Equations of State 12.7 Air & Gas Compressors: Reciprocating, Rotary & Multi-Stage 12.8 Steam & Gas Turbines: Impulse, Reaction & Velocity Diagrams
13 Chapter 13: Paper-II Heat Transfer, Refrigeration & Air Conditioning
13.1 Steady & Unsteady Conduction, Extended Surfaces (Fins) 13.2 Forced/Natural Convection, Radiation & Heat Exchanger LMTD/NTU 13.3 Vapour Compression & Vapour Absorption Refrigeration Systems 13.4 Psychrometric Properties, Processes & Air Conditioning Systems 13.5 Gas Refrigeration, Heat Pump Cycles & Cryogenics
14 Chapter 14: Paper-II Materials Science, Metallurgy & Manufacturing Technology
14.1 Crystal Structures, Phase Diagrams & Iron-Iron Carbide Equilibrium 14.2 Heat Treatment Processes & Engineering Alloy Steels 14.3 Casting Processes, Metal Forming & Welding Metallurgy 14.4 Metal Cutting Mechanics, Tool Life & Machine Tools 14.5 Plastic Deformation, Yield Criteria & Load Estimation in Bulk Forming 14.6 Sheet Metal Forming: Shearing, Bending & Deep Drawing 14.7 Powder Metallurgy 14.8 Brazing, Soldering & Adhesive Bonding 14.9 Non-Traditional Machining: EDM, ECM, USM, AJM, LBM & EBM 14.10 Abrasive Machining, Grinding & Superfinishing 14.11 Principles of Work Holding, Jigs & Fixtures 14.12 Economics of Machining & Tool Life Optimisation
15 Chapter 15: Paper-II Metrology, Quality Control & Industrial Engineering / OR
15.1 Limits, Fits, Tolerances, Gauges & Surface Metrology 15.2 Production Planning, Forecasting & Inventory Control Models 15.3 Operations Research: Linear Programming & Transportation/Assignment 15.4 Project Management: CPM, PERT, Network Analysis & Crashing 15.5 Comparators & Interferometry 15.6 Coordinate Measuring Machines & Machine Tool Alignment Testing 15.7 Computer Integrated Manufacturing: CAD/CAM & Integration Tools 15.8 NC/CNC Machines & CNC Part Programming 15.9 Material Requirements Planning, Scheduling & Sequencing 15.10 Queuing Theory & Simple Queuing Models 15.11 Network Flow Models: Shortest Route, Maximal Flow & Spanning Tree
4.9 Permutations & Combinations
Key Takeaways Explain This Topic AI
Permutation & Combination is a named bullet of the CIL Paper-I Quantitative Aptitude syllabus, and the whole topic turns on whether order matters.
A permutation counts arrangements where order matters and equals n factorial divided by (n minus r) factorial, while a combination counts selections and divides that further by r factorial.
Arranging n distinct objects in a circle gives (n minus 1) factorial arrangements because rotations of the same arrangement are not distinct.
When letters repeat, the number of distinct arrangements is n factorial divided by the product of the factorials of each repetition count.
Last updated: August 2026
The Two Counting Principles
Multiplication principle. If a first task can be done in m m m ways and, for each of those, a second in n n n ways, the pair can be done in m × n m \times n m × n ways. Use it when tasks happen in sequence — signalled by the word and .
Addition principle. If a task can be done in m m m ways or in n n n ways, with no overlap, the total is m + n m + n m + n . Use it for mutually exclusive alternatives — signalled by the word or .
Factorials n ! = n × ( n − 1 ) × ( n − 2 ) × ⋯ × 2 × 1 , 0 ! = 1 n! = n \times (n-1) \times (n-2) \times \cdots \times 2 \times 1, \qquad 0! = 1 n ! = n × ( n − 1 ) × ( n − 2 ) × ⋯ × 2 × 1 , 0 ! = 1
The convention 0 ! = 1 0! = 1 0 ! = 1 is not arbitrary; it is what makes the formulae below work at their boundaries, and it appears as an objective item in its own right.
- n n n 0 1 2 3 4 5 6 7
- n ! n! n ! 1 1 2 6 24 120 720 5040
- Permutations: Order Matters
The number of ways of arranging r r r objects chosen from n n n distinct objects is n P r = n ! ( n − r ) ! ^{n}P_{r} = \frac{n!}{(n-r)!} n P r = ( n − r )! n !
Example. In how many ways can a first, second and third prize be awarded among 6 candidates? Order matters because the prizes differ: 6 P 3 = 6 ! 3 ! = 6 × 5 × 4 = 120 ^{6}P_{3} = \frac{6!}{3!} = 6\times5\times4 = 120 6 P 3 = 3 ! 6 ! = 6 × 5 × 4 = 120
Combinations: Order Does Not Matter
The number of ways of selecting r r r objects from n n n is n C r = n ! r ! ( n − r ) ! = n P r r ! ^{n}C_{r} = \frac{n!}{r!\,(n-r)!} = \frac{^{n}P_{r}}{r!} n C r = r ! ( n − r )! n ! = r ! n P r
Example. In how many ways can a committee of 3 be chosen from 6 people? 6 C 3 = 6 × 5 × 4 3 × 2 × 1 = 20 ^{6}C_{3} = \frac{6\times5\times4}{3\times2\times1} = 20 6 C 3 = 3 × 2 × 1 6 × 5 × 4 = 20
Note that 120 = 20 × 3 ! 120 = 20 \times 3! 120 = 20 × 3 ! — each selection of three can be arranged in 3 ! = 6 3! = 6 3 ! = 6 orders, which is precisely the difference between the two counts.
Properties of combinations n C r = n C n − r , n C 0 = n C n = 1 , n C r + n C r − 1 = n + 1 C r ^{n}C_{r} = {}^{n}C_{n-r}, \qquad ^{n}C_{0} = {}^{n}C_{n} = 1, \qquad ^{n}C_{r} + {}^{n}C_{r-1} = {}^{n+1}C_{r} n C r = n C n − r , n C 0 = n C n = 1 , n C r + n C r − 1 = n + 1 C r
The first identity is a genuine time-saver: computing 20 C 18 ^{20}C_{18} 20 C 18 as 20 C 2 = 190 ^{20}C_{2} = 190 20 C 2 = 190 takes seconds.
The Deciding Question
- Signal words Use
- arrange, order, rank, seat, form a number, assign distinct posts Permutation
- select, choose, committee, team, group, handshake, draw Combination
A committee is a combination; a committee with designated posts such as chairman and secretary is a permutation, or a combination followed by an arrangement.
Arrangements with Repetition
When some objects are identical, divide by the factorial of each repetition count: Arrangements = n ! p ! q ! r ! ⋯ \text{Arrangements} = \frac{n!}{p!\,q!\,r!\cdots} Arrangements = p ! q ! r ! ⋯ n !
Example. How many distinct arrangements of the letters of ENGINEER ?
The word has 8 letters with E appearing 3 times and N appearing 2 times: 8 ! 3 ! 2 ! = 40320 12 = 3360 \frac{8!}{3!\,2!} = \frac{40320}{12} = 3360 3 ! 2 ! 8 ! = 12 40320 = 3360
Circular Arrangements
Seating n n n distinct people around a round table gives ( n − 1 ) ! (n-1)! ( n − 1 )!
arrangements, because rotating everyone by one seat does not create a new arrangement — only relative order matters. Fix one person's position and arrange the remaining n − 1 n-1 n − 1 .
If clockwise and anticlockwise arrangements are not distinguished , as with a garland of flowers or a necklace of beads, halve the result: ( n − 1 ) ! 2 \frac{(n-1)!}{2} 2 ( n − 1 )!
Example. Six engineers sit around a circular table: ( 6 − 1 ) ! = 120 (6-1)! = 120 ( 6 − 1 )! = 120 ways. If instead six identical-looking beads form a necklace: 5 ! / 2 = 60 5!/2 = 60 5 ! /2 = 60 .
- Restricted Arrangements
- Objects that must stay together
Treat the block as a single unit, arrange the units, then arrange within the block.
Example. In how many ways can 5 people be arranged in a row if two particular people must sit together? Treat the pair as one unit, giving 4 units arranged in 4 ! = 24 4! = 24 4 ! = 24 ways, and the pair internally in 2 ! = 2 2! = 2 2 ! = 2 ways. Total = 48 = 48 = 48 .
Objects that must be separated
Count the total and subtract the together case.
Example. With the same 5 people, the number of arrangements in which the two are not together is 5 ! − 48 = 120 − 48 = 72 5! - 48 = 120 - 48 = 72 5 ! − 48 = 120 − 48 = 72 .
Fixed positions
Example. How many 4-digit even numbers can be formed from the digits 1 to 7 without repetition? The units digit must be 2, 4 or 6, giving 3 choices, and the remaining three positions are filled from the other 6 digits in 6 P 3 = 120 ^{6}P_{3} = 120 6 P 3 = 120 ways. Total = 3 × 120 = 360 = 3 \times 120 = 360 = 3 × 120 = 360 .
Selection Problems
Example. From 7 men and 5 women, how many committees of 5 can be formed with exactly 3 men? 7 C 3 × 5 C 2 = 35 × 10 = 350 ^{7}C_{3}\times{}^{5}C_{2} = 35\times10 = 350 7 C 3 × 5 C 2 = 35 × 10 = 350
Example. How many committees of 5 contain at least 3 men? Sum the cases of exactly 3, 4 and 5 men: 7 C 3 5 C 2 + 7 C 4 5 C 1 + 7 C 5 5 C 0 = 350 + 175 + 21 = 546 ^{7}C_{3}{}^{5}C_{2} + {}^{7}C_{4}{}^{5}C_{1} + {}^{7}C_{5}{}^{5}C_{0} = 350 + 175 + 21 = 546 7 C 3 5 C 2 + 7 C 4 5 C 1 + 7 C 5 5 C 0 = 350 + 175 + 21 = 546
The phrase at least always means summing cases, or subtracting the complement from the total when that is shorter.
Standard Results Worth Recall
- Situation Count
- Handshakes among n n n people n C 2 ^{n}C_{2} n C 2
- Diagonals of an n n n -sided polygon n C 2 − n ^{n}C_{2} - n n C 2 − n
- Triangles from n n n points, no three collinear n C 3 ^{n}C_{3} n C 3
- Subsets of a set of n n n elements 2 n 2^{n} 2 n
- Ways to distribute n n n distinct objects into r r r distinct boxes r n r^{n} r n
All of these appear regularly, and each takes a few seconds once recognised.