Study guide

15.2 Independent Events and Repeated Bernoulli Trials

Gaokao Mathematics Exam

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Sets, Logic, and Algebraic Foundations

1.1 Sets and Set Operations 1.2 Propositional Logic and Quantifiers 1.3 Inequalities and Absolute Value Equations

2 Chapter 2: Functions and Fundamental Properties

2.1 Concept, Domain, Range, and Mapping of Functions 2.2 Monotonicity, Parity, and Periodicity of Functions 2.3 Function Graphs, Transformations, and Zeros

3 Chapter 3: Exponential, Logarithmic, and Power Functions

3.1 Exponents and Exponential Functions 3.2 Logarithms and Logarithmic Functions 3.3 Power Functions and Comparative Growth Rates

4 Chapter 4: Complex Numbers and Quadratic Function Views

4.1 Algebraic and Geometric Representations of Complex Numbers 4.2 Complex Number Operations and Equations 4.3 Quadratic Equations and Inequalities from a Function Viewpoint

5 Chapter 5: Trigonometric Functions and Identities

5.1 Angles, Radians, and Unit Circle Definitions 5.2 Trigonometric Identities and Reduction Formulas 5.3 Addition, Subtraction, and Double-Angle Formulas 5.4 Graphs and Properties of Sine, Cosine, and Tangent Functions

6 Chapter 6: Triangles and Trigonometric Applications

6.1 Sine Theorem, Cosine Theorem, and Triangle Area Formulas 6.2 Solving Triangles and Comprehensive Geometric Applications 6.3 Practical Measurement, Optimization, and Trigonometric Modeling

7 Chapter 7: Sequences and Series

7.1 Arithmetic Sequences and Sums 7.2 Geometric Sequences and Sums 7.3 Recurrence Relations and General Term Determination 7.4 Advanced Summation Techniques and Sequence Applications

8 Chapter 8: Plane Vectors

8.1 Vector Concepts, Addition, Subtraction, and Scalar Multiplication 8.2 Coordinate Operations of Vectors 8.3 Dot Products, Angles, Vector Projections, and Geometric Applications

9 Chapter 9: Lines and Circles in Cartesian Coordinates

9.1 Equations of Straight Lines and Positional Relationships 9.2 Standard and General Equations of Circles 9.3 Positional Relationships Between Lines and Circles

10 Chapter 10: Conic Sections: Ellipses

10.1 Standard Equations and Definitions of Ellipses 10.2 Geometric Properties of Ellipses (Vertices, Foci, Eccentricity) 10.3 Intersection of Lines and Ellipses and Chord Problems

11 Chapter 11: Conic Sections: Hyperbolas and Parabolas

11.1 Hyperbola Definitions, Standard Equations, and Asymptotes 11.2 Parabola Definitions, Standard Equations, and Focal Properties 11.3 Unified Properties of Conic Sections and Trajectory Problems

12 Chapter 12: Solid Geometry: Three-Dimensional Figures

12.1 Prisms, Pyramids, Cylinders, Cones, and Spheres 12.2 Three-Dimensional Views and Cross-Sections 12.3 Surface Area and Volume Calculations

13 Chapter 13: Spatial Lines, Planes, and Spatial Vectors

13.1 Positional Relationships of Lines and Planes in Space 13.2 Parallelism and Perpendicularity Proofs in Solid Geometry 13.3 Spatial Coordinates and Spatial Vector Operations 13.4 Using Spatial Vectors to Compute Angles and Distances

14 Chapter 14: Permutations, Combinations, and Binomial Theorem

14.1 Fundamental Counting Principles (Addition and Multiplication Rules) 14.2 Permutations and Combinations 14.3 Binomial Theorem, Expansion Terms, and Coefficients

15 Chapter 15: Probability and Statistics

15.1 Classical Probability and Conditional Probability 15.2 Independent Events and Repeated Bernoulli Trials 15.3 Discrete Random Variables, Probability Distributions, Expectation, and Variance 15.4 Normal Distribution, Statistical Sampling, Correlation, and Regression

16 Chapter 16: Derivatives and Mathematical Modeling

16.1 Limit Concepts and Derivatives of Elementary Functions 16.2 Tangent Lines, Derivatives, Monotonicity, and Extremum Analysis 16.3 Optimization Problems and Curve Sketching with Derivatives 16.4 Real-World Mathematical Modeling and Problem Solving

15.2 Independent Events and Repeated Bernoulli Trials

Key Takeaways Explain This Topic AI

Two events A and B are independent iff P(AB) = P(A)P(B), or P(B|A) = P(B) when P(A) > 0.

Independence is distinct from mutual exclusivity: mutually exclusive events with positive probabilities can never be independent.

System reliability uses independence: Series system reliability P = ∏ p_i; Parallel system reliability P = 1 - ∏ (1 - p_i).

An n-fold Bernoulli trial consists of n independent repetitions with constant success probability p. Binomial PMF: P(X = k) = C_n^k p^k (1-p)^(n-k).

Last updated: July 2026

  • 15.2 Independent Events and Repeated Bernoulli Trials
  • 1. Independence of Events

In probability theory, two events are independent if the occurrence of one event does not affect the probability of occurrence of the other.

1.1 Definition of Independent Events

Two events A A A and B B B defined on a sample space Ω \Omega Ω are said to be statistically independent (or simply independent ) if and only if: P ( A B ) = P ( A ) P ( B ) P(AB) = P(A) P(B) P ( A B ) = P ( A ) P ( B )

If P ( A ) > 0 P(A) > 0 P ( A ) > 0 , this definition is logically equivalent to: P ( B ∣ A ) = P ( B ) P(B|A) = P(B) P ( B ∣ A ) = P ( B )

Similarly, if P ( B ) > 0 P(B) > 0 P ( B ) > 0 , it is equivalent to P ( A ∣ B ) = P ( A ) P(A|B) = P(A) P ( A ∣ B ) = P ( A ) .

1.2 Difference Between Independent and Mutually Exclusive Events

It is crucial in Gaokao examinations to distinguish between independence and mutual exclusivity:

Mutually Exclusive ( A ∩ B = ∅ A \cap B = \emptyset A ∩ B = ∅ ) : A A A and B B B cannot occur together ( P ( A B ) = 0 P(AB) = 0 P ( A B ) = 0 ). If P ( A ) > 0 P(A) > 0 P ( A ) > 0 and P ( B ) > 0 P(B) > 0 P ( B ) > 0 , mutually exclusive events cannot be independent, because P ( A B ) = 0 ≠ P ( A ) P ( B ) P(AB) = 0 \neq P(A)P(B) P ( A B ) = 0  = P ( A ) P ( B ) .

Independent ( P ( A B ) = P ( A ) P ( B ) P(AB) = P(A)P(B) P ( A B ) = P ( A ) P ( B ) ) : The occurrence of A A A provides zero information about whether B B B occurs.

1.3 Properties of Independent Events

If events A A A and B B B are independent, then each of the following pairs is also independent:

  • A A A and B ‾ \overline{B} B
  • A ‾ \overline{A} A and B B B
  • A ‾ \overline{A} A and B ‾ \overline{B} B

Proof for A A A and B ‾ \overline{B} B : P ( A B ‾ ) = P ( A − A B ) = P ( A ) − P ( A B ) = P ( A ) − P ( A ) P ( B ) = P ( A ) ( 1 − P ( B ) ) = P ( A ) P ( B ‾ ) P(A\overline{B}) = P(A - AB) = P(A) - P(AB) = P(A) - P(A)P(B) = P(A)(1 - P(B)) = P(A)P(\overline{B}) P ( A B ) = P ( A − A B ) = P ( A ) − P ( A B ) = P ( A ) − P ( A ) P ( B ) = P ( A ) ( 1 − P ( B )) = P ( A ) P ( B )

1.4 Mutual Independence of n n n Events

Events A 1 , A 2 , … , A n A_1, A_2, \dots, A_n A 1 ​ , A 2 ​ , … , A n ​ are mutually independent if for every subset of k k k events ( 2 ≤ k ≤ n 2 \le k \le n 2 ≤ k ≤ n ), the probability of their intersection equals the product of their individual probabilities: P ( A i 1 A i 2 … A i k ) = P ( A i 1 ) P ( A i 2 ) … P ( A i k ) P(A_{i_1} A_{i_2} \dots A_{i_k}) = P(A_{i_1}) P(A_{i_2}) \dots P(A_{i_k}) P ( A i 1 ​ ​ A i 2 ​ ​ … A i k ​ ​ ) = P ( A i 1 ​ ​ ) P ( A i 2 ​ ​ ) … P ( A i k ​ ​ )

Note : Pairwise independence ( P ( A i A j ) = P ( A i ) P ( A j ) P(A_i A_j) = P(A_i)P(A_j) P ( A i ​ A j ​ ) = P ( A i ​ ) P ( A j ​ ) for all i ≠ j i \neq j i  = j ) does not imply mutual independence for n ≥ 3 n \ge 3 n ≥ 3 .

2. System Reliability Applications (Series and Parallel Systems)

In engineering and Gaokao probability problems, independence is widely used to evaluate system reliability.

2.1 Series System

A series system operates if and only if all component units operate independently.

If components C 1 , C 2 , … , C n C_1, C_2, \dots, C_n C 1 ​ , C 2 ​ , … , C n ​ have reliability probabilities p 1 , p 2 , … , p n p_1, p_2, \dots, p_n p 1 ​ , p 2 ​ , … , p n ​ : P ( Series System Works ) = ∏ i = 1 n p i = p 1 ⋅ p 2 ⋯ p n P(\text{Series System Works}) = \prod_{i=1}^n p_i = p_1 \cdot p_2 \cdots p_n P ( Series System Works ) = i = 1 ∏ n ​ p i ​ = p 1 ​ ⋅ p 2 ​ ⋯ p n ​

2.2 Parallel System

A parallel system operates if at least one component unit operates independently. P ( Parallel System Works ) = 1 − P ( All Components Fail ) = 1 − ∏ i = 1 n ( 1 − p i ) P(\text{Parallel System Works}) = 1 - P(\text{All Components Fail}) = 1 - \prod_{i=1}^n (1 - p_i) P ( Parallel System Works ) = 1 − P ( All Components Fail ) = 1 − i = 1 ∏ n ​ ( 1 − p i ​ )

3. Repeated Bernoulli Trials

A Bernoulli trial is a random experiment with exactly two possible outcomes: "Success" ( S S S ) with probability p p p , and "Failure" ( F F F ) with probability q = 1 − p q = 1 - p q = 1 − p , where 0 < p < 1 0 < p < 1 0 < p < 1 .

3.1 Definition of n n n -fold Bernoulli Trials

An experiment consisting of n n n identical and independent repetitions of a Bernoulli trial is called an n n n -fold repeated Bernoulli trial (or n n n independent Bernoulli trials). Key features:

The experiment is repeated n n n times under identical conditions.

Each trial has only two mutually exclusive outcomes ( S S S and F F F ).

The probability p = P ( S ) p = P(S) p = P ( S ) remains constant across all n n n trials.

The outcomes of different trials are mutually independent.

3.2 Binomial Probability Formula

Let X X X denote the total number of successes in n n n independent Bernoulli trials. The probability of obtaining exactly k k k successes ( k = 0 , 1 , 2 , … , n k = 0, 1, 2, \dots, n k = 0 , 1 , 2 , … , n ) is given by the Binomial formula : P ( X = k ) = C n k p k ( 1 − p ) n − k = C n k p k q n − k P(X = k) = C_n^k p^k (1-p)^{n-k} = C_n^k p^k q^{n-k} P ( X = k ) = C n k ​ p k ( 1 − p ) n − k = C n k ​ p k q n − k

We write X ∼ B ( n , p ) X \sim B(n, p) X ∼ B ( n , p ) .

Derivation : Any specific sequence of k k k successes and n − k n-k n − k failures (e.g., S S … S F F … F S S \dots S F F \dots F SS … SFF … F ) has probability p k ( 1 − p ) n − k p^k (1-p)^{n-k} p k ( 1 − p ) n − k due to independence. The number of distinct sequences containing exactly k k k successes out of n n n trials is given by the combination C n k C_n^k C n k ​ . Summing these mutually exclusive sequences yields C n k p k ( 1 − p ) n − k C_n^k p^k (1-p)^{n-k} C n k ​ p k ( 1 − p ) n − k .

3.3 Most Probable Number of Successes

The value k 0 ∈ { 0 , 1 , … , n } k_0 \in \{0, 1, \dots, n\} k 0 ​ ∈ { 0 , 1 , … , n } that maximizes P ( X = k ) P(X = k) P ( X = k ) satisfies the inequality: ( n + 1 ) p − 1 ≤ k 0 ≤ ( n + 1 ) p (n+1)p - 1 \le k_0 \le (n+1)p ( n + 1 ) p − 1 ≤ k 0 ​ ≤ ( n + 1 ) p

If ( n + 1 ) p (n+1)p ( n + 1 ) p is not an integer, k 0 = ⌊ ( n + 1 ) p ⌋ k_0 = \lfloor (n+1)p \rfloor k 0 ​ = ⌊( n + 1 ) p ⌋ is unique.

If ( n + 1 ) p (n+1)p ( n + 1 ) p is an integer, there are two most probable values: k 0 = ( n + 1 ) p − 1 k_0 = (n+1)p - 1 k 0 ​ = ( n + 1 ) p − 1 and k 0 = ( n + 1 ) p k_0 = (n+1)p k 0 ​ = ( n + 1 ) p .

  • 4. Worked Gaokao Exam Examples
  • Example 1: Best-of-Five Tournament Analysis

Problem : Two table tennis players, Player A and Player B, compete in a best-of-five match (the first player to win 3 games wins the match). The games are independent, and in each game, the probability that Player A wins is p = 2 3 p = \frac{2}{3} p = 3 2 ​ .

Find the probability that Player A wins the match in exactly 4 games.

Find the overall probability that Player A wins the match.

Detailed Solution :

Winning in exactly 4 games :

For Player A to win in exactly 4 games, Player A must win exactly 2 of the first 3 games, and then win the 4th game.

The probability of winning 2 out of the first 3 games is given by the Binomial term C 3 2 p 2 ( 1 − p ) 3 − 2 C_3^2 p^2 (1-p)^{3-2} C 3 2 ​ p 2 ( 1 − p ) 3 − 2 : P ( A wins 2 of first 3 ) = C 3 2 ( 2 3 ) 2 ( 1 3 ) 1 = 3 × 4 9 × 1 3 = 4 9 P(\text{A wins 2 of first 3}) = C_3^2 \left(\frac{2}{3}\right)^2 \left(\frac{1}{3}\right)^1 = 3 \times \frac{4}{9} \times \frac{1}{3} = \frac{4}{9} P ( A wins 2 of first 3 ) = C 3 2 ​ ( 3 2 ​ ) 2 ( 3 1 ​ ) 1 = 3 × 9 4 ​ × 3 1 ​ = 9 4 ​

The 4th game is won by Player A with probability p = 2 3 p = \frac{2}{3} p = 3 2 ​ .

By independence of trials: P ( Match ends at game 4 with A winning ) = 4 9 × 2 3 = 8 27 P(\text{Match ends at game 4 with A winning}) = \frac{4}{9} \times \frac{2}{3} = \frac{8}{27} P ( Match ends at game 4 with A winning ) = 9 4 ​ × 3 2 ​ = 27 8 ​

Overall Probability of Player A winning the match :

Player A can win the match in 3, 4, or 5 games. These scenarios are mutually exclusive:

Win in 3 games : A wins 3 straight games. P 3 = p 3 = ( 2 3 ) 3 = 8 27 P_3 = p^3 = \left(\frac{2}{3}\right)^3 = \frac{8}{27} P 3 ​ = p 3 = ( 3 2 ​ ) 3 = 27 8 ​

Win in 4 games : P 4 = 8 27 P_4 = \frac{8}{27} P 4 ​ = 27 8 ​ (from part 1).

Win in 5 games : A wins 2 of the first 4 games, and then wins the 5th game. P 5 = [ C 4 2 p 2 ( 1 − p ) 2 ] × p = [ 6 × ( 2 3 ) 2 ( 1 3 ) 2 ] × 2 3 = [ 6 × 4 9 × 1 9 ] × 2 3 = 24 81 × 2 3 = 16 81 P_5 = \left[ C_4^2 p^2 (1-p)^2 \right] \times p = \left[ 6 \times \left(\frac{2}{3}\right)^2 \left(\frac{1}{3}\right)^2 \right] \times \frac{2}{3} = \left[ 6 \times \frac{4}{9} \times \frac{1}{9} \right] \times \frac{2}{3} = \frac{24}{81} \times \frac{2}{3} = \frac{16}{81} P 5 ​ = [ C 4 2 ​ p 2 ( 1 − p ) 2 ] × p = [ 6 × ( 3 2 ​ ) 2 ( 3 1 ​ ) 2 ] × 3 2 ​ = [ 6 × 9 4 ​ × 9 1 ​ ] × 3 2 ​ = 81 24 ​ × 3 2 ​ = 81 16 ​

Total probability that Player A wins: P ( A wins match ) = P 3 + P 4 + P 5 = 8 27 + 8 27 + 16 81 = 24 81 + 24 81 + 16 81 = 64 81 P(A \text{ wins match}) = P_3 + P_4 + P_5 = \frac{8}{27} + \frac{8}{27} + \frac{16}{81} = \frac{24}{81} + \frac{24}{81} + \frac{16}{81} = \frac{64}{81} P ( A wins match ) = P 3 ​ + P 4 ​ + P 5 ​ = 27 8 ​ + 27 8 ​ + 81 16 ​ = 81 24 ​ + 81 24 ​ + 81 16 ​ = 81 64 ​

Example 2: Target Shooting System Reliability

Problem : Three shooters S 1 , S 2 , S 3 S_1, S_2, S_3 S 1 ​ , S 2 ​ , S 3 ​ independently fire one shot at a target. Their hit probabilities are p 1 = 0.8 p_1 = 0.8 p 1 ​ = 0.8 , p 2 = 0.7 p_2 = 0.7 p 2 ​ = 0.7 , and p 3 = 0.6 p_3 = 0.6 p 3 ​ = 0.6 respectively.

Find the probability that the target is hit at least once.

Find the probability that exactly two shooters hit the target.

Detailed Solution :

Target hit at least once :

The target is hit at least once if not all shooters miss. The complement event is "all three shooters miss". P ( S 1 ‾ ) = 1 − 0.8 = 0.2 P(\overline{S_1}) = 1 - 0.8 = 0.2 P ( S 1 ​ ​ ) = 1 − 0.8 = 0.2 , P ( S 2 ‾ ) = 1 − 0.7 = 0.3 P(\overline{S_2}) = 1 - 0.7 = 0.3 P ( S 2 ​ ​ ) = 1 − 0.7 = 0.3 , P ( S 3 ‾ ) = 1 − 0.6 = 0.4 P(\overline{S_3}) = 1 - 0.6 = 0.4 P ( S 3 ​ ​ ) = 1 − 0.6 = 0.4 .

By independence: P ( All miss ) = P ( S 1 ‾ ) P ( S 2 ‾ ) P ( S 3 ‾ ) = 0.2 × 0.3 × 0.4 = 0.024 P(\text{All miss}) = P(\overline{S_1}) P(\overline{S_2}) P(\overline{S_3}) = 0.2 \times 0.3 \times 0.4 = 0.024 P ( All miss ) = P ( S 1 ​ ​ ) P ( S 2 ​ ​ ) P ( S 3 ​ ​ ) = 0.2 × 0.3 × 0.4 = 0.024

Thus, the probability of at least one hit is: P ( At least 1 hit ) = 1 − P ( All miss ) = 1 − 0.024 = 0.976 P(\text{At least 1 hit}) = 1 - P(\text{All miss}) = 1 - 0.024 = 0.976 P ( At least 1 hit ) = 1 − P ( All miss ) = 1 − 0.024 = 0.976

Exactly two shooters hit :

"Exactly two hit" consists of three mutually exclusive events:

E 1 E_1 E 1 ​ : S 1 , S 2 S_1, S_2 S 1 ​ , S 2 ​ hit, S 3 S_3 S 3 ​ misses ⟹ P ( E 1 ) = 0.8 × 0.7 × 0.4 = 0.224 \implies P(E_1) = 0.8 \times 0.7 \times 0.4 = 0.224 ⟹ P ( E 1 ​ ) = 0.8 × 0.7 × 0.4 = 0.224

E 2 E_2 E 2 ​ : S 1 , S 3 S_1, S_3 S 1 ​ , S 3 ​ hit, S 2 S_2 S 2 ​ misses ⟹ P ( E 2 ) = 0.8 × 0.3 × 0.6 = 0.144 \implies P(E_2) = 0.8 \times 0.3 \times 0.6 = 0.144 ⟹ P ( E 2 ​ ) = 0.8 × 0.3 × 0.6 = 0.144

E 3 E_3 E 3 ​ : S 2 , S 3 S_2, S_3 S 2 ​ , S 3 ​ hit, S 1 S_1 S 1 ​ misses ⟹ P ( E 3 ) = 0.2 × 0.7 × 0.6 = 0.084 \implies P(E_3) = 0.2 \times 0.7 \times 0.6 = 0.084 ⟹ P ( E 3 ​ ) = 0.2 × 0.7 × 0.6 = 0.084 Summing these probabilities: P ( Exactly 2 hit ) = 0.224 + 0.144 + 0.084 = 0.452 P(\text{Exactly 2 hit}) = 0.224 + 0.144 + 0.084 = 0.452 P ( Exactly 2 hit ) = 0.224 + 0.144 + 0.084 = 0.452

Loading diagram... Decision Flowchart for Trial Modeling and Bernoulli Trials