Study guide

9.2 Permutations, Combinations, Classical Probability, Independent Events & Odds

RRB Section Controller 2026: Free Written CBT Study Guide Exam

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Exam Overview & Operational Profile

1.1 Written CBT Pattern, Scoring & Selection 1.2 Eligibility, Documents & A-2 Medical Requirements

2 Chapter 2: Number Systems & Arithmetic Foundations

2.1 Number Systems, Divisibility Rules, Prime Factorization & Remainder Theorem 2.2 Unit Digits, Cyclicity Rules & Power Modulo Calculations 2.3 HCF and LCM Properties, Prime Factorization & Practical Word Problems 2.4 Fractions, Decimals, Surds, Indices & BODMAS Simplification

3 Chapter 3: Commercial Arithmetic: Percentages, Profit & Rates

3.1 Percentages, Fractional Equivalents, Successive Variations & Population Formulas 3.2 Cost Price, Selling Price, Profit/Loss Percentage, Dishonest Dealer & Discount Schemes 3.3 Simple Interest, Compound Interest Formulas, Annual/Semi-Annual Compounding & Difference Traps

4 Chapter 4: Ratios, Proportions, Mixtures & Partnerships

4.1 Ratios, Duplicate/Sub-Duplicate Ratios, Direct and Inverse Variations & Proportional Sharing 4.2 Averages, Change in Average, Batsman/Bowling Averages & Replacement Problems 4.3 Rule of Alligation, Removal-Replacement Mixtures & Partnership Capital-Time Sharing

5 Chapter 5: Motion Dynamics, Time, Distance & Train Logistics

5.1 Time, Speed, Distance Relations, Average Speed & Unit Conversions 5.2 Train Problems: Passing Poles, Platforms, Moving Objects & Relative Speed in Opposite/Same Directions 5.3 Upstream, Downstream Boat Velocity, Still Water Speed & Circular Track Races

6 Chapter 6: Work Efficiency, Pipes & Operational Scheduling

6.1 Individual and Group Work, Efficiency Ratios, Work Equivalences & Mandays Formula 6.2 Alternate Day Working, Negative Work & Wage Distribution Based on Work Done 6.3 Inlet and Outlet Pipes, Net Filling Rate, Alternating Flow & Tank Leakage Problems

7 Chapter 7: Algebra, Linear Equations & Progressions

7.1 Algebraic Identities, Polynomial Factorization & Systems of Linear Equations in Two Variables 7.2 Quadratic Equations, Nature of Roots, Discriminant Analysis & Maximum/Minimum Values 7.3 Arithmetic Progressions (AP), General Term, Sum of n Terms & Sequence Modeling

8 Chapter 8: Mensuration: 2D Areas & 3D Solids

8.1 Lines, Angles, Triangle Theorems, Congruence/Similarity & Circle Tangent Properties 8.2 Perimeter and Area of Quadrilaterals, Polygons, Circles & Shaded Region Problems 8.3 Surface Area and Volume of Cubes, Cuboids, Cylinders, Cones, Spheres & Melting-Recasting Solids

9 Chapter 9: Statistics, Probability & Data Interpretation

9.1 Mean, Median, Mode, Range, Mean Deviation & Standard Deviation 9.2 Permutations, Combinations, Classical Probability, Independent Events & Odds 9.3 Tabular Data Interpretation, Bar Charts, Grouped Graphs & Percentage Calculation Shortcuts 9.4 Pie Charts (Angle vs Percentage), Line Trend Graphs & Quantitative Data Sufficiency

10 Chapter 10: Multi-Source & Graphical Analysis

10.1 Multi-Source Analysis, Set Data & Arrangement 10.2 Scatter Plots, Histograms & Distribution Curves

11 Chapter 11: Deductive Logic, Statements & Binary Puzzles

11.1 Syllogisms, Sets & Possibility Conclusions 11.2 Critical Reasoning: Implicit Assumptions, Strong vs Weak Arguments & Course of Action 11.3 Binary Logic: Truth-Tellers, Liars, Alternators & Matrix Logic Deductions

12 Chapter 12: Relational, Directional, Clock & Calendar Reasoning

12.1 Direct Family Relations, Coded Blood Relations & Family Tree Tree-Mapping Methods 12.2 Cardinal & Ordinal Directions, Multi-Step Turn Paths, Pythagorean Distance & Shadow Timing 12.3 Clock Hands Angular Speed, Angle Between Hands at Given Time, Coincidence & Faulty Clocks 12.4 Odd Days Concept, Reference Date Calculations, Leap Year Rules & Repeating Calendar Years

13 Chapter 13: English Reading Comprehension

13.1 English Comprehension: Main Idea, Support & Inference 13.2 English Comprehension: Application, Structure & Style

14 Chapter 14: Mental Reasoning: Analogies & Series

14.1 Semantic, Letter & Number Analogies 14.2 Number Series: Differences, Powers & Missing Terms 14.3 Interleaved, Recursive & Wrong-Term Series

15 Chapter 15: Mental Reasoning: Coding & Ranking

15.1 Letter Shifts, Reversal & Numerical Codes 15.2 Message Intersections & Conditional Coding Tables 15.3 Ranking, People Between & Position Interchanges

16 Chapter 16: Mental Reasoning: Seating Arrangements

16.1 Linear Seating & Parallel Rows 16.2 Circular Seating, Facing & Rotational Symmetry

9.2 Permutations, Combinations, Classical Probability, Independent Events & Odds

Key Takeaways Explain This Topic AI

Counting multiplies the number of choices at successive stages when each prior choice permits the stated number at the next stage. Add disjoint alternatives. This counting principle does not require probabilistic independence.

Permutations ( n P r = n ! ( n − r ) ! ^n P_r = \frac{n!}{(n-r)!} n P r ​ = ( n − r )! n ! ​ ) enforce order sensitivity, reducing to circular permutations ( n − 1 ) ! (n-1)! ( n − 1 )! and multiset arrangements n ! p ! q ! r ! \frac{n!}{p! q! r!} p ! q ! r ! n ! ​ ; Combinations ( n C r = n ! r ! ( n − r ) ! ^n C_r = \frac{n!}{r!(n-r)!} n C r ​ = r ! ( n − r )! n ! ​ ) govern unordered selections with symmetry n C r = n C n − r ^n C_r = ^n C_{n-r} n C r ​ = n C n − r ​ .

Classical probability defines P ( E ) = n ( E ) n ( S ) P(E) = \frac{n(E)}{n(S)} P ( E ) = n ( S ) n ( E ) ​ with bounds 0 ≤ P ( E ) ≤ 1 0 \le P(E) \le 1 0 ≤ P ( E ) ≤ 1 and complement rule P ( E ′ ) = 1 − P ( E ) P(E') = 1 - P(E) P ( E ′ ) = 1 − P ( E ) .

Addition theorem for mutually exclusive events states P ( A ∪ B ) = P ( A ) + P ( B ) P(A \cup B) = P(A) + P(B) P ( A ∪ B ) = P ( A ) + P ( B ) ; for non-exclusive events, P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ∩ B ) P(A \cup B) = P(A) + P(B) - P(A \cap B) P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ∩ B ) .

Independent events satisfy product rule P ( A ∩ B ) = P ( A ) × P ( B ) P(A \cap B) = P(A) \times P(B) P ( A ∩ B ) = P ( A ) × P ( B ) ; odds in favor ( a : b a:b a : b ) translate to probability P ( E ) = a a + b P(E) = \frac{a}{a+b} P ( E ) = a + b a ​ and odds against to b a + b \frac{b}{a+b} a + b b ​ .

Last updated: October 2026

Fundamental Principles of Counting

All combinatorial and probability calculations originate from two fundamental counting axioms: +-----------------------------------------------------------------------------+

  • | FUNDAMENTAL COUNTING PRINCIPLES |
  • +-----------------------------------------------------------------------------+
  • | MULTIPLICATION PRINCIPLE (AND): Sequential stages with stated numbers of choices |
  • | If Step 1 has m ways AND Step 2 has n ways ---> Total = m * n |
  • +-----------------------------------------------------------------------------+
  • | ADDITION PRINCIPLE (OR): Mutually exclusive alternatives |
  • | If Alternative 1 has m ways OR Alternative 2 has n ways ---> Total = m + n |
  • +-----------------------------------------------------------------------------+

Multiplication Rule: If an operation consists of k k k sequential stages such that the first stage can be performed in n 1 n_1 n 1 ​ ways, the second in n 2 n_2 n 2 ​ ways, and the k k k -th in n k n_k n k ​ ways, and each earlier choice permits the stated number of choices at the next stage, the total number of composite ways is: N = n 1 × n 2 × n 3 × ⋯ × n k N = n_1 \times n_2 \times n_3 \times \dots \times n_k N = n 1 ​ × n 2 ​ × n 3 ​ × ⋯ × n k ​

Addition Rule: If a task can be accomplished either by method A A A (in m m m mutually exclusive ways) or by method B B B (in n n n mutually exclusive ways), where both methods cannot occur simultaneously, the task can be completed in: N = m + n ways N = m + n \quad \text{ways} N = m + n ways

Permutations (Arrangements Where Order Matters)

A permutation is an ordered arrangement of a specified number of items selected from a given set.

1. Linear Permutations of Distinct Objects

The number of ways to arrange r r r distinct items selected from n n n distinct items without replacement is: n P r = n ! ( n − r ) ! = n ( n − 1 ) ( n − 2 ) … ( n − r + 1 ) ^n P_r = \frac{n!}{(n - r)!} = n(n - 1)(n - 2)\dots(n - r + 1) n P r ​ = ( n − r )! n ! ​ = n ( n − 1 ) ( n − 2 ) … ( n − r + 1 )

Special values: n P 0 = 1 ^n P_0 = 1 n P 0 ​ = 1 , n P 1 = n ^n P_1 = n n P 1 ​ = n , n P n = n ! ^n P_n = n! n P n ​ = n ! , 0 ! = 1 0! = 1 0 ! = 1 .

2. Circular Permutations

When arranging n n n distinct objects in a closed loop or circle:

Distinct Orientations (e.g., seating people around a circular conference table): P circular = ( n − 1 ) ! P_{\text{circular}} = (n - 1)! P circular ​ = ( n − 1 )!

Indistinguishable Orientations (e.g., beads on a necklace, keys on a ring where clockwise and counterclockwise arrangements coincide upon flipping): P necklace = ( n − 1 ) ! 2 P_{\text{necklace}} = \frac{(n - 1)!}{2} P necklace ​ = 2 ( n − 1 )! ​

3. Permutations with Identical (Repeated) Elements

The number of distinct permutations of n n n objects, of which p p p are of one identical kind, q q q of a second identical kind, and r r r of a third identical kind, is: P = n ! p ! ⋅ q ! ⋅ r ! P = \frac{n!}{p! \cdot q! \cdot r!} P = p ! ⋅ q ! ⋅ r ! n ! ​

Example: The number of distinct arrangements of the 10 letters in the word LOCOMOTIVE (Total n = 10 n = 10 n = 10 ; letters O appears 3 times): 10 ! 3 ! = 3 , 628 , 800 6 = 604 , 800 \frac{10!}{3!} = \frac{3,628,800}{6} = 604,800 3 ! 10 ! ​ = 6 3 , 628 , 800 ​ = 604 , 800 .

Combinations (Selections Where Order Does Not Matter)

A combination is an unordered grouping or selection of items chosen from a set.

Formula & Core Algebraic Identities

The number of combinations of n n n distinct objects taken r r r at a time is: n C r = ( n r ) = n ! r ! ( n − r ) ! = n P r r ! ^n C_r = \binom{n}{r} = \frac{n!}{r! (n - r)!} = \frac{^n P_r}{r!} n C r ​ = ( r n ​ ) = r ! ( n − r )! n ! ​ = r ! n P r ​ ​

Property / Identity Formula Analytical Utility

Symmetry Property n C r = n C n − r ^n C_r = ^n C_{n-r} n C r ​ = n C n − r ​ Simplifies large r r r computations: 100 C 98 = 100 C 2 = 100 × 99 2 = 4 , 950 ^{100} C_{98} = ^{100} C_2 = \frac{100 \times 99}{2} = 4,950 100 C 98 ​ = 100 C 2 ​ = 2 100 × 99 ​ = 4 , 950

Boundary Values n C 0 = n C n = 1 , n C 1 = n ^n C_0 = ^n C_n = 1, \quad ^n C_1 = n n C 0 ​ = n C n ​ = 1 , n C 1 ​ = n Baseline conditions in probability expansion

Pascal's Identity n C r + n C r − 1 = n + 1 C r ^n C_r + ^n C_{r-1} = ^{n+1} C_r n C r ​ + n C r − 1 ​ = n + 1 C r ​ Recursive decomposition in binomial distribution

Total Combinations ∑ r = 0 n n C r = 2 n \sum_{r=0}^n {^n C_r} = 2^n ∑ r = 0 n ​ n C r ​ = 2 n Total possible subsets from n n n distinct items

At Least One Item ∑ r = 1 n n C r = 2 n − 1 \sum_{r=1}^n {^n C_r} = 2^n - 1 ∑ r = 1 n ​ n C r ​ = 2 n − 1 Selection where null set is prohibited

Classical Probability Foundations

If an experiment has a finite, non-empty sample space S S S consisting of equally likely elementary outcomes, and an event E ⊆ S E \subseteq S E ⊆ S comprises n ( E ) n(E) n ( E ) favorable outcomes, the classical probability of E E E is: P ( E ) = n ( E ) n ( S ) = Number of favorable outcomes Total number of possible exhaustive outcomes P(E) = \frac{n(E)}{n(S)} = \frac{\text{Number of favorable outcomes}}{\text{Total number of possible exhaustive outcomes}} P ( E ) = n ( S ) n ( E ) ​ = Total number of possible exhaustive outcomes Number of favorable outcomes ​

Axiomatic Boundaries & Complementarity

Probability Range: 0 ≤ P ( E ) ≤ 1 0 \le P(E) \le 1 0 ≤ P ( E ) ≤ 1 .

P ( ∅ ) = 0 P(\emptyset) = 0 P ( ∅ ) = 0 (Impossible event).

P ( S ) = 1 P(S) = 1 P ( S ) = 1 (Sure or certain event).

Complement Rule: If E ′ E' E ′ (or E ˉ \bar{E} E ˉ ) is the non-occurrence of E E E : P ( E ′ ) = 1 − P ( E ) ⟺ P ( E ) + P ( E ′ ) = 1 P(E') = 1 - P(E) \iff P(E) + P(E') = 1 P ( E ′ ) = 1 − P ( E ) ⟺ P ( E ) + P ( E ′ ) = 1

  • Compound Events, Addition Rule & Conditional Independence
  • 1. The Addition Theorem of Probability

For Any Two Events A A A and B B B (Union / OR): P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ∩ B ) P(A \cup B) = P(A) + P(B) - P(A \cap B) P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ∩ B )

Mutually Exclusive Events ( A ∩ B = ∅ A \cap B = \emptyset A ∩ B = ∅ ): Events that cannot occur simultaneously ( P ( A ∩ B ) = 0 P(A \cap B) = 0 P ( A ∩ B ) = 0 ): P ( A ∪ B ) = P ( A ) + P ( B ) P(A \cup B) = P(A) + P(B) P ( A ∪ B ) = P ( A ) + P ( B )

For Three Non-Exclusive Events: P ( A ∪ B ∪ C ) = P ( A ) + P ( B ) + P ( C ) − [ P ( A ∩ B ) + P ( B ∩ C ) + P ( C ∩ A ) ] + P ( A ∩ B ∩ C ) P(A \cup B \cup C) = P(A) + P(B) + P(C) - [P(A \cap B) + P(B \cap C) + P(C \cap A)] + P(A \cap B \cap C) P ( A ∪ B ∪ C ) = P ( A ) + P ( B ) + P ( C ) − [ P ( A ∩ B ) + P ( B ∩ C ) + P ( C ∩ A )] + P ( A ∩ B ∩ C )

2. Independent Events & The Multiplication Theorem

Two events A A A and B B B are statistically independent if the occurrence of one provides zero information about the likelihood of the other: P ( A ∩ B ) = P ( A ) × P ( B ) P(A \cap B) = P(A) \times P(B) P ( A ∩ B ) = P ( A ) × P ( B )

At Least One Event Occurs: If A , B , A, B, A , B , and C C C are mutually independent events, the probability that at least one occurs is: P ( At least one ) = 1 − P ( A ′ ∩ B ′ ∩ C ′ ) = 1 − [ P ( A ′ ) × P ( B ′ ) × P ( C ′ ) ] P(\text{At least one}) = 1 - P(A' \cap B' \cap C') = 1 - [P(A') \times P(B') \times P(C')] P ( At least one ) = 1 − P ( A ′ ∩ B ′ ∩ C ′ ) = 1 − [ P ( A ′ ) × P ( B ′ ) × P ( C ′ )]

3. Conditional Probability

The conditional probability of event A A A occurring given that event B B B has already occurred ( P ( B ) > 0 P(B) > 0 P ( B ) > 0 ) is: P ( A ∣ B ) = P ( A ∩ B ) P ( B ) P(A \mid B) = \frac{P(A \cap B)}{P(B)} P ( A ∣ B ) = P ( B ) P ( A ∩ B ) ​

If A A A and B B B are independent, P ( A ∣ B ) = P ( A ) × P ( B ) P ( B ) = P ( A ) P(A \mid B) = \frac{P(A) \times P(B)}{P(B)} = P(A) P ( A ∣ B ) = P ( B ) P ( A ) × P ( B ) ​ = P ( A ) .

  • Standard Discrete Probability Models
  • 1. Coin Tossing

For n n n unbiased coins tossed simultaneously, total outcomes n ( S ) = 2 n n(S) = 2^n n ( S ) = 2 n . The probability of obtaining exactly r r r heads obeys the binomial expansion: P ( r heads ) = n C r 2 n P(r \text{ heads}) = \frac{^n C_r}{2^n} P ( r heads ) = 2 n n C r ​ ​

2. Dice Rolling

One standard 6-sided die: n ( S ) = 6 n(S) = 6 n ( S ) = 6 .

Two fair dice thrown together: n ( S ) = 6 × 6 = 36 n(S) = 6 \times 6 = 36 n ( S ) = 6 × 6 = 36 .

Sum of Two Dice Distribution: The sum S S S ranges from 2 to 12 in a symmetric pyramid pattern:

Each paired row below gives the ways and probability for each individual sum , not the union of both sums.

  • Sum ( S S S ) Favorable Outcomes Ways Probability ( P ( S ) P(S) P ( S ) )
  • 2 or 12 ( 1 , 1 ) (1,1) ( 1 , 1 ) or ( 6 , 6 ) (6,6) ( 6 , 6 ) 1 1 / 36 1/36 1/36

3 or 11 ( 1 , 2 ) , ( 2 , 1 ) (1,2),(2,1) ( 1 , 2 ) , ( 2 , 1 ) or ( 5 , 6 ) , ( 6 , 5 ) (5,6),(6,5) ( 5 , 6 ) , ( 6 , 5 ) 2 2 / 36 = 1 / 18 2/36 = 1/18 2/36 = 1/18

4 or 10 ( 1 , 3 ) , ( 2 , 2 ) , ( 3 , 1 ) (1,3),(2,2),(3,1) ( 1 , 3 ) , ( 2 , 2 ) , ( 3 , 1 ) or ( 4 , 6 ) , ( 5 , 5 ) , ( 6 , 4 ) (4,6),(5,5),(6,4) ( 4 , 6 ) , ( 5 , 5 ) , ( 6 , 4 ) 3 3 / 36 = 1 / 12 3/36 = 1/12 3/36 = 1/12

5 or 9 ( 1 , 4 ) , ( 2 , 3 ) , ( 3 , 2 ) , ( 4 , 1 ) (1,4),(2,3),(3,2),(4,1) ( 1 , 4 ) , ( 2 , 3 ) , ( 3 , 2 ) , ( 4 , 1 ) or ( 3 , 6 ) , ( 4 , 5 ) , ( 5 , 4 ) , ( 6 , 3 ) (3,6),(4,5),(5,4),(6,3) ( 3 , 6 ) , ( 4 , 5 ) , ( 5 , 4 ) , ( 6 , 3 ) 4 4 / 36 = 1 / 9 4/36 = 1/9 4/36 = 1/9

6 or 8 ( 1 , 5 ) , ( 2 , 4 ) , ( 3 , 3 ) , ( 4 , 2 ) , ( 5 , 1 ) (1,5),(2,4),(3,3),(4,2),(5,1) ( 1 , 5 ) , ( 2 , 4 ) , ( 3 , 3 ) , ( 4 , 2 ) , ( 5 , 1 ) or ( 2 , 6 ) , ( 3 , 5 ) , ( 4 , 4 ) , ( 5 , 3 ) , ( 6 , 2 ) (2,6),(3,5),(4,4),(5,3),(6,2) ( 2 , 6 ) , ( 3 , 5 ) , ( 4 , 4 ) , ( 5 , 3 ) , ( 6 , 2 ) 5 5 / 36 5/36 5/36

7 ( 1 , 6 ) , ( 2 , 5 ) , ( 3 , 4 ) , ( 4 , 3 ) , ( 5 , 2 ) , ( 6 , 1 ) (1,6),(2,5),(3,4),(4,3),(5,2),(6,1) ( 1 , 6 ) , ( 2 , 5 ) , ( 3 , 4 ) , ( 4 , 3 ) , ( 5 , 2 ) , ( 6 , 1 ) 6 6 / 36 = 1 / 6 6/36 = 1/6 6/36 = 1/6

Tip

Dice Sum Shortcut: For a sum S S S between 2 and 7, the number of ways is S − 1 S - 1 S − 1 . For a sum S S S between 8 and 12, the number of ways is 13 − S 13 - S 13 − S . The sum 7 has the maximum probability of 6 / 36 = 1 / 6 6/36 = 1/6 6/36 = 1/6 .

  • 3. Standard 52-Card Pack Structure Total Deck = 52 Cards
  • ├── Red Cards (26): Hearts (13), Diamonds (13)
  • └── Black Cards (26): Spades (13), Clubs (13)
  • Per Suit (13 cards): Ace, 2, 3, 4, 5, 6, 7, 8, 9, 10, Jack, Queen, King
  • Face Cards (12 total): 4 Jacks, 4 Queens, 4 Kings (3 per suit)
  • Aces plus Face Cards: 4 Aces + 12 Face Cards = 16
  • 4. Urn / Ball Drawing: With vs. Without Replacement

With Replacement: Trials are independent; total outcomes and composition remain constant across draws.

Without Replacement: Trials are dependent; combinations ( n C r ^n C_r n C r ​ ) evaluate joint selections directly in one step.

Odds in Favor and Odds Against

Probability can be expressed as a ratio of favorable outcomes to unfavorable outcomes.

Let an event E E E have a a a favorable outcomes and b b b unfavorable outcomes, with total exhaustive outcomes n ( S ) = a + b n(S) = a + b n ( S ) = a + b :

Odds in Favor of Event E E E : Odds in Favor = a : b = P ( E ) 1 − P ( E ) = P ( E ) P ( E ′ ) \text{Odds in Favor} = a : b = \frac{P(E)}{1 - P(E)} = \frac{P(E)}{P(E')} Odds in Favor = a : b = 1 − P ( E ) P ( E ) ​ = P ( E ′ ) P ( E ) ​

Odds Against Event E E E : Odds Against = b : a = 1 − P ( E ) P ( E ) = P ( E ′ ) P ( E ) \text{Odds Against} = b : a = \frac{1 - P(E)}{P(E)} = \frac{P(E')}{P(E)} Odds Against = b : a = P ( E ) 1 − P ( E ) ​ = P ( E ) P ( E ′ ) ​

Converting Odds to Probability: P ( E ) = a a + b , P ( E ′ ) = b a + b P(E) = \frac{a}{a + b}, \quad P(E') = \frac{b}{a + b} P ( E ) = a + b a ​ , P ( E ′ ) = a + b b ​

Example: If the odds against an operational delay on a section are 7 : 3 7 : 3 7 : 3 , then unfavorable outcomes b = 7 b = 7 b = 7 (on-time) and favorable outcomes a = 3 a = 3 a = 3 (delay). The probability of delay is P ( E ) = 3 3 + 7 = 3 10 = 0.30 P(E) = \frac{3}{3 + 7} = \frac{3}{10} = 0.30 P ( E ) = 3 + 7 3 ​ = 10 3 ​ = 0.30 .

  • Worked Examples
  • Worked Example 1: Operational Safety Committee Combinatorics

Problem: A divisional safety inspection team of 5 officers is to be formed from a pool of 6 Section Controllers and 4 Track Engineers. In how many ways can the committee be selected if:

(a) There are no restrictions?

(b) The committee must contain exactly 3 Section Controllers and 2 Track Engineers?

(c) The committee must contain at least 4 Section Controllers?

Step 1: Unrestricted Selection (Part a): Total officers n = 6 + 4 = 10 n = 6 + 4 = 10 n = 6 + 4 = 10 ; committee size r = 5 r = 5 r = 5 . N = 10 C 5 = 10 × 9 × 8 × 7 × 6 5 × 4 × 3 × 2 × 1 = 252 ways N = {^{10} C_5} = \frac{10 \times 9 \times 8 \times 7 \times 6}{5 \times 4 \times 3 \times 2 \times 1} = 252 \text{ ways} N = 10 C 5 ​ = 5 × 4 × 3 × 2 × 1 10 × 9 × 8 × 7 × 6 ​ = 252 ways

Step 2: Exactly 3 Section Controllers and 2 Track Engineers (Part b): Apply multiplication rule between independent sub-selections: N = 6 C 3 × 4 C 2 N = {^6 C_3} \times {^4 C_2} N = 6 C 3 ​ × 4 C 2 ​ 6 C 3 = 6 × 5 × 4 3 × 2 × 1 = 20 {^6 C_3} = \frac{6 \times 5 \times 4}{3 \times 2 \times 1} = 20 6 C 3 ​ = 3 × 2 × 1 6 × 5 × 4 ​ = 20 4 C 2 = 4 × 3 2 × 1 = 6 {^4 C_2} = \frac{4 \times 3}{2 \times 1} = 6 4 C 2 ​ = 2 × 1 4 × 3 ​ = 6 N = 20 × 6 = 120 ways N = 20 \times 6 = 120 \text{ ways} N = 20 × 6 = 120 ways

Step 3: At Least 4 Section Controllers (Part c): "At least 4" implies either 4 SCs OR 5 SCs. Evaluate disjoint cases and sum via Addition Rule:

Case 1 (4 SC and 1 TE): 6 C 4 × 4 C 1 = 6 C 2 × 4 = ( 6 × 5 2 ) × 4 = 15 × 4 = 60 ways {^6 C_4} \times {^4 C_1} = {^6 C_2} \times 4 = \left( \frac{6 \times 5}{2} \right) \times 4 = 15 \times 4 = 60 \text{ ways} 6 C 4 ​ × 4 C 1 ​ = 6 C 2 ​ × 4 = ( 2 6 × 5 ​ ) × 4 = 15 × 4 = 60 ways

Case 2 (5 SC and 0 TE): 6 C 5 × 4 C 0 = 6 × 1 = 6 ways {^6 C_5} \times {^4 C_0} = 6 \times 1 = 6 \text{ ways} 6 C 5 ​ × 4 C 0 ​ = 6 × 1 = 6 ways Total = 60 + 6 = 66 ways \text{Total} = 60 + 6 = 66 \text{ ways} Total = 60 + 6 = 66 ways

Conclusion: (a) 252 ways , (b) 120 ways , (c) 66 ways .

Worked Example 2: Independent Reliability of Railway Signalling Blocks

Problem: Two adjacent automatic block sections operate independent electronic axle-counters. The probability that Block A clears correctly on train approach is 0.80 0.80 0.80 , while the probability that Block B clears correctly is 0.75 0.75 0.75 . Calculate the probability that:

(a) Both block sections clear correctly.

(b) Exactly one block section clears correctly.

(c) At least one block section clears correctly.

Step 1: Define Events and Complement Probabilities: Let P ( A ) = 0.80 ⟹ P ( A ′ ) = 1 − 0.80 = 0.20 P(A) = 0.80 \implies P(A') = 1 - 0.80 = 0.20 P ( A ) = 0.80 ⟹ P ( A ′ ) = 1 − 0.80 = 0.20 .

Let P ( B ) = 0.75 ⟹ P ( B ′ ) = 1 − 0.75 = 0.25 P(B) = 0.75 \implies P(B') = 1 - 0.75 = 0.25 P ( B ) = 0.75 ⟹ P ( B ′ ) = 1 − 0.75 = 0.25 .

Since the mechanisms are independent, P ( A ∩ B ) = P ( A ) × P ( B ) P(A \cap B) = P(A) \times P(B) P ( A ∩ B ) = P ( A ) × P ( B ) .

Step 2: Both Clear Correctly (Part a): P ( A ∩ B ) = P ( A ) × P ( B ) = 0.80 × 0.75 = 0.60 P(A \cap B) = P(A) \times P(B) = 0.80 \times 0.75 = 0.60 P ( A ∩ B ) = P ( A ) × P ( B ) = 0.80 × 0.75 = 0.60

Step 3: Exactly One Clears Correctly (Part b): This corresponds to ( A ∩ B ′ ) ∪ ( A ′ ∩ B ) (A \cap B') \cup (A' \cap B) ( A ∩ B ′ ) ∪ ( A ′ ∩ B ) : P ( Exactly One ) = [ P ( A ) × P ( B ′ ) ] + [ P ( A ′ ) × P ( B ) ] P(\text{Exactly One}) = [P(A) \times P(B')] + [P(A') \times P(B)] P ( Exactly One ) = [ P ( A ) × P ( B ′ )] + [ P ( A ′ ) × P ( B )] P ( Exactly One ) = ( 0.80 × 0.25 ) + ( 0.20 × 0.75 ) = 0.20 + 0.15 = 0.35 P(\text{Exactly One}) = (0.80 \times 0.25) + (0.20 \times 0.75) = 0.20 + 0.15 = 0.35 P ( Exactly One ) = ( 0.80 × 0.25 ) + ( 0.20 × 0.75 ) = 0.20 + 0.15 = 0.35

Step 4: At Least One Clears Correctly (Part c): Use complement of neither clearing: P ( At least one ) = 1 − [ P ( A ′ ) × P ( B ′ ) ] = 1 − ( 0.20 × 0.25 ) = 1 − 0.05 = 0.95 P(\text{At least one}) = 1 - [P(A') \times P(B')] = 1 - (0.20 \times 0.25) = 1 - 0.05 = 0.95 P ( At least one ) = 1 − [ P ( A ′ ) × P ( B ′ )] = 1 − ( 0.20 × 0.25 ) = 1 − 0.05 = 0.95

Conclusion: (a) 0.60 , (b) 0.35 , (c) 0.95 .

Worked Example 3: Selection Without Replacement and Odds Against

Problem: An operational junction store contains 5 red signal aspect bulbs, 4 green aspect bulbs, and 3 yellow aspect bulbs (total 12 bulbs). A maintenance technician selects 2 bulbs at random without replacement. Find:

(a) The probability that both selected bulbs are red.

(b) The probability that one bulb is green and one is yellow.

(c) The odds against both bulbs being red.

Step 1: Total Exhaustive Outcomes n ( S ) n(S) n ( S ) : Choosing 2 bulbs out of 12: n ( S ) = 12 C 2 = 12 × 11 2 × 1 = 66 n(S) = {^{12} C_2} = \frac{12 \times 11}{2 \times 1} = 66 n ( S ) = 12 C 2 ​ = 2 × 1 12 × 11 ​ = 66

Step 2: Probability Both Are Red (Part a): Favorable selections: choosing 2 red bulbs from 5 available: n ( E ) = 5 C 2 = 5 × 4 2 × 1 = 10 n(E) = {^5 C_2} = \frac{5 \times 4}{2 \times 1} = 10 n ( E ) = 5 C 2 ​ = 2 × 1 5 × 4 ​ = 10 P ( Both Red ) = 10 66 = 5 33 ≈ 0.1515 P(\text{Both Red}) = \frac{10}{66} = \frac{5}{33} \approx 0.1515 P ( Both Red ) = 66 10 ​ = 33 5 ​ ≈ 0.1515

Step 3: Probability One Green and One Yellow (Part b): Choosing 1 green from 4 AND 1 yellow from 3: n ( E ) = 4 C 1 × 3 C 1 = 4 × 3 = 12 n(E) = {^4 C_1} \times {^3 C_1} = 4 \times 3 = 12 n ( E ) = 4 C 1 ​ × 3 C 1 ​ = 4 × 3 = 12 P ( One Green, One Yellow ) = 12 66 = 2 11 ≈ 0.1818 P(\text{One Green, One Yellow}) = \frac{12}{66} = \frac{2}{11} \approx 0.1818 P ( One Green, One Yellow ) = 66 12 ​ = 11 2 ​ ≈ 0.1818

Step 4: Odds Against Both Bulbs Being Red (Part c): Probability of event P = 5 33 P = \frac{5}{33} P = 33 5 ​ , so favorable outcomes a = 5 a = 5 a = 5 and unfavorable outcomes b = 33 − 5 = 28 b = 33 - 5 = 28 b = 33 − 5 = 28 . Odds Against = b : a = 28 : 5 \text{Odds Against} = b : a = 28 : 5 Odds Against = b : a = 28 : 5

Conclusion: (a) 5 / 33 5/33 5/33 , (b) 2 / 11 2/11 2/11 , (c) 28 : 5 28 : 5 28 : 5 .

The classical favorable-outcomes ratio requires equally likely elementary outcomes. The coin and dice models assume independent fair trials; the necklace reflection formula assumes at least three distinct objects. Repeated-color sampling without replacement requires accounting for the changed composition.