Study guide

3.2 Permutations, Combinations & Probability Distributions

Pakistan ECAT Engineering Colleges Admission Test

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: ECAT Exam Structure, Scoring & Strategy

1.1 ECAT Exam Pattern, Scoring Scheme & UET Merit Aggregate 1.2 Time Management, Pacing & MCQ Problem-Solving Tactics

2 Chapter 2: Mathematics — Number Systems, Sets & Algebra

2.1 Real Numbers, Sets, Logic, Binary Operations & Groups 2.2 Complex Numbers, Modulus, Conjugates & De Moivre's Theorem 2.3 Matrices, Determinants, Inverses & Systems of Linear Equations 2.4 Quadratic Equations, Relations Between Roots & Factor/Remainder Theorems

3 Chapter 3: Mathematics — Sequences, Series & Combinatorics

3.1 Arithmetic, Geometric & Harmonic Progressions (AP, GP, HP) 3.2 Permutations, Combinations & Probability Distributions 3.3 Mathematical Induction & the Binomial Theorem

4 Chapter 4: Mathematics — Trigonometry & Trigonometric Equations

4.1 Fundamental Trigonometric Identities & Angle Addition Formulas 4.2 Graphs of Trigonometric Functions & Inverse Trigonometric Functions 4.3 Solutions of Triangles (Sine/Cosine Laws) & Trigonometric Equations

5 Chapter 5: Mathematics — Functions, Limits & Continuity

5.1 Real-Valued Functions, Types, Domains & Ranges 5.2 Limits of Functions, Indeterminate Forms & Squeeze Theorem 5.3 Continuity, Types of Discontinuity & Asymptotes

6 Chapter 6: Mathematics — Differential Calculus

6.1 Definition of Derivative, Power, Product, Quotient & Chain Rules 6.2 Derivatives of Trigonometric, Exponential & Logarithmic Functions 6.3 Implicit Differentiation, Parametric Equations & Higher-Order Derivatives 6.4 Tangents, Normals, Increasing/Decreasing Functions & Extrema

7 Chapter 7: Mathematics — Integral Calculus

7.1 Indefinite Integration Formulas & Integration by Substitution 7.2 Integration by Parts & Partial Fractions 7.3 Definite Integrals, Properties & Fundamental Theorem of Calculus 7.4 Area Under Curves & First-Order Differential Equations

8 Chapter 8: Mathematics — Analytic Geometry, Linear Programming & Vectors

8.1 Coordinates, Slopes, Straight Line Equations & Distances 8.2 Linear Inequalities & Linear Programming 8.3 Circle Equations, Tangents, Normals & Intersections 8.4 Conic Sections: Parabola, Ellipse & Hyperbola Characteristics 8.5 Vectors in 2D and 3D, Dot Product, Cross Product & Scalar Triple Product

9 Chapter 9: Physics — Measurements, Vectors & Equilibrium

9.1 Physical Quantities, SI Units, Errors & Dimensional Analysis 9.2 Vector Addition, Components, Scalar & Vector Products in Physics 9.3 Equilibrium Conditions, Torque & Rotational Equilibrium

10 Chapter 10: Physics — Kinematics, Dynamics & Energy

10.1 Kinematics: Displacement, Velocity, Acceleration & Motion Equations 10.2 Newton's Laws of Motion, Momentum, Impulse & Elastic Collisions 10.3 Projectile Motion: Trajectory, Height, Flight Time & Range 10.4 Work, Energy, Work-Energy Theorem, Conservative Forces & Power

11 Chapter 11: Physics — Circular Motion, Gravitation, Fluids & Oscillations

11.1 Uniform Circular Motion, Centripetal Force & Moment of Inertia 11.2 Gravitation, Escape Velocity, Satellites & Weightlessness 11.3 Viscosity, Drag Force, Equation of Continuity & Bernoulli's Principle 11.4 Simple Harmonic Motion (SHM), Pendulum, Mass-Spring & Resonance

12 Chapter 12: Physics — Waves, Optics, Optical Instruments & Thermodynamics

12.1 Waves, Speed of Sound, Standing Waves & Doppler Effect 12.2 Wave Theory of Light, Interference & Young's Double-Slit Experiment 12.3 Diffraction Grating, Resolving Power & Polarization of Light 12.4 Optical Instruments: Magnifiers, Microscopes, Telescopes, Spectrometer & Fibre Optics 12.5 Kinetic Theory of Gases, First Law, Heat Engines & Carnot Cycle

13 Chapter 13: Physics — Electrostatics, Current Electricity & Electromagnetism

13.1 Coulomb's Law, Electric Fields, Gauss's Law & Capacitors 13.2 Electric Current, Resistance, Ohm's Law, Kirchhoff's Rules & Potentiometer 13.3 Magnetic Fields, Ampere's Law, Faraday's Law, Lenz's Law & Transformers

14 Chapter 14: Physics — Alternating Current, Physics of Solids & Electronics

14.1 Alternating Current: RMS Values, Reactance, Impedance, Resonance & Power 14.2 Physics of Solids: Elasticity, Band Theory, Superconductors & Magnetic Materials 14.3 Electronics: p-n Junction, Rectifiers, Transistors, Op-Amps & Logic Gates

15 Chapter 15: Physics — Modern, Atomic & Nuclear Physics

15.1 Special Relativity, Mass–Energy Equivalence, Pair Production & Annihilation 15.2 Photoelectric Effect, Photons, Atomic Spectra, X-Rays & Nuclear Reactions 15.3 Lasers, Nuclear Reactors, Radiation Detectors, Dosimetry & Elementary Particles

16 Chapter 16: Chemistry — Basic Concepts, Atomic Structure, Bonding & States of Matter

16.1 Mole Concept, Stoichiometry, Limiting Reactants, Isotopes & Experimental Techniques 16.2 Atomic Structure, Bohr's Model, Quantum Numbers & Electronic Configurations 16.3 Chemical Bonding: Ionic, Covalent & Coordinate Bonds, VSEPR, Hybridization & MOT 16.4 Gas Laws, Ideal Gas Equation, Kinetic Molecular Theory & Real Gases 16.5 Liquids, Intermolecular Forces, Hydrogen Bonding & Crystal Lattices

17 Chapter 17: Chemistry — Energetics, Equilibrium & Kinetics

17.1 Enthalpy Changes, Calorimetry, Hess's Law & Born-Haber Cycle 17.2 Reversible Reactions, Equilibrium Constants (Kc, Kp), Le Chatelier & Ksp 17.3 Solutions, Concentration Units, Colligative Properties & Raoult's Law 17.4 Reaction Rates, Rate Equations, Order of Reaction & Activation Energy

18 Chapter 18: Chemistry — Periodic Trends, s-, p- & d-Block Elements & Electrochemistry

18.1 Periodic Trends: Atomic Radii, Ionization Energies & Electronegativities 18.2 Chemistry of s-Block and p-Block Elements (Groups I, II, III, IV, VII) 18.3 Groups V-A & VI-A: Nitrogen, Phosphorus, Oxygen & Sulphur Compounds 18.4 Transition Elements: Electronic Configurations, Complexes & Colors 18.5 Oxidation Numbers, Electrochemical Cells, Standard Potentials & Batteries

19 Chapter 19: Chemistry — Organic Chemistry & Reaction Mechanisms

19.1 Organic Functional Groups, IUPAC Nomenclature & Structural/Stereoisomerism 19.2 Aliphatic Hydrocarbons: Alkanes, Alkenes, Alkynes & Addition Reactions 19.3 Benzene: Electronic Structure, Resonance Stability & Electrophilic Substitution 19.4 Alkyl Halides (SN1/SN2), Grignard Reagents & Functional-Group Tests 19.5 Alcohols, Phenols & Ethers: Preparation and Reactions 19.6 Aldehydes, Ketones, Carboxylic Acids, Acid Derivatives & Amino Acids

20 Chapter 20: Chemistry — Macromolecules, Chemical Industries & Environment

20.1 Macromolecules: Polymers, Carbohydrates, Proteins, Lipids, Enzymes & Nucleic Acids 20.2 Chemical Industries in Pakistan & Environmental Chemistry

21 Chapter 21: English — Reading Comprehension, Vocabulary & Grammar

21.1 Reading Comprehension Strategies, Main Ideas, Inferences & Tone 21.2 Academic Vocabulary, Context Clues, Synonyms & Antonyms 21.3 Subject-Verb Agreement, Tenses & Grammatical Concord 21.4 Sentence Correction, Parallelism, Modifiers & Prepositions

3.2 Permutations, Combinations & Probability Distributions

Key Takeaways Explain This Topic AI

The Fundamental Principle of Counting dictates multiplying independent sequential stage options ( m × n m \times n m × n ) and adding disjoint, mutually exclusive choices ( m + n m + n m + n ).

Permutations count ordered arrangements where position matters ( n P r = n ! ( n − r ) ! {}^n P_r = \frac{n!}{(n-r)!} n P r ​ = ( n − r )! n ! ​ ), whereas combinations count unordered selections ( n C r = n ! r ! ( n − r ) ! {}^n C_r = \frac{n!}{r!(n-r)!} n C r ​ = r ! ( n − r )! n ! ​ ), related via n P r = r ! × n C r {}^n P_r = r! \times {}^n C_r n P r ​ = r ! × n C r ​ .

Arranging n n n objects with repeated elements yields n ! n 1 ! n 2 ! … n k ! \frac{n!}{n_1! n_2! \dots n_k!} n 1 ​ ! n 2 ​ ! … n k ​ ! n ! ​ ; circular permutations of distinct elements equal ( n − 1 ) ! (n-1)! ( n − 1 )! , reducing to ( n − 1 ) ! 2 \frac{(n-1)!}{2} 2 ( n − 1 )! ​ when reflections cannot be distinguished (e.g., beads on a necklace).

Combinations satisfy 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 ​ and symmetry n C r = n C n − r {}^n C_r = {}^n C_{n-r} n C r ​ = n C n − r ​ , enabling rapid algebraic reductions of binomial sums.

Compound probability calculations obey the addition rule 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 ) and conditional definition P ( A ∣ B ) = P ( A ∩ B ) P ( B ) P(A|B) = \frac{P(A \cap B)}{P(B)} P ( A ∣ B ) = P ( B ) P ( A ∩ B ) ​ ; events are statistically independent if and only if P ( A ∩ B ) = P ( A ) P ( B ) P(A \cap B) = P(A)P(B) P ( A ∩ B ) = P ( A ) P ( B ) .

Last updated: October 2026

Permutations, Combinations & Probability Distributions

Combinatorics and probability are central to competitive engineering entrance examinations. Candidates must solve intricate counting problems, evaluate constrained arrangements, and compute exact probabilities of compound events swiftly without relying on long exhaustive listings.

1. Fundamental Principles of Counting

All combinatorial mathematics rests on two foundational logic rules:

The Multiplication Principle (Rule of Product)

If an operation can be performed in m m m different ways, and following this operation a second independent operation can be performed in n n n different ways, then the two operations in succession can be performed in m × n m \times n m × n different ways.

Generalization: If a composite task consists of k k k sequential stages with n 1 , n 2 , … , n k n_1, n_2, \dots, n_k n 1 ​ , n 2 ​ , … , n k ​ choices at each stage, the total number of composite outcomes 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 ​

The Addition Principle (Rule of Sum)

If a task can be performed by executing either alternative A A A (which can occur in m m m ways) or alternative B B B (which can occur in n n n ways), and alternatives A A A and B B B are mutually exclusive (cannot occur simultaneously), then the task can be performed in m + n m + n m + n different ways.

Factorial Algebra & Properties

For any non-negative integer n n n :

n ! = n × ( n − 1 ) × ( n − 2 ) × ⋯ × 3 × 2 × 1 n! = n \times (n-1) \times (n-2) \times \dots \times 3 \times 2 \times 1 n ! = n × ( n − 1 ) × ( n − 2 ) × ⋯ × 3 × 2 × 1

Key conventions and identities:

Base case: 0 ! = 1 0! = 1 0 ! = 1 (by definition, representing the one way to arrange an empty set).

Recurrence: n ! = n × ( n − 1 ) ! n! = n \times (n-1)! n ! = n × ( n − 1 )! .

Undefined values: Factorials of negative integers are undefined (they approach infinity in gamma function analysis).

Algebraic cancellation: ( n + 2 ) ! n ! = ( n + 2 ) ( n + 1 ) = n 2 + 3 n + 2 \frac{(n+2)!}{n!} = (n+2)(n+1) = n^2 + 3n + 2 n ! ( n + 2 )! ​ = ( n + 2 ) ( n + 1 ) = n 2 + 3 n + 2 .

2. Permutations (Arrangements Where Order Matters)

A permutation is an ordered arrangement of elements chosen from a given set.

Linear Permutation of Distinct Objects

The number of arrangements of n n n distinct objects taken r r r at a time ( 0 ≤ r ≤ n 0 \le r \le n 0 ≤ r ≤ n ) is denoted by n P r {}^n P_r n P r ​ or P ( n , r ) P(n, r) P ( n , r ) :

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 )

Arranging all n n n objects linearly: n P n = n ! ( n − n ) ! = n ! 0 ! = n ! {}^n P_n = \frac{n!}{(n-n)!} = \frac{n!}{0!} = n! n P n ​ = ( n − n )! n ! ​ = 0 ! n ! ​ = n ! .

Choosing 0 objects: n P 0 = n ! n ! = 1 {}^n P_0 = \frac{n!}{n!} = 1 n P 0 ​ = n ! n ! ​ = 1 .

Choosing 1 object: n P 1 = n {}^n P_1 = n n P 1 ​ = n .

Permutations with Repetition (Non-Distinct Elements)

If a collection of n n n objects contains n 1 n_1 n 1 ​ identical objects of type 1, n 2 n_2 n 2 ​ identical objects of type 2, … \dots … , and n k n_k n k ​ identical objects of type k k k (such that n 1 + n 2 + ⋯ + n k = n n_1 + n_2 + \dots + n_k = n n 1 ​ + n 2 ​ + ⋯ + n k ​ = n ), the number of distinct linear permutations is:

P = n ! n 1 ! n 2 ! n 3 ! … n k ! P = \frac{n!}{n_1! \, n_2! \, n_3! \dots n_k!} P = n 1 ​ ! n 2 ​ ! n 3 ​ ! … n k ​ ! n ! ​

Classic Problem: How many distinct arrangements can be formed from the letters of the word PAKISTAN ?

Total letters n = 8 n = 8 n = 8 .

Counts: A appears 2 times, and P, K, I, S, T, N appear 1 time each.

Total permutations: 8 ! 2 ! 1 ! 1 ! 1 ! 1 ! 1 ! 1 ! = 40 , 320 2 = 20 , 160 \frac{8!}{2! \, 1! \, 1! \, 1! \, 1! \, 1! \, 1!} = \frac{40,320}{2} = 20,160 2 ! 1 ! 1 ! 1 ! 1 ! 1 ! 1 ! 8 ! ​ = 2 40 , 320 ​ = 20 , 160 .

Circular Permutations

When n n n distinct objects are arranged in a closed loop or circle, shifting all objects uniformly does not alter their relative cyclic positions. Fixing one reference object eliminates the rotational symmetry:

P circle = ( n − 1 ) ! P_{\text{circle}} = (n-1)! P circle ​ = ( n − 1 )!

Symmetric / Reversible Circular Arrangements (Necklaces & Keyrings): If clockwise and counter-clockwise orders cannot be distinguished (such as turning a necklace or keyring over):

  • P necklace = ( n − 1 ) ! 2 P_{\text{necklace}} = \frac{(n-1)!}{2} P necklace ​ = 2 ( n − 1 )! ​
  • Constrained Arrangement Tactics

The Bundle (Tie) Method (Items Must Be Together): Treat the constrained elements as a single composite unit (bundle). Permute the resulting set of items including the bundle, then multiply by the internal permutations of the items within the bundle. Example: Arranging 4 boys and 3 girls such that the 3 girls sit together: treat 3 girls as 1 block. There are 4 + 1 = 5 4 + 1 = 5 4 + 1 = 5 units to arrange ( 5 ! = 120 5! = 120 5 ! = 120 ways). The 3 girls can be internally arranged in 3 ! = 6 3! = 6 3 ! = 6 ways. Total arrangements = 120 × 6 = 720 = 120 \times 6 = 720 = 120 × 6 = 720 .

The Gap Method (Items Must Never Be Adjacent): First arrange the unconstrained items. Then insert the constrained items into the available spaces (gaps) formed before, between, and after the unconstrained items. Example: Arranging 5 men and 3 women so that no two women sit together: first seat the 5 men ( 5 ! = 120 5! = 120 5 ! = 120 ways). This creates 6 available gaps (including ends). Choose and arrange 3 women in these 6 gaps in 6 P 3 = 6 × 5 × 4 = 120 {}^6 P_3 = 6 \times 5 \times 4 = 120 6 P 3 ​ = 6 × 5 × 4 = 120 ways. Total arrangements = 120 × 120 = 14 , 400 = 120 \times 120 = 14,400 = 120 × 120 = 14 , 400 .

3. Combinations (Selections Where Order Does Not Matter)

A combination is an unordered collection or selection of r r r objects chosen from a set of n n n distinct objects:

n C r = ( n r ) = n ! r ! ( n − r ) ! {}^n C_r = \binom{n}{r} = \frac{n!}{r!(n-r)!} n C r ​ = ( r n ​ ) = r ! ( n − r )! n ! ​

Connection Between Permutations and Combinations

Because every selection of r r r items can be internally arranged in r ! r! r ! ways:

n P r = r ! × n C r ⟹ n C r = n P r r ! {}^n P_r = r! \times {}^n C_r \implies {}^n C_r = \frac{{}^n P_r}{r!} n P r ​ = r ! × n C r ​ ⟹ n C r ​ = r ! n P r ​ ​

  • Fundamental Properties & Identities of Combinations
  • Symmetry Property: n C r = n C n − r {}^n C_r = {}^n C_{n-r} n C r ​ = n C n − r ​

Equal Index Theorem (High-Yield Test Property): If n C x = n C y , then either x = y or x + y = n \text{If } {}^n C_x = {}^n C_y, \quad \text{then either } x = y \quad \text{or } x + y = n If n C x ​ = n C y ​ , then either x = y or x + y = n

Pascal's Addition 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 ​

Sum of All Combinations: ∑ r = 0 n n C r = n C 0 + n C 1 + n C 2 + ⋯ + n C n = 2 n \sum_{r=0}^{n} {}^n C_r = {}^n C_0 + {}^n C_1 + {}^n C_2 + \dots + {}^n C_n = 2^n ∑ r = 0 n ​ n C r ​ = n C 0 ​ + n C 1 ​ + n C 2 ​ + ⋯ + n C n ​ = 2 n

At Least One Item Selected: ∑ 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

4. Probability Theory Fundamentals

Probability quantifies the likelihood of occurrence of a random event within an experiment.

Sample Space & Events

Sample Space ( S S S ): The set of all possible elementary outcomes of a random experiment. For rolling a fair 6-sided die, S = { 1 , 2 , 3 , 4 , 5 , 6 } S = \{1, 2, 3, 4, 5, 6\} S = { 1 , 2 , 3 , 4 , 5 , 6 } with n ( S ) = 6 n(S) = 6 n ( S ) = 6 .

Event ( E E E ): Any subset of the sample space ( E ⊆ S E \subseteq S E ⊆ S ).

Equally Likely Outcomes: Outcomes that have identical physical propensity of occurring.

Classical (Laplacian) Definition of Probability

If an experiment has n ( S ) n(S) n ( S ) mutually exclusive, collectively exhaustive, and equally likely outcomes, and n ( E ) n(E) n ( E ) of them are favorable to event E E E :

P ( E ) = n ( E ) n ( S ) P(E) = \frac{n(E)}{n(S)} P ( E ) = n ( S ) n ( E ) ​

Probability Axioms:

0 ≤ P ( E ) ≤ 1 0 \le P(E) \le 1 0 ≤ P ( E ) ≤ 1 for any event E E E .

P ( S ) = 1 P(S) = 1 P ( S ) = 1 (certain event), and P ( ∅ ) = 0 P(\emptyset) = 0 P ( ∅ ) = 0 (impossible event).

Complementary Event Rule: P ( E ′ ) = 1 − P ( E ) P(E') = 1 - P(E) P ( E ′ ) = 1 − P ( E ) .

Speed Technique: Whenever a problem asks for the probability of "at least one" occurrence, immediately compute 1 − P ( none ) 1 - P(\text{none}) 1 − P ( none ) .

  • 5. Compound Events & Addition Theorems
  • Mutually Exclusive (Disjoint) Events

Events A A A and B B B are mutually exclusive if they cannot occur at the same time ( A ∩ B = ∅ A \cap B = \emptyset A ∩ B = ∅ ):

  • P ( A ∪ B ) = P ( A ) + P ( B ) P(A \cup B) = P(A) + P(B) P ( A ∪ B ) = P ( A ) + P ( B )
  • General Addition Theorem (Non-Mutually Exclusive Events)

If events A A A and B B B can occur simultaneously ( A ∩ B ≠ ∅ A \cap B \ne \emptyset A ∩ B  = ∅ ):

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 )

For three arbitrary events A , B , C A, B, C A , B , C :

P ( A ∪ B ∪ C ) = P ( A ) + P ( B ) + P ( C ) − P ( A ∩ B ) − P ( B ∩ C ) − P ( A ∩ C ) + 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(A \cap C) + P(A \cap B \cap C) P ( A ∪ B ∪ C ) = P ( A ) + P ( B ) + P ( C ) − P ( A ∩ B ) − P ( B ∩ C ) − P ( A ∩ C ) + P ( A ∩ B ∩ C )

  • 6. Conditional Probability & Independence
  • Conditional Probability

The 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 defined by restricting the sample space to B B B :

  • P ( A ∣ B ) = P ( A ∩ B ) P ( B ) P(A|B) = \frac{P(A \cap B)}{P(B)} P ( A ∣ B ) = P ( B ) P ( A ∩ B ) ​
  • Multiplication Theorem of Probability

Rearranging the conditional probability equation:

P ( A ∩ B ) = P ( B ) × P ( A ∣ B ) = P ( A ) × P ( B ∣ A ) P(A \cap B) = P(B) \times P(A|B) = P(A) \times P(B|A) P ( A ∩ B ) = P ( B ) × P ( A ∣ B ) = P ( A ) × P ( B ∣ A )

Independent Events

Two events A A A and B B B are statistically independent if the occurrence of one provides no information about the probability of the other: P ( A ∣ B ) = P ( A ) P(A|B) = P(A) P ( A ∣ B ) = P ( A ) . Consequently:

P ( A ∩ B ) = P ( A ) × P ( B ) ⟺ A and B are independent P(A \cap B) = P(A) \times P(B) \iff A \text{ and } B \text{ are independent} P ( A ∩ B ) = P ( A ) × P ( B ) ⟺ A and B are independent

Critical Distinction on the Exam: Never confuse mutually exclusive events with independent events:

If A A A and B B B are mutually exclusive and have non-zero probabilities, P ( A ∩ B ) = 0 ≠ P ( A ) P ( B ) P(A \cap B) = 0 \ne P(A)P(B) P ( A ∩ B ) = 0  = P ( A ) P ( B ) . Therefore, mutually exclusive events with positive probability are dependent .

  • 7. High-Yield ECAT Problem Archetypes
  • 1. Playing Card Mechanics (52-Card Deck)

Total cards = 52 = 52 = 52 , split into 4 suits of 13 cards each: Spades (♠) and Clubs (♣) are Black (26 cards); Hearts (♥) and Diamonds (♦) are Red (26 cards).

Each suit contains: Ace, 2, 3, 4, 5, 6, 7, 8, 9, 10, Jack, Queen, King.

Face cards (Court cards): Jack, Queen, King across 4 suits = 3 × 4 = 12 = 3 \times 4 = 12 = 3 × 4 = 12 cards.

Honor cards: Aces + Face cards = 16 = 16 = 16 cards.

2. Rolling Two Fair Dice

Total outcomes n ( S ) = 6 × 6 = 36 n(S) = 6 \times 6 = 36 n ( S ) = 6 × 6 = 36 .

Sums range from 2 to 12. The number of favorable outcomes follows a triangular distribution centered at sum 7:

  • Sum 2 3 4 5 6 7 8 9 10 11 12
  • Ways 1 2 3 4 5 6 5 4 3 2 1

Probability 1 36 \frac{1}{36} 36 1 ​ 2 36 \frac{2}{36} 36 2 ​ 3 36 \frac{3}{36} 36 3 ​ 4 36 \frac{4}{36} 36 4 ​ 5 36 \frac{5}{36} 36 5 ​ 6 36 \frac{6}{36} 36 6 ​ 5 36 \frac{5}{36} 36 5 ​ 4 36 \frac{4}{36} 36 4 ​ 3 36 \frac{3}{36} 36 3 ​ 2 36 \frac{2}{36} 36 2 ​ 1 36 \frac{1}{36} 36 1 ​

3. Sampling: With vs. Without Replacement

With Replacement: Trials are independent; probabilities remain identical at each stage.

Without Replacement: Trials are dependent; the denominator and numerator adjust after each selection (hypergeometric model).

Loading diagram... Compound Probability Decision Architecture