Study guide
11.4 Compound Events, Rules of Probability, and Expected Value
New York Regents Algebra II Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Regents Exam Format, Scoring & Reference Guide
1.1 Regents Exam Format, Parts, and Score Conversion 1.2 The Next Generation Reference Sheet, Calculator Rules & Pacing
2 Chapter 2: Number and Quantity: Complex Numbers & Exponents
2.1 Rational Exponents and Radicals 2.2 The Complex Number System and Operations 2.3 Complex Solutions of Quadratic Equations
3 Chapter 3: Polynomial Arithmetic & Structure
3.1 Polynomial Structure and Factoring Techniques 3.2 Factoring Cubes, Polynomial Identities, and Binomial Expansions 3.3 Polynomial Division and the Remainder Theorem
4 Chapter 4: Solving Polynomial & Radical Equations
4.1 Zeros, Roots, and Graphing of Polynomial Functions 4.2 Radical Equations and Extraneous Solutions 4.3 Linear-Quadratic Systems: Parabolas and Circles 4.4 Creating Equations from Context and Justifying Each Step 4.5 Graphical Solutions: Reading f(x) = g(x) and f(x) < g(x)
5 Chapter 5: Rational Expressions & Equations
5.1 Simplifying and Operating with Rational Expressions 5.2 Solving Rational Equations and Modeling 5.3 Rational Function Graphs, Asymptotes, and Discontinuities
6 Chapter 6: Function Fundamentals & Transformations
6.1 Function Notation, Domain, Range, and Composition 6.2 Key Features of Functions and Average Rate of Change 6.3 Function Transformations 6.4 Comparing and Combining Functions Across Representations
7 Chapter 7: Inverses, Exponentials & Logarithms
7.1 Inverse Functions and Domain Restrictions 7.2 Exponential Growth, Decay, and Continuous Compounding 7.3 Logarithmic Properties and Solving Exponential/Logarithmic Equations 7.4 Graphing Exponential, Logarithmic, and Cube Root Functions
8 Chapter 8: Sequences and Series
8.1 Arithmetic and Geometric Sequences 8.2 Summation and Finite Series Formulas 8.3 Applications of Series: Financial Models and Annuities
9 Chapter 9: Trigonometric Functions
9.1 Radian Measure, Arc Length, and the Unit Circle 9.2 Graphs of Sine and Cosine & Sinusoidal Modeling 9.3 Trigonometric Identities and Equations
10 Chapter 10: Quantitative Data & Normal Distributions
10.1 The Normal Distribution, Empirical Rule, and Z-Scores 10.2 Bivariate Data, Scatterplots, and Regression Models 10.3 Residuals and Model Appropriateness 10.4 Judging Whether a Normal Model Fits and Choosing a Regression Model
11 Chapter 11: Statistical Inference & Probability
11.1 Statistical Studies: Surveys, Experiments, and Observational Studies 11.2 Sampling Variability, Simulation, and Margin of Error 11.3 Conditional Probability, Two-Way Tables, and Independence 11.4 Compound Events, Rules of Probability, and Expected Value
11.4 Compound Events, Rules of Probability, and Expected Value
Key Takeaways Explain This Topic AI
The General Addition Rule states P(A or B) = P(A) + P(B) - P(A and B), which prevents double-counting the intersection; for mutually exclusive (disjoint) events where P(A and B) = 0, it simplifies to P(A or B) = P(A) + P(B).
The Complement Rule states P(not A) = 1 - P(A), providing the foundational shortcut for evaluating 'at least one' compound scenarios: P(at least one) = 1 - P(none).
The General Multiplication Rule states P(A and B) = P(A) · P(B|A), which simplifies to P(A and B) = P(A) · P(B) if and only if events A and B are independent.
A discrete probability distribution lists all possible numerical outcomes x_i of a random variable along with their probabilities P(x_i), satisfying Σ P(x_i) = 1 with 0 ≤ P(x_i) ≤ 1.
Expected value E(X) = Σ [x_i · P(x_i)] represents the long-run weighted average outcome per trial, and a game is fair if and only if the expected net gain equals zero; expected value is a plus standard and is enrichment for Algebra II rather than tested content.
Last updated: September 2026
11.4 Compound Events, Rules of Probability, and Expected Value
Quick Answer: The probability of compound events is governed by three fundamental rules: the General 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 ) ), the Complement Rule ( P ( A c ) = 1 − P ( A ) P(A^c) = 1 - P(A) P ( A c ) = 1 − P ( A ) ), and the General Multiplication Rule ( P ( A ∩ B ) = P ( A ) ⋅ P ( B ∣ A ) P(A \cap B) = P(A) \cdot P(B|A) P ( A ∩ B ) = P ( A ) ⋅ P ( B ∣ A ) ). For independent events, the multiplication rule simplifies to P ( A ∩ B ) = P ( A ) ⋅ P ( B ) P(A \cap B) = P(A) \cdot P(B) P ( A ∩ B ) = P ( A ) ⋅ P ( B ) . The expected value of a discrete random variable X X X is its theoretical long-run weighted average: E ( X ) = ∑ [ x i ⋅ P ( x i ) ] E(X) = \sum [x_i \cdot P(x_i)] E ( X ) = ∑ [ x i ⋅ P ( x i )] . A game of chance or commercial decision is defined as fair if and only if the expected net gain equals zero ( E ( Net Gain ) = E ( X ) − Cost = 0 E(\text{Net Gain}) = E(X) - \text{Cost} = 0 E ( Net Gain ) = E ( X ) − Cost = 0 ).
1. Set Notation and Compound Probability Operations (AII-S.CP.1)
Note
Scope note. The two assessed standards in this section are AII-S.CP.1 (describe events as subsets of a sample space using unions, intersections, and complements) and AII-S.CP.7 (apply the Addition Rule and interpret the answer in context). The Educator Guide sample items for S-CP.A are a union-of-two-sets question and a complement-of-"at least one" question - exactly the two ideas below. Discrete probability distributions and expected value (S-MD.6 and S-MD.7) are plus standards and are not on the Algebra II blueprint ; Sections 4 and 5 below are marked as enrichment.
A compound event combines two or more individual events within a sample space S S S . Set theory provides the standard mathematical notation for compound operations: Union (A ∪ B) Intersection (A ∩ B) Complement (A^c)
- "A OR B or Both" "Both A AND B" "NOT A"
- ┌─────────────────┐ ┌─────────────────┐ ┌─────────────────┐
- │ █████████████ │ │ ░░░░░░░ │ │ ░░░░░░░ │
- │ █████░░░░░█████ │ │ ░░ ███ ░░ │ │ ░░░░░ ( A ) │
- │ █████████████ │ │ ░░░░░░░ │ │ ░░░░░░░ │
- └─────────────────┘ └─────────────────┘ └─────────────────┘
Union ( A ∪ B A \cup B A ∪ B , read as " A A A or B B B ") : The set of all outcomes belonging to event A A A , event B B B , or both. The probability P ( A ∪ B ) P(A \cup B) P ( A ∪ B ) represents the probability that at least one of the events occurs.
Intersection ( A ∩ B A \cap B A ∩ B , read as " A A A and B B B ") : The set of all outcomes belonging simultaneously to both event A A A and event B B B .
Complement ( A c A^c A c or A ′ A' A ′ , read as "not A A A ") : The set of all outcomes in sample space S S S that do not belong to event A A A .
The Complement Rule & The "At Least One" Strategy
Because an event and its complement partition the entire sample space ( P ( A ) + P ( A c ) = 1 P(A) + P(A^c) = 1 P ( A ) + P ( A c ) = 1 ): P ( A c ) = 1 − P ( A ) P(A^c) = 1 - P(A) P ( A c ) = 1 − P ( A )
In multi-stage trials, calculating the probability that an event occurs "at least once" directly by listing all combinations is tedious. The Complement Shortcut solves this efficiently: P ( at least one success ) = 1 − P ( zero successes ) P(\text{at least one success}) = 1 - P(\text{zero successes}) P ( at least one success ) = 1 − P ( zero successes )
2. The General Addition Rule & Mutually Exclusive Events (AII-S.CP.7 - printed on the reference sheet)
When calculating P ( A ∪ B ) P(A \cup B) P ( A ∪ B ) , adding P ( A ) P(A) P ( A ) and P ( B ) P(B) P ( B ) directly counts any outcomes in the intersection twice. To correct for this double-counting, subtract the joint probability: General Addition Rule: P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ∩ B ) \text{General Addition Rule: } P(A \cup B) = P(A) + P(B) - P(A \cap B) General Addition Rule: P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ∩ B )
Mutually Exclusive (Disjoint) Events
Two events A A A and B B B are mutually exclusive (or disjoint ) if they cannot occur at the same time. They have no outcomes in common: A ∩ B = ∅ ⟹ P ( A ∩ B ) = 0 A \cap B = \emptyset \implies P(A \cap B) = 0 A ∩ B = ∅ ⟹ P ( A ∩ B ) = 0
For mutually exclusive events, the addition rule simplifies to: P ( A ∪ B ) = P ( A ) + P ( B ) P(A \cup B) = P(A) + P(B) P ( A ∪ B ) = P ( A ) + P ( B )
Addition Rule Summary
Event Relationship Visual Overlap Intersection Probability Addition Rule Formula
Overlapping Events Sets intersect P ( A ∩ B ) > 0 P(A \cap B) > 0 P ( A ∩ B ) > 0 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 Sets disjoint 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 )
3. The General Multiplication Rule: Dependent vs. Independent Sequences
Rearranging the conditional probability formula 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 ) yields the General Multiplication Rule for the joint probability of sequential events: P ( A ∩ B ) = P ( A ) ⋅ P ( B ∣ A ) P(A \cap B) = P(A) \cdot P(B|A) P ( A ∩ B ) = P ( A ) ⋅ P ( B ∣ A )
Independent Events Multiplication Shortcut
If events A A A and B B B are independent, knowing that A A A occurred does not affect the probability of B B B ( P ( B ∣ A ) = P ( B ) P(B|A) = P(B) P ( B ∣ A ) = P ( B ) ). The rule simplifies to: P ( A ∩ B ) = P ( A ) ⋅ P ( B ) ( if and only if independent ) P(A \cap B) = P(A) \cdot P(B) \quad (\text{if and only if independent}) P ( A ∩ B ) = P ( A ) ⋅ P ( B ) ( if and only if independent )
Sampling With vs. Without Replacement
With Replacement : Each item drawn is returned to the pool before the next draw. The population remains constant, so consecutive trials are independent .
Without Replacement : Items drawn are not returned. The total pool and subset counts decrease with each draw, making consecutive trials dependent ( P ( B ∣ A ) ≠ P ( B ) P(B|A) \neq P(B) P ( B ∣ A ) = P ( B ) ).
4. Discrete Random Variables & Probability Distributions (Enrichment: (+)S-MD.6)
A discrete random variable X X X is a variable whose numerical value is determined by the outcome of a random phenomenon, taking on distinct, countable values x 1 , x 2 , … , x n x_1, x_2, \dots, x_n x 1 , x 2 , … , x n .
A probability distribution for a discrete random variable assigns a probability P ( X = x i ) P(X = x_i) P ( X = x i ) to each possible outcome. Every valid probability distribution must satisfy two mathematical conditions:
Every probability is non-negative and bounded by 1: 0 ≤ P ( x i ) ≤ 1 for all i 0 \le P(x_i) \le 1 \quad \text{for all } i 0 ≤ P ( x i ) ≤ 1 for all i
The sum of all probabilities over the entire sample space equals exactly 1: ∑ i = 1 n P ( x i ) = 1 \sum_{i=1}^n P(x_i) = 1 i = 1 ∑ n P ( x i ) = 1
5. Expected Value: Theoretical Long-Run Average (Enrichment: (+)S-MD.6, (+)S-MD.7)
The expected value , denoted E ( X ) E(X) E ( X ) or μ X \mu_X μ X , of a discrete random variable is the weighted average of all possible values, weighted by their respective probabilities: E ( X ) = ∑ i = 1 n [ x i ⋅ P ( x i ) ] = x 1 P ( x 1 ) + x 2 P ( x 2 ) + ⋯ + x n P ( x n ) E(X) = \sum_{i=1}^n [x_i \cdot P(x_i)] = x_1 P(x_1) + x_2 P(x_2) + \dots + x_n P(x_n) E ( X ) = i = 1 ∑ n [ x i ⋅ P ( x i )] = x 1 P ( x 1 ) + x 2 P ( x 2 ) + ⋯ + x n P ( x n )
Conceptual Meaning of Expected Value
Expected value does not represent the outcome of a single trial. It represents the long-run mean outcome per trial if the random process were repeated thousands of times under identical conditions (governed by the Law of Large Numbers).
Expected Net Gain and Game Fairness
In gaming, insurance, and investment analysis, participants pay an initial cost (ticket price, premium, entry fee) to play. The net gain is: Net Gain = Gross Payout ( X ) − Cost to Play \text{Net Gain} = \text{Gross Payout } (X) - \text{Cost to Play} Net Gain = Gross Payout ( X ) − Cost to Play
Because cost is a fixed constant: E ( Net Gain ) = E ( X ) − Cost E(\text{Net Gain}) = E(X) - \text{Cost} E ( Net Gain ) = E ( X ) − Cost ┌───────────────────────────────────────────────┐
- │ Game Fairness Benchmark │
- │ E(Net Gain) = 0 │
- └───────────────────────┬───────────────────────┘
- │
- ┌────────────────────────────────┴────────────────────────────────┐
- ▼ ▼
- E(Net Gain) < 0 E(Net Gain) > 0
- Unfair to Player Favorable to Player
- (Player loses on average; (Player gains on average;
- standard commercial games) unsustainable for host)
Fair Game : A game is mathematically fair if and only if the expected net gain equals zero ( E ( Net Gain ) = 0 E(\text{Net Gain}) = 0 E ( Net Gain ) = 0 ). Neither the player nor the house has an edge.
Unfair Game : If E ( Net Gain ) < 0 E(\text{Net Gain}) < 0 E ( Net Gain ) < 0 , the player expects to lose money on average in the long run.
- 6. Worked Problems
- Worked Problem 1: General Addition Rule in a High School Cohort
Problem: In an Algebra II grade of 160 160 160 students, 96 96 96 students participate in school musical clubs ( M M M ), 64 64 64 students participate in athletic teams ( A A A ), and 32 32 32 students participate in both ( M ∩ A M \cap A M ∩ A ).
Determine the probability that a randomly chosen student participates in musical clubs or athletic teams ( P ( M ∪ A ) P(M \cup A) P ( M ∪ A ) ).
Determine the probability that a randomly chosen student participates in neither activity.
Step 1: Calculate P ( M ∪ A ) P(M \cup A) P ( M ∪ A ) using the General Addition Rule. P ( M ) = 96 160 = 0.60 , P ( A ) = 64 160 = 0.40 , P ( M ∩ A ) = 32 160 = 0.20 P(M) = \frac{96}{160} = 0.60, \quad P(A) = \frac{64}{160} = 0.40, \quad P(M \cap A) = \frac{32}{160} = 0.20 P ( M ) = 160 96 = 0.60 , P ( A ) = 160 64 = 0.40 , P ( M ∩ A ) = 160 32 = 0.20 P ( M ∪ A ) = P ( M ) + P ( A ) − P ( M ∩ A ) P(M \cup A) = P(M) + P(A) - P(M \cap A) P ( M ∪ A ) = P ( M ) + P ( A ) − P ( M ∩ A ) P ( M ∪ A ) = 0.60 + 0.40 − 0.20 = 0.80 P(M \cup A) = 0.60 + 0.40 - 0.20 = 0.80 P ( M ∪ A ) = 0.60 + 0.40 − 0.20 = 0.80
Step 2: Calculate the probability of neither using the Complement Rule. Neither = ( M ∪ A ) c \text{Neither} = (M \cup A)^c Neither = ( M ∪ A ) c P ( neither ) = 1 − P ( M ∪ A ) = 1 − 0.80 = 0.20 P(\text{neither}) = 1 - P(M \cup A) = 1 - 0.80 = 0.20 P ( neither ) = 1 − P ( M ∪ A ) = 1 − 0.80 = 0.20
Worked Problem 2: Sequential Selection Without Replacement
Problem: A grab-bag contains 5 5 5 red marbles, 3 3 3 blue marbles, and 2 2 2 green marbles ( 10 10 10 total). Two marbles are drawn sequentially without replacement .
Determine the probability that both selected marbles are red.
Determine the probability that at least one selected marble is red.
Step 1: Calculate P ( Red 1 ∩ Red 2 ) P(\text{Red}_1 \cap \text{Red}_2) P ( Red 1 ∩ Red 2 ) using the multiplication rule. P ( Red 1 ) = 5 10 = 1 2 P(\text{Red}_1) = \frac{5}{10} = \frac{1}{2} P ( Red 1 ) = 10 5 = 2 1
After drawing one red marble, 4 4 4 red marbles remain out of 9 9 9 total marbles: P ( Red 2 ∣ Red 1 ) = 4 9 P(\text{Red}_2 | \text{Red}_1) = \frac{4}{9} P ( Red 2 ∣ Red 1 ) = 9 4 P ( Red 1 ∩ Red 2 ) = ( 5 10 ) ⋅ ( 4 9 ) = 20 90 = 2 9 ≈ 0.222 P(\text{Red}_1 \cap \text{Red}_2) = \left(\frac{5}{10}\right) \cdot \left(\frac{4}{9}\right) = \frac{20}{90} = \frac{2}{9} \approx 0.222 P ( Red 1 ∩ Red 2 ) = ( 10 5 ) ⋅ ( 9 4 ) = 90 20 = 9 2 ≈ 0.222
Step 2: Calculate P ( at least one Red ) P(\text{at least one Red}) P ( at least one Red ) via the complement. The complement of "at least one red" is "zero red marbles" (both are non-red). There are 5 5 5 non-red marbles (3 blue + 2 green): P ( Non-Red 1 ) = 5 10 P(\text{Non-Red}_1) = \frac{5}{10} P ( Non-Red 1 ) = 10 5 P ( Non-Red 2 ∣ Non-Red 1 ) = 4 9 P(\text{Non-Red}_2 | \text{Non-Red}_1) = \frac{4}{9} P ( Non-Red 2 ∣ Non-Red 1 ) = 9 4 P ( zero Red ) = ( 5 10 ) ⋅ ( 4 9 ) = 20 90 = 2 9 P(\text{zero Red}) = \left(\frac{5}{10}\right) \cdot \left(\frac{4}{9}\right) = \frac{20}{90} = \frac{2}{9} P ( zero Red ) = ( 10 5 ) ⋅ ( 9 4 ) = 90 20 = 9 2
Applying the complement shortcut: P ( at least one Red ) = 1 − P ( zero Red ) = 1 − 2 9 = 7 9 ≈ 0.778 P(\text{at least one Red}) = 1 - P(\text{zero Red}) = 1 - \frac{2}{9} = \frac{7}{9} \approx 0.778 P ( at least one Red ) = 1 − P ( zero Red ) = 1 − 9 2 = 9 7 ≈ 0.778
Worked Problem 3: Charity Raffle Expected Value & Fairness Analysis
Problem: A charity sells 500 500 500 raffle tickets at $ 10 \text{\textdollar}10 $ 10 each. The raffle awards one Grand Prize of $ 1 , 500 \text{\textdollar}1,500 $ 1 , 500 , two Second Prizes of $ 500 \text{\textdollar}500 $ 500 each, and five Third Prizes of $ 100 \text{\textdollar}100 $ 100 each. All other tickets win $ 0 \text{\textdollar}0 $ 0 .
Construct the discrete probability distribution for the gross payout X X X .
Calculate the expected value E ( X ) E(X) E ( X ) of a ticket.
Determine the expected net gain per ticket and state whether the raffle is a fair game.
Step 1: Construct the probability distribution table.
Grand Prize: x 1 = 1500 x_1 = 1500 x 1 = 1500 , P ( x 1 ) = 1 500 = 0.002 P(x_1) = \frac{1}{500} = 0.002 P ( x 1 ) = 500 1 = 0.002
Second Prize: x 2 = 500 x_2 = 500 x 2 = 500 , P ( x 2 ) = 2 500 = 0.004 P(x_2) = \frac{2}{500} = 0.004 P ( x 2 ) = 500 2 = 0.004
Third Prize: x 3 = 100 x_3 = 100 x 3 = 100 , P ( x 3 ) = 5 500 = 0.010 P(x_3) = \frac{5}{500} = 0.010 P ( x 3 ) = 500 5 = 0.010
No Prize: x 4 = 0 x_4 = 0 x 4 = 0 , P ( x 4 ) = 492 500 = 0.984 P(x_4) = \frac{492}{500} = 0.984 P ( x 4 ) = 500 492 = 0.984 Check: 0.002 + 0.004 + 0.010 + 0.984 = 1.000 0.002 + 0.004 + 0.010 + 0.984 = 1.000 0.002 + 0.004 + 0.010 + 0.984 = 1.000 .
Step 2: Calculate E ( X ) E(X) E ( X ) . E ( X ) = ∑ [ x i ⋅ P ( x i ) ] E(X) = \sum [x_i \cdot P(x_i)] E ( X ) = ∑ [ x i ⋅ P ( x i )] E ( X ) = ( 1500 ) ( 0.002 ) + ( 500 ) ( 0.004 ) + ( 100 ) ( 0.010 ) + ( 0 ) ( 0.984 ) E(X) = (1500)(0.002) + (500)(0.004) + (100)(0.010) + (0)(0.984) E ( X ) = ( 1500 ) ( 0.002 ) + ( 500 ) ( 0.004 ) + ( 100 ) ( 0.010 ) + ( 0 ) ( 0.984 ) E ( X ) = 3.00 + 2.00 + 1.00 + 0.00 = $ 6.00 E(X) = 3.00 + 2.00 + 1.00 + 0.00 = \$6.00 E ( X ) = 3.00 + 2.00 + 1.00 + 0.00 = $6.00
The gross theoretical payout is $ 6.00 \text{\textdollar}6.00 $ 6.00 per ticket.
Step 3: Calculate expected net gain and evaluate fairness. E ( Net Gain ) = E ( X ) − Ticket Cost = 6.00 − 10.00 = − $ 4.00 E(\text{Net Gain}) = E(X) - \text{Ticket Cost} = 6.00 - 10.00 = -\$4.00 E ( Net Gain ) = E ( X ) − Ticket Cost = 6.00 − 10.00 = − $4.00
Because E ( Net Gain ) = − $ 4.00 ≠ 0 E(\text{Net Gain}) = -\text{\textdollar}4.00 \neq 0 E ( Net Gain ) = − $ 4.00 = 0 , the raffle is not a fair game . Ticket buyers lose an average of $ 4.00 \text{\textdollar}4.00 $ 4.00 per ticket purchased. (Across all 500 tickets, the charity expects to raise 500 × $ 4.00 = $ 2 , 000 500 \times \text{\textdollar}4.00 = \text{\textdollar}2,000 500 × $ 4.00 = $ 2 , 000 in profit).
7. Common Regents Pitfalls & Exam Strategies
Pitfall 1: Blindly Adding Probabilities Without Subtracting the Intersection. When a problem asks for P ( A or B ) P(A \text{ or } B) P ( A or B ) , never write P ( A ) + P ( B ) P(A) + P(B) P ( A ) + P ( B ) unless the problem explicitly states that the events are mutually exclusive.
Pitfall 2: Confusing Gross Payout with Net Gain. When evaluating whether a game is fair, remember to subtract the cost of entry ( E ( Net Gain ) = E ( X ) − Cost E(\text{Net Gain}) = E(X) - \text{Cost} E ( Net Gain ) = E ( X ) − Cost ). Stating that a game with an expected payout of $ 6.00 \text{\textdollar}6.00 $ 6.00 is "profitable" when tickets cost $ 10.00 \text{\textdollar}10.00 $ 10.00 loses full credit.
Pitfall 3: Assuming Draws are Independent When Items Are Not Replaced. When calculating probabilities without replacement, remember that both the numerator and the denominator decrease on the second draw.