Study guide
12.2 Compound Events, Independent/Dependent Events & Conditional Probability
TExES Mathematics 4-8 115
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Exam Overview & Foundation
1.1 TExES 115 Exam Format, Scoring, Testing Tools & Certification Path 1.2 The Texas Essential Knowledge and Skills (TEKS) Framework & Mathematical Process Standards
2 Chapter 2: Number Systems & Quantity (Domain I)
2.1 Real and Complex Number Systems: Subsets, Closures & Representations 2.2 Place Value, Scientific Notation, Magnitude & Density Property 2.3 Properties of Real Numbers, Field Axioms & Inverse Operations
3 Chapter 3: Operations, Algorithms & Number Theory (Domain I)
3.1 Standard and Non-Standard Computational Algorithms for Rational Numbers 3.2 Laws of Exponents, Radicals, Rational Exponents & Mental Estimation 3.3 Number Theory: Prime Factorization, GCF, LCM & Divisibility Rules
4 Chapter 4: Patterns, Expressions & Algebraic Reasoning (Domain II)
4.1 Inductive Reasoning, Sequences, Arithmetic & Geometric Patterns 4.2 Algebraic Expressions, Polynomial Operations & Translating Verbal Statements 4.3 Solving Multi-Step Equations, Inequalities & Absolute Value Relations
5 Chapter 5: Linear Functions & Modeling (Domain II)
5.1 Slope, Rate of Change & Multiple Representations of Linear Functions 5.2 Linear Equation Forms (Slope-Intercept, Point-Slope, Standard) & Parallel/Perpendicular Lines 5.3 Systems of Linear Equations, Inequalities & Direct Variation Modeling
6 Chapter 6: Nonlinear Functions & Calculus Foundations (Domain II)
6.1 Quadratic Functions: Factoring, Vertex Form, Quadratic Formula & Parabolas 6.2 Exponential Growth/Decay, Inverse Variation & Rational Functions 6.3 Conceptual Foundations of Calculus: Limits, Rates of Change & Area Under Curves 6.4 Function Families & Transformations: Radical, Absolute Value, Piecewise, Logarithmic Functions and Quadratic Systems
7 Chapter 7: Measurement Systems & Trigonometric Ratios (Domain III)
7.1 Customary and Metric Systems, Conversion & Dimensional Analysis 7.2 Precision, Accuracy, Significant Figures & Measurement Error 7.3 The Pythagorean Theorem, Special Right Triangles & Right-Triangle Trigonometric Ratios
8 Chapter 8: Euclidean Geometry & Axiomatic Reasoning (Domain III)
8.1 Axiomatic Foundations: Points, Lines, Angles & Parallel Lines Cut by Transversals 8.2 Triangle Congruence Criteria (SSS, SAS, ASA, AAS, HL) & Deductive Proofs 8.3 Triangle Similarity (AA, SAS, SSS), Indirect Measurement & Scale Factors 8.4 Geometric Constructions with Compass, Straightedge & Reflection Devices
9 Chapter 9: Two- and Three-Dimensional Figures (Domain III)
9.1 Properties and Formulas for Polygons & Circles 9.2 Three-Dimensional Figures: Prisms, Pyramids, Cylinders, Cones & Spheres 9.3 Surface Area, Volume & Scale Factor Effects on Length, Area (k²), and Volume (k³)
10 Chapter 10: Transformational & Coordinate Geometry (Domain III)
10.1 Rigid Transformations: Translations, Reflections, Rotations & Symmetry 10.2 Non-Rigid Dilations, Scale Factors & Tessellations 10.3 Coordinate Geometry: Distance Formula, Midpoint Formula & Analytic Proofs 10.4 The Unit Circle, Radian Measure & Trigonometric Functions
11 Chapter 11: Data Exploration & Numerical Techniques (Domain IV)
11.1 Data Representations: Frequency Tables, Histograms, Stem-and-Leaf, Dot Plots & Box Plots 11.2 Measures of Central Tendency (Mean, Median, Mode) & Spread (Range, IQR, Standard Deviation) 11.3 Skewed Distributions, Outlier Effects & Bivariate Scatter Plots (Trend Lines & Correlation)
12 Chapter 12: Probability Theory & Statistical Inference (Domain IV)
12.1 Theoretical vs. Experimental Probability, Sample Spaces & Counting Principles (Permutations/Combinations) 12.2 Compound Events, Independent/Dependent Events & Conditional Probability 12.3 Random Sampling, Bias, Simulations, Expected Value & Population Predictions 12.4 Binomial, Geometric & Normal Distributions, Experiments and Confidence Intervals
13 Chapter 13: Mathematical Processes & Financial Literacy (Domain V)
13.1 Polya's Problem-Solving Model & Mathematical Heuristics (Visualizing, Tables, Working Backward) 13.2 Deductive Logic, Inductive Reasoning, Counterexamples & Proof by Contradiction 13.3 Multiple Representations, Cross-Disciplinary Connections & Personal Financial Literacy in TEKS
14 Chapter 14: Mathematical Learning & Student Cognition (Domain VI)
14.1 Cognitive Development in Middle School: Piaget, Vygotsky & Bruner's CPA Framework 14.2 Vertical TEKS Mathematics Progression Across Grades 4 through 8 14.3 Diagnosing and Remediating Persistent Student Mathematical Misconceptions
15 Chapter 15: Instruction, Assessment & Technology in Mathematics (Domain VI)
15.1 Planning Inquiry-Centered Math Lessons & Productive Discourse/Questioning 15.2 Effective Use of Concrete Manipulatives, Graphing Technology & Digital Tools 15.3 Formative vs. Summative Assessment, Rubrics, STAAR Context & Data-Driven Differentiation
12.2 Compound Events, Independent/Dependent Events & Conditional Probability
Key Takeaways Explain This Topic AI
Compound events combine two or more simple events through union (A ∪ B, 'or') or intersection (A ∩ B, 'and').
The General Addition Rule calculates the probability of a union as P(A ∪ B) = P(A) + P(B) - P(A ∩ B), subtracting the intersection to prevent double-counting overlapping outcomes; for mutually exclusive events, P(A ∩ B) = 0.
Two events are statistically independent if and only if P(A ∩ B) = P(A) · P(B), or equivalently P(B|A) = P(B); if the occurrence of one event alters the probability of the other, the events are dependent.
Sampling with replacement maintains independent trials with constant probabilities, whereas sampling without replacement induces statistical dependence with a shrinking sample space.
Conditional probability restricts the universal sample space to a designated condition: P(B|A) = P(A ∩ B) / P(A) for P(A) > 0, efficiently evaluated from two-way contingency tables by conditioning on row or column totals.
Last updated: September 2026
12.2 Compound Events, Independent/Dependent Events & Conditional Probability
While simple probability evaluates single outcomes from an experiment, most real-world decisions and secondary mathematical problems involve compound events —events formed by combining two or more simple events. Middle-school educators must guide students from basic single-stage intuition into multi-stage logical structures involving set operations: unions ("or"), intersections ("and"), and conditional constraints ("given that"). This section details the formal rules of probability that govern these compound relationships.
Set-Theoretic Foundations of Compound Events
Probability theory is built on the language of set theory. Every event is a subset of the universal sample space S S S . Compound events are formed through standard set operations:
Union ( A ∪ B A \cup B A ∪ B , read " A A A or B B B "): The event consisting of all outcomes that belong to event A A A , event B B B , or both. The union represents the occurrence of at least one of the events.
Intersection ( A ∩ B A \cap B A ∩ B , read " A A A and B B B "): The event consisting of all outcomes that belong simultaneously to both event A A A and event B B B . The intersection represents the joint occurrence of both events.
Universal Set ( S S S ): The complete sample space containing all possible outcomes, with P ( S ) = 1 P(S) = 1 P ( S ) = 1 .
Null Event ( ∅ \emptyset ∅ ): The impossible event containing zero outcomes, with P ( ∅ ) = 0 P(\emptyset) = 0 P ( ∅ ) = 0 .
Mutually Exclusive (Disjoint) vs. Overlapping Events
A critical distinction when evaluating the union of two events is whether they can occur at the same instant.
Mutually Exclusive (Disjoint) Events
Two events A A A and B B B are mutually exclusive (or disjoint) if they share no outcomes in common. Their intersection is the empty set: A ∩ B = ∅ ⟹ P ( A ∩ B ) = 0 A \cap B = \emptyset \implies P(A \cap B) = 0 A ∩ B = ∅ ⟹ P ( A ∩ B ) = 0
Examples:
When drawing a single card from a standard deck: Event A A A = drawing a Heart, Event B B B = drawing a Spade. A card cannot be both a Heart and a Spade simultaneously.
When rolling a single die: Event A A A = rolling an odd number { 1 , 3 , 5 } \{1, 3, 5\} { 1 , 3 , 5 } , Event B B B = rolling an even number { 2 , 4 , 6 } \{2, 4, 6\} { 2 , 4 , 6 } .
Overlapping (Non-Disjoint) Events
Two events A A A and B B B are overlapping if they share at least one common outcome. Their intersection is non-empty: A ∩ B ≠ ∅ ⟹ P ( A ∩ B ) > 0 A \cap B \ne \emptyset \implies P(A \cap B) > 0 A ∩ B = ∅ ⟹ P ( A ∩ B ) > 0
Examples:
When drawing a single card: Event A A A = drawing a King (4 cards), Event B B B = drawing a Diamond (13 cards). The King of Diamonds belongs to both sets ( A ∩ B = { King of Diamonds } A \cap B = \{\text{King of Diamonds}\} A ∩ B = { King of Diamonds } ).
When rolling a single die: Event A A A = rolling a prime number { 2 , 3 , 5 } \{2, 3, 5\} { 2 , 3 , 5 } , Event B B B = rolling an even number { 2 , 4 , 6 } \{2, 4, 6\} { 2 , 4 , 6 } . The outcome 2 2 2 is shared.
The Addition Rule of Probability
The Addition Rule provides the mathematical formula for computing the probability that event A A A or event B B B occurs ( P ( A ∪ B ) P(A \cup B) P ( A ∪ B ) ).
The General Addition Rule (For Any Two Events)
For any two events A A A and B B B in a sample space S S S : 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 )
Why must P ( A ∩ B ) P(A \cap B) P ( A ∩ B ) be subtracted? When counting elements or summing probabilities, the outcomes belonging to the intersection A ∩ B A \cap B A ∩ B are included within the count for P ( A ) P(A) P ( A ) and are counted a second time within P ( B ) P(B) P ( B ) . To correct for this double-counting , the joint probability P ( A ∩ B ) P(A \cap B) P ( A ∩ B ) must be subtracted once. On a Venn diagram, this corresponds to ensuring the overlapping central lens is shaded only once.
The Special Addition Rule (For Mutually Exclusive Events)
When events A A A and B B B are mutually exclusive, P ( A ∩ B ) = 0 P(A \cap B) = 0 P ( A ∩ B ) = 0 . Substituting zero into the General Addition Rule yields: P ( A ∪ B ) = P ( A ) + P ( B ) P(A \cup B) = P(A) + P(B) P ( A ∪ B ) = P ( A ) + P ( B )
This special case is simply a restatement of Kolmogorov's third axiom.
Extension: Inclusion-Exclusion for Three Events
For three arbitrary overlapping events A , B A, B A , B , and C C C : P ( A ∪ B ∪ C ) = P ( A ) + P ( B ) + P ( C ) − P ( A ∩ B ) − P ( A ∩ C ) − P ( B ∩ C ) + P ( A ∩ B ∩ C ) P(A \cup B \cup C) = P(A) + P(B) + P(C) - P(A \cap B) - P(A \cap C) - P(B \cap C) + P(A \cap B \cap C) P ( A ∪ B ∪ C ) = P ( A ) + P ( B ) + P ( C ) − P ( A ∩ B ) − P ( A ∩ C ) − P ( B ∩ C ) + P ( A ∩ B ∩ C )
Subtracting pairwise intersections removes the three-way intersection three times, necessitating adding back P ( A ∩ B ∩ C ) P(A \cap B \cap C) P ( A ∩ B ∩ C ) to restore balance.
Independent vs. Dependent Events
When analyzing the intersection of sequential or simultaneous events ( P ( A ∩ B ) P(A \cap B) P ( A ∩ B ) ), the central question is whether the occurrence of one event affects the probability of the other.
Formal Definition of Statistical Independence
Two events A A A and B B B are statistically independent if and only if the knowledge that event A A A has occurred provides zero information regarding the likelihood of event B B B . Mathematically, this condition is formally defined by three equivalent statements:
- P ( B ∣ A ) = P ( B ) P(B|A) = P(B) P ( B ∣ A ) = P ( B )
- P ( A ∣ B ) = P ( A ) P(A|B) = P(A) P ( A ∣ B ) = P ( A )
- P ( A ∩ B ) = P ( A ) × P ( B ) P(A \cap B) = P(A) \times P(B) P ( A ∩ B ) = P ( A ) × P ( B )
If any one of these three mathematical identities holds, all three hold, and events A A A and B B B are independent. If any one fails, the events are dependent .
Dependent Events
Two events A A A and B B B are dependent if the occurrence or non-occurrence of A A A alters the conditional probability of B B B : P ( B ∣ A ) ≠ P ( B ) P(B|A) \ne P(B) P ( B ∣ A ) = P ( B )
Critical Conceptual Trap: Mutually Exclusive vs. Independent
One of the most persistent errors on educator certification exams is confusing "mutually exclusive" with "independent." They are fundamentally different, and often mutually contradictory concepts:
The Mutually Exclusive vs. Independent Rule: If two events A A A and B B B have non-zero probabilities ( P ( A ) > 0 P(A) > 0 P ( A ) > 0 and P ( B ) > 0 P(B) > 0 P ( B ) > 0 ) and are mutually exclusive , they CANNOT be independent ; they are strictly dependent !
Proof: If A A A and B B B are mutually exclusive, they cannot happen together: P ( A ∩ B ) = 0 P(A \cap B) = 0 P ( A ∩ B ) = 0 . However, if they were independent, the Multiplication Rule would require P ( A ∩ B ) = P ( A ) × P ( B ) P(A \cap B) = P(A) \times P(B) P ( A ∩ B ) = P ( A ) × P ( B ) . Because P ( A ) > 0 P(A) > 0 P ( A ) > 0 and P ( B ) > 0 P(B) > 0 P ( B ) > 0 , their product P ( A ) × P ( B ) > 0 P(A) \times P(B) > 0 P ( A ) × P ( B ) > 0 . Since 0 ≠ P ( A ) × P ( B ) 0 \ne P(A) \times P(B) 0 = P ( A ) × P ( B ) , they cannot be independent.
Intuitive reason: If A A A and B B B are mutually exclusive, knowing that A A A occurred completely eliminates any chance of B B B occurring ( P ( B ∣ A ) = 0 P(B|A) = 0 P ( B ∣ A ) = 0 ). This represents maximum statistical dependence—knowing A A A provides complete information about B B B .
The Multiplication Rule of Probability
The Multiplication Rule computes the joint probability that both event A A A and event B B B occur ( P ( A ∩ B ) P(A \cap B) P ( A ∩ B ) ).
1. Independent Events Multiplication Rule
If events A A A and B B B are statistically independent: P ( A ∩ B ) = P ( A ) × P ( B ) P(A \cap B) = P(A) \times P(B) P ( A ∩ B ) = P ( A ) × P ( B )
Example: Tossing a coin and rolling a die. What is the probability of obtaining Heads and rolling a 5? P ( Head ∩ 5 ) = P ( Head ) × P ( 5 ) = 1 2 × 1 6 = 1 12 P(\text{Head} \cap 5) = P(\text{Head}) \times P(5) = \frac{1}{2} \times \frac{1}{6} = \frac{1}{12} P ( Head ∩ 5 ) = P ( Head ) × P ( 5 ) = 2 1 × 6 1 = 12 1
2. General Multiplication Rule (For Any Events, Independent or Dependent)
For any events A A A and B B B : P ( A ∩ B ) = P ( A ) × P ( B ∣ A ) = P ( B ) × P ( A ∣ B ) P(A \cap B) = P(A) \times P(B|A) = P(B) \times P(A|B) P ( A ∩ B ) = P ( A ) × P ( B ∣ A ) = P ( B ) × P ( A ∣ B )
Here, P ( B ∣ A ) P(B|A) P ( B ∣ A ) represents the conditional probability of event B B B occurring given that event A A A has already occurred.
Sampling With Replacement vs. Without Replacement
A prime context for demonstrating dependence in middle-school classrooms is drawing items from a container:
Sampling With Replacement: After each item is drawn and recorded, it is returned to the container before the next draw.
The composition of the container and sample space size ∣ S ∣ |S| ∣ S ∣ remain constant.
Successive trials are statistically independent .
Sampling Without Replacement: After each item is drawn, it is kept out of the container.
The total sample space size decreases by 1 on each draw ( n , n − 1 , n − 2 , … n, n-1, n-2, \dots n , n − 1 , n − 2 , … ), and the numerator decreases if the targeted category was drawn.
Successive trials are statistically dependent .
Conditional Probability & Reduced Sample Spaces
Conditional probability evaluates the likelihood of an event occurring given that some condition, constraint, or prior event has already been satisfied.
Formal Formula
For any two events A A A and B B B where P ( A ) > 0 P(A) > 0 P ( A ) > 0 , the conditional probability of B B B given A A A is defined as: P ( B ∣ A ) = P ( A ∩ B ) P ( A ) P(B|A) = \frac{P(A \cap B)}{P(A)} P ( B ∣ A ) = P ( A ) P ( A ∩ B )
The Conceptual Mechanism: Reducing the Sample Space
The power of conditional probability lies in understanding that the condition A A A replaces the original universal sample space S S S :
In unconditional probability P ( B ) = n ( B ) n ( S ) P(B) = \frac{n(B)}{n(S)} P ( B ) = n ( S ) n ( B ) , the reference set is the entire sample space S S S .
In conditional probability P ( B ∣ A ) = n ( A ∩ B ) n ( A ) P(B|A) = \frac{n(A \cap B)}{n(A)} P ( B ∣ A ) = n ( A ) n ( A ∩ B ) , the reference set shrinks strictly to set A A A . All outcomes outside of A A A are eliminated from consideration. We then determine what fraction of this new, restricted universe consists of outcomes that also belong to B B B .
Two-Way Contingency Tables (Cross-Tabulations)
A two-way contingency table is an indispensable pedagogical and analytical tool that organizes bivariate discrete frequency counts. It enables immediate calculation of marginal, joint, and conditional probabilities.
Anatomy of a Contingency Table
Consider a survey of 200 middle school students regarding grade level and participation in school band:
- Grade Level In Band ( B B B ) Not in Band ( B ′ B' B ′ ) Total (Marginal)
- 7th Grade ( G 7 G_7 G 7 ) 30 70 100
- 8th Grade ( G 8 G_8 G 8 ) 50 50 100
- Total (Marginal) 80 120 200 (Grand Total)
From this single table, all four probability classifications can be extracted directly:
Marginal Probabilities (Row or Column Totals ÷ \div ÷ Grand Total):
Probability that a randomly chosen student is in the 8th grade: P ( G 8 ) = Row Total Grand Total = 100 200 = 0.50 P(G_8) = \frac{\text{Row Total}}{\text{Grand Total}} = \frac{100}{200} = 0.50 P ( G 8 ) = Grand Total Row Total = 200 100 = 0.50
Probability that a randomly chosen student is in Band: P ( B ) = Column Total Grand Total = 80 200 = 0.40 P(B) = \frac{\text{Column Total}}{\text{Grand Total}} = \frac{80}{200} = 0.40 P ( B ) = Grand Total Column Total = 200 80 = 0.40
Joint Probabilities (Interior Cells ÷ \div ÷ Grand Total):
Probability that a student is in 8th grade AND in Band: P ( G 8 ∩ B ) = Cell Count Grand Total = 50 200 = 0.25 P(G_8 \cap B) = \frac{\text{Cell Count}}{\text{Grand Total}} = \frac{50}{200} = 0.25 P ( G 8 ∩ B ) = Grand Total Cell Count = 200 50 = 0.25
Conditional Probabilities (Interior Cell ÷ \div ÷ Row or Column Total):
Given that a student is in Band, what is the probability they are in 8th grade?
Condition is "In Band" (Column Total = 80): P ( G 8 ∣ B ) = Cell Count Condition Total = 50 80 = 5 8 = 0.625 P(G_8 | B) = \frac{\text{Cell Count}}{\text{Condition Total}} = \frac{50}{80} = \frac{5}{8} = 0.625 P ( G 8 ∣ B ) = Condition Total Cell Count = 80 50 = 8 5 = 0.625
Given that a student is in 8th grade, what is the probability they are in Band?
Condition is "8th Grade" (Row Total = 100): P ( B ∣ G 8 ) = Cell Count Condition Total = 50 100 = 0.50 P(B | G_8) = \frac{\text{Cell Count}}{\text{Condition Total}} = \frac{50}{100} = 0.50 P ( B ∣ G 8 ) = Condition Total Cell Count = 100 50 = 0.50
Testing Independence via Table Proportions: Are Grade Level and Band Participation independent? Check if P ( B ∣ G 8 ) = P ( B ) P(B | G_8) = P(B) P ( B ∣ G 8 ) = P ( B ) : P ( B ∣ G 8 ) = 0.50 vs. P ( B ) = 0.40 P(B | G_8) = 0.50 \quad \text{vs.} \quad P(B) = 0.40 P ( B ∣ G 8 ) = 0.50 vs. P ( B ) = 0.40 Because 0.50 ≠ 0.40 0.50 \ne 0.40 0.50 = 0.40 , band participation is dependent upon grade level (eighth-graders are more likely to participate in band than seventh-graders).
Reference Table: Compound & Conditional Probability Formulas
Probability Type Symbolic Notation General Mathematical Formula Special Case / Condition Common Context
Union ("Or") P ( A ∪ B ) P(A \cup B) P ( A ∪ B ) P ( A ) + P ( B ) − P ( A ∩ B ) P(A) + P(B) - P(A \cap B) P ( A ) + P ( B ) − P ( A ∩ B ) If mutually exclusive ( 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 ) Drawing a King or a Heart; rolling an odd sum or a sum > 8.
Intersection ("And") P ( A ∩ B ) P(A \cap B) P ( A ∩ B ) P ( A ) × P ( B ∣ A ) P(A) \times P(B\vert A) P ( A ) × P ( B ∣ A ) If independent ( P ( B ∣ A ) = P ( B ) P(B\vert A) = P(B) P ( B ∣ A ) = P ( B ) ):; P ( A ∩ B ) = P ( A ) × P ( B ) P(A \cap B) = P(A) \times P(B) P ( A ∩ B ) = P ( A ) × P ( B ) Drawing 2 aces without replacement vs tossing 2 heads on coins.
Conditional ("Given") P ( B ∣ A ) P(B\vert A) P ( B ∣ A ) P ( A ∩ B ) P ( A ) \frac{P(A \cap B)}{P(A)} P ( A ) P ( A ∩ B ) Provided P ( A ) > 0 P(A) > 0 P ( A ) > 0 ; reduces sample space to A A A Finding probability of an attribute given a known subpopulation.
Complement ("Not") P ( A ′ ) P(A') P ( A ′ ) 1 − P ( A ) 1 - P(A) 1 − P ( A ) Universal partition: P ( A ) + P ( A ′ ) = 1 P(A) + P(A') = 1 P ( A ) + P ( A ′ ) = 1 "At least one" probability problems: 1 − P ( none ) 1 - P(\text{none}) 1 − P ( none ) .
- Step-by-Step Worked Mathematical Examples
- Worked Example 1: Overlapping Addition Rule with Playing Cards
Problem: A single card is drawn at random from a standard, well-shuffled 52-card deck. What is the probability that the card drawn is either an Ace or a Red Card?
Step-by-Step Solution:
Step 1: Define events and identify sample space size:
Universal sample space ∣ S ∣ = 52 |S| = 52 ∣ S ∣ = 52 .
Event A A A : Card is an Ace ( n ( A ) = 4 n(A) = 4 n ( A ) = 4 ).
Event R R R : Card is a Red card (Hearts or Diamonds, n ( R ) = 26 n(R) = 26 n ( R ) = 26 ).
Step 2: Determine if events are mutually exclusive:
Are there cards that are simultaneously Aces and Red? Yes: the Ace of Hearts and the Ace of Diamonds.
n ( A ∩ R ) = 2 n(A \cap R) = 2 n ( A ∩ R ) = 2 , so events are overlapping (non-disjoint).
Step 3: Apply the General Addition Rule: P ( A ∪ R ) = P ( A ) + P ( R ) − P ( A ∩ R ) P(A \cup R) = P(A) + P(R) - P(A \cap R) P ( A ∪ R ) = P ( A ) + P ( R ) − P ( A ∩ R ) P ( A ∪ R ) = 4 52 + 26 52 − 2 52 = 4 + 26 − 2 52 = 28 52 P(A \cup R) = \frac{4}{52} + \frac{26}{52} - \frac{2}{52} = \frac{4 + 26 - 2}{52} = \frac{28}{52} P ( A ∪ R ) = 52 4 + 52 26 − 52 2 = 52 4 + 26 − 2 = 52 28
Step 4: Simplify the resulting fraction: P ( A ∪ R ) = 28 ÷ 4 52 ÷ 4 = 7 13 ≈ 0.5385 (or 53.85 % ) P(A \cup R) = \frac{28 \div 4}{52 \div 4} = \frac{7}{13} \approx 0.5385 \text{ (or } 53.85\%\text{)} P ( A ∪ R ) = 52 ÷ 4 28 ÷ 4 = 13 7 ≈ 0.5385 (or 53.85% )
Worked Example 2: Dependent Sequential Probability (Sampling Without Replacement)
Problem: An opaque container holds 8 red counters and 4 yellow counters (12 total counters). A student randomly draws two counters sequentially without replacement. What is the probability that both counters drawn are red?
Step-by-Step Solution:
Step 1: Define sequential events:
Let R 1 R_1 R 1 be the event that the first counter drawn is red.
Let R 2 R_2 R 2 be the event that the second counter drawn is red.
We seek the joint probability P ( R 1 ∩ R 2 ) P(R_1 \cap R_2) P ( R 1 ∩ R 2 ) .
Step 2: Calculate the probability of the initial stage:
Initially, there are 8 red counters out of 12 total counters: P ( R 1 ) = 8 12 = 2 3 P(R_1) = \frac{8}{12} = \frac{2}{3} P ( R 1 ) = 12 8 = 3 2
Step 3: Calculate the conditional probability of the second stage:
Because the first counter was red and was not replaced, the container now contains 8 − 1 = 7 8 - 1 = 7 8 − 1 = 7 red counters and 12 − 1 = 11 12 - 1 = 11 12 − 1 = 11 total counters: P ( R 2 ∣ R 1 ) = 7 11 P(R_2 | R_1) = \frac{7}{11} P ( R 2 ∣ R 1 ) = 11 7
Step 4: Apply the General Multiplication Rule: P ( R 1 ∩ R 2 ) = P ( R 1 ) × P ( R 2 ∣ R 1 ) = 8 12 × 7 11 = 2 3 × 7 11 = 14 33 ≈ 0.4242 (or 42.42 % ) P(R_1 \cap R_2) = P(R_1) \times P(R_2 | R_1) = \frac{8}{12} \times \frac{7}{11} = \frac{2}{3} \times \frac{7}{11} = \frac{14}{33} \approx 0.4242 \text{ (or } 42.42\%\text{)} P ( R 1 ∩ R 2 ) = P ( R 1 ) × P ( R 2 ∣ R 1 ) = 12 8 × 11 7 = 3 2 × 11 7 = 33 14 ≈ 0.4242 (or 42.42% )
Diagnostic Misconceptions & Pedagogical Strategies
Failing to Subtract the Overlap in Addition Problems: Students frequently calculate P ( Ace or Red ) = 4 52 + 26 52 = 30 52 P(\text{Ace or Red}) = \frac{4}{52} + \frac{26}{52} = \frac{30}{52} P ( Ace or Red ) = 52 4 + 52 26 = 52 30 , forgetting that the red aces were counted twice. Pedagogical strategy: Have students physically lay out the cards or draw a Venn diagram. Ask: "If you put all the aces in one pile and all the red cards in another pile, where do the red aces go? You cannot put one physical card in two places at once."
Treating Sampling Without Replacement as Independent: When calculating successive draws, students often keep the denominator constant (e.g., 8 12 × 7 12 \frac{8}{12} \times \frac{7}{12} 12 8 × 12 7 or 8 12 × 8 12 \frac{8}{12} \times \frac{8}{12} 12 8 × 12 8 ). Pedagogical strategy: Use physical manipulatives. After a student draws a red counter, hold up the container and ask: "How many total counters are left in my hand? How many red counters?" Seeing the physical reduction solidifies the conditional shift in both numerator and denominator.
The Transposed Conditional Fallacy ( P ( A ∣ B ) = P ( B ∣ A ) P(A|B) = P(B|A) P ( A ∣ B ) = P ( B ∣ A ) ): Students frequently assume that the probability of being an 8th grader given that one is in the band is identical to the probability of being in the band given that one is an 8th grader. Pedagogical strategy: Present extreme, intuitive counterexamples: "What is the probability that an animal has four legs given that it is a dog? ( 100 % 100\% 100% ). What is the probability that an animal is a dog given that it has four legs? (Very low—it could be a cat, horse, elephant, etc.)." This stark contrast permanently clarifies that conditioning order matters.