Study guide
15.3 Discrete Random Variables, Probability Distributions, Expectation, and Variance
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.3 Discrete Random Variables, Probability Distributions, Expectation, and Variance
Key Takeaways Explain This Topic AI
A discrete random variable X is defined by its distribution table P(X = x_i) = p_i, satisfying p_i ≥ 0 and ∑ p_i = 1.
Hypergeometric H(N, M, n) models sampling without replacement; Binomial B(n, p) models sampling with replacement.
Mathematical Expectation E(X) = ∑ x_i p_i represents the long-term mean. Properties: E(aX+b) = aE(X)+b, E(X+Y) = E(X)+E(Y).
Variance D(X) = E(X^2) - [E(X)]^2 measures dispersion. Properties: D(aX+b) = a^2 D(X); for independent X,Y, D(X+Y) = D(X)+D(Y).
Last updated: July 2026
- 15.3 Discrete Random Variables, Probability Distributions, Expectation, and Variance
- 1. Discrete Random Variables and Distribution Tables
A random variable X X X is a real-valued function defined on a sample space Ω \Omega Ω , assigning a real number X ( ω ) X(\omega) X ( ω ) to each elementary outcome ω ∈ Ω \omega \in \Omega ω ∈ Ω .
A random variable is discrete if its set of possible values { x 1 , x 2 , … , x n , … x_1, x_2, \dots, x_n, \dots x 1 , x 2 , … , x n , … } is finite or countably infinite.
1.1 Probability Distribution Table (Distribution Series)
The probability distribution of a discrete random variable X X X taking values x 1 , x 2 , … , x n x_1, x_2, \dots, x_n x 1 , x 2 , … , x n is represented by the table:
- X X X x 1 x_1 x 1 x 2 x_2 x 2 … \dots … x n x_n x n
- P P P p 1 p_1 p 1 p 2 p_2 p 2 … \dots … p n p_n p n
where p i = P ( X = x i ) p_i = P(X = x_i) p i = P ( X = x i ) .
1.2 Essential Axiomatic Properties
Non-negativity : p i ≥ 0 p_i \ge 0 p i ≥ 0 for all i = 1 , 2 , … , n i = 1, 2, \dots, n i = 1 , 2 , … , n .
Normalization : ∑ i = 1 n p i = p 1 + p 2 + ⋯ + p n = 1 \sum_{i=1}^n p_i = p_1 + p_2 + \dots + p_n = 1 ∑ i = 1 n p i = p 1 + p 2 + ⋯ + p n = 1 .
- 2. Common Discrete Probability Distributions
- 2.1 Two-Point (Bernoulli) Distribution B ( 1 , p ) B(1, p) B ( 1 , p )
A random variable X X X has a 0-1 (Two-point) distribution if it takes only two values, 1 ("Success") and 0 ("Failure"), with probabilities P ( X = 1 ) = p P(X = 1) = p P ( X = 1 ) = p and P ( X = 0 ) = 1 − p = q P(X = 0) = 1 - p = q P ( X = 0 ) = 1 − p = q .
2.2 Binomial Distribution B ( n , p ) B(n, p) B ( n , p )
When X X X represents the number of successes in n n n independent Bernoulli trials with success probability p p p : P ( X = k ) = C n k p k ( 1 − p ) n − k , k = 0 , 1 , 2 , … , n P(X = k) = C_n^k p^k (1-p)^{n-k}, \quad k = 0, 1, 2, \dots, n P ( X = k ) = C n k p k ( 1 − p ) n − k , k = 0 , 1 , 2 , … , n
Sampling Mechanism : Sampling with replacement from a population containing two types of items.
2.3 Hypergeometric Distribution H ( N , M , n ) H(N, M, n) H ( N , M , n )
Consider a finite population of N N N items containing M M M items of Type I (e.g., defective goods) and N − M N - M N − M items of Type II. If n n n items are drawn randomly without replacement , the number X X X of Type I items drawn follows a Hypergeometric distribution, denoted X ∼ H ( N , M , n ) X \sim H(N, M, n) X ∼ H ( N , M , n ) : P ( X = k ) = C M k C N − M n − k C N n , k = max ( 0 , n − ( N − M ) ) , … , min ( n , M ) P(X = k) = \frac{C_M^k C_{N-M}^{n-k}}{C_N^n}, \quad k = \max(0, n - (N-M)), \dots, \min(n, M) P ( X = k ) = C N n C M k C N − M n − k , k = max ( 0 , n − ( N − M )) , … , min ( n , M )
Key Comparison: Binomial vs. Hypergeometric
Hypergeometric : Sampling without replacement from a finite population ( N N N ). The probability of success changes with each draw.
Binomial : Sampling with replacement (or sampling without replacement when population N → ∞ N \to \infty N → ∞ or N N N is very large relative to sample size n n n , e.g., n / N < 0.05 n/N < 0.05 n / N < 0.05 ).
- 3. Mathematical Expectation (Mean) of Discrete Random Variables
- 3.1 Definition
The mathematical expectation (or expected value , mean ) of a discrete random variable X X X with distribution P ( X = x i ) = p i P(X = x_i) = p_i P ( X = x i ) = p i is defined as: E ( X ) = μ = ∑ i = 1 n x i p i = x 1 p 1 + x 2 p 2 + ⋯ + x n p n E(X) = \mu = \sum_{i=1}^n x_i p_i = x_1 p_1 + x_2 p_2 + \dots + x_n p_n E ( X ) = μ = i = 1 ∑ n x i p i = x 1 p 1 + x 2 p 2 + ⋯ + x n p n
Interpretation : E ( X ) E(X) E ( X ) represents the weighted average outcome or center of mass of the distribution across infinite independent repetitions of the experiment.
3.2 Properties of Expectation
Constant : E ( c ) = c E(c) = c E ( c ) = c for any constant c c c .
Linear Transformation : E ( a X + b ) = a E ( X ) + b E(aX + b) = a E(X) + b E ( a X + b ) = a E ( X ) + b for any constants a , b a, b a , b .
Additive Property : For any two random variables X X X and Y Y Y , E ( X + Y ) = E ( X ) + E ( Y ) E(X + Y) = E(X) + E(Y) E ( X + Y ) = E ( X ) + E ( Y ) (regardless of independence).
Multiplicative Property : If X X X and Y Y Y are independent, E ( X Y ) = E ( X ) E ( Y ) E(XY) = E(X) E(Y) E ( X Y ) = E ( X ) E ( Y ) .
3.3 Expectations of Standard Distributions
Two-point Distribution B ( 1 , p ) B(1, p) B ( 1 , p ) : E ( X ) = 1 ⋅ p + 0 ⋅ ( 1 − p ) = p E(X) = 1 \cdot p + 0 \cdot (1-p) = p E ( X ) = 1 ⋅ p + 0 ⋅ ( 1 − p ) = p .
Binomial Distribution B ( n , p ) B(n, p) B ( n , p ) : Expressing X = ∑ i = 1 n X i X = \sum_{i=1}^n X_i X = ∑ i = 1 n X i where X i ∼ B ( 1 , p ) X_i \sim B(1, p) X i ∼ B ( 1 , p ) are independent: E ( X ) = E ( ∑ i = 1 n X i ) = ∑ i = 1 n E ( X i ) = n p E(X) = E\left(\sum_{i=1}^n X_i\right) = \sum_{i=1}^n E(X_i) = n p E ( X ) = E ( i = 1 ∑ n X i ) = i = 1 ∑ n E ( X i ) = n p
Hypergeometric Distribution H ( N , M , n ) H(N, M, n) H ( N , M , n ) : E ( X ) = n × M N E(X) = n \times \frac{M}{N} E ( X ) = n × N M
- 4. Variance and Standard Deviation
- 4.1 Definition
The variance of X X X , denoted by D ( X ) D(X) D ( X ) or V a r ( X ) Var(X) Va r ( X ) , measures the dispersion or spread of the random variable around its mean E ( X ) E(X) E ( X ) : D ( X ) = E [ ( X − E ( X ) ) 2 ] = ∑ i = 1 n ( x i − E ( X ) ) 2 p i D(X) = E\left[ (X - E(X))^2 \right] = \sum_{i=1}^n (x_i - E(X))^2 p_i D ( X ) = E [ ( X − E ( X ) ) 2 ] = i = 1 ∑ n ( x i − E ( X ) ) 2 p i
Computational Formula (frequently used in calculations): D ( X ) = E ( X 2 ) − [ E ( X ) ] 2 = ( ∑ i = 1 n x i 2 p i ) − [ E ( X ) ] 2 D(X) = E(X^2) - [E(X)]^2 = \left( \sum_{i=1}^n x_i^2 p_i \right) - [E(X)]^2 D ( X ) = E ( X 2 ) − [ E ( X ) ] 2 = ( i = 1 ∑ n x i 2 p i ) − [ E ( X ) ] 2
The standard deviation is σ ( X ) = D ( X ) \sigma(X) = \sqrt{D(X)} σ ( X ) = D ( X ) .
4.2 Properties of Variance
Non-negativity : D ( X ) ≥ 0 D(X) \ge 0 D ( X ) ≥ 0 . D ( X ) = 0 D(X) = 0 D ( X ) = 0 if and only if X X X is constant with probability 1.
Linear Transformation : D ( a X + b ) = a 2 D ( X ) D(aX + b) = a^2 D(X) D ( a X + b ) = a 2 D ( X ) (note that constant shift b b b does not affect variance).
Additive Property for Independent Variables : If X X X and Y Y Y are independent: D ( X + Y ) = D ( X ) + D ( Y ) , D ( X − Y ) = D ( X ) + D ( Y ) D(X + Y) = D(X) + D(Y), \quad D(X - Y) = D(X) + D(Y) D ( X + Y ) = D ( X ) + D ( Y ) , D ( X − Y ) = D ( X ) + D ( Y )
4.3 Variances of Standard Distributions
Two-point Distribution B ( 1 , p ) B(1, p) B ( 1 , p ) : D ( X ) = p ( 1 − p ) = p q D(X) = p(1-p) = pq D ( X ) = p ( 1 − p ) = pq .
Binomial Distribution B ( n , p ) B(n, p) B ( n , p ) : D ( X ) = n p ( 1 − p ) = n p q D(X) = n p (1-p) = npq D ( X ) = n p ( 1 − p ) = n pq .
Hypergeometric Distribution H ( N , M , n ) H(N, M, n) H ( N , M , n ) : D ( X ) = n M N ( 1 − M N ) N − n N − 1 D(X) = n \frac{M}{N} \left(1 - \frac{M}{N}\right) \frac{N-n}{N-1} D ( X ) = n N M ( 1 − N M ) N − 1 N − n (Notice the finite population correction factor N − n N − 1 \frac{N-n}{N-1} N − 1 N − n compared to the Binomial variance).
- 5. Worked Gaokao Exam Examples
- Example 1: Hypergeometric vs Binomial Comparison in Batch Inspection
Problem : A batch of 10 electronic components contains 3 defective items and 7 non-defective items.
If 3 components are selected at random without replacement , let X X X be the number of defective items drawn. Write the probability distribution table of X X X , and calculate E ( X ) E(X) E ( X ) and D ( X ) D(X) D ( X ) .
If 3 components are selected at random with replacement , let Y Y Y be the number of defective items drawn. Calculate E ( Y ) E(Y) E ( Y ) and D ( Y ) D(Y) D ( Y ) .
Detailed Solution :
Without Replacement ( X ∼ H ( 10 , 3 , 3 ) X \sim H(10, 3, 3) X ∼ H ( 10 , 3 , 3 ) ) :
Possible values of X ∈ { 0 , 1 , 2 , 3 } X \in \{0, 1, 2, 3\} X ∈ { 0 , 1 , 2 , 3 } . Total ways to choose 3 from 10: C 10 3 = 10 × 9 × 8 3 × 2 × 1 = 120 C_{10}^3 = \frac{10 \times 9 \times 8}{3 \times 2 \times 1} = 120 C 10 3 = 3 × 2 × 1 10 × 9 × 8 = 120 .
P ( X = 0 ) = C 3 0 C 7 3 120 = 1 × 35 120 = 35 120 = 7 24 P(X = 0) = \frac{C_3^0 C_7^3}{120} = \frac{1 \times 35}{120} = \frac{35}{120} = \frac{7}{24} P ( X = 0 ) = 120 C 3 0 C 7 3 = 120 1 × 35 = 120 35 = 24 7
P ( X = 1 ) = C 3 1 C 7 2 120 = 3 × 21 120 = 63 120 = 21 40 P(X = 1) = \frac{C_3^1 C_7^2}{120} = \frac{3 \times 21}{120} = \frac{63}{120} = \frac{21}{40} P ( X = 1 ) = 120 C 3 1 C 7 2 = 120 3 × 21 = 120 63 = 40 21
P ( X = 2 ) = C 3 2 C 7 1 120 = 3 × 7 120 = 21 120 = 7 40 P(X = 2) = \frac{C_3^2 C_7^1}{120} = \frac{3 \times 7}{120} = \frac{21}{120} = \frac{7}{40} P ( X = 2 ) = 120 C 3 2 C 7 1 = 120 3 × 7 = 120 21 = 40 7
P ( X = 3 ) = C 3 3 C 7 0 120 = 1 × 1 120 = 1 120 P(X = 3) = \frac{C_3^3 C_7^0}{120} = \frac{1 \times 1}{120} = \frac{1}{120} P ( X = 3 ) = 120 C 3 3 C 7 0 = 120 1 × 1 = 120 1
Check sum: 35 + 63 + 21 + 1 120 = 120 120 = 1 \frac{35 + 63 + 21 + 1}{120} = \frac{120}{120} = 1 120 35 + 63 + 21 + 1 = 120 120 = 1 .
Expectation E ( X ) E(X) E ( X ) : E ( X ) = 0 ( 35 120 ) + 1 ( 63 120 ) + 2 ( 21 120 ) + 3 ( 1 120 ) = 0 + 63 + 42 + 3 120 = 108 120 = 9 10 = 0.9 E(X) = 0 \left(\frac{35}{120}\right) + 1 \left(\frac{63}{120}\right) + 2 \left(\frac{21}{120}\right) + 3 \left(\frac{1}{120}\right) = \frac{0 + 63 + 42 + 3}{120} = \frac{108}{120} = \frac{9}{10} = 0.9 E ( X ) = 0 ( 120 35 ) + 1 ( 120 63 ) + 2 ( 120 21 ) + 3 ( 120 1 ) = 120 0 + 63 + 42 + 3 = 120 108 = 10 9 = 0.9
Formula verification: n M N = 3 × 3 10 = 0.9 n \frac{M}{N} = 3 \times \frac{3}{10} = 0.9 n N M = 3 × 10 3 = 0.9 .
Variance D ( X ) D(X) D ( X ) : E ( X 2 ) = 0 2 ( 35 120 ) + 1 2 ( 63 120 ) + 2 2 ( 21 120 ) + 3 2 ( 1 120 ) = 63 + 84 + 9 120 = 156 120 = 1.3 E(X^2) = 0^2 \left(\frac{35}{120}\right) + 1^2 \left(\frac{63}{120}\right) + 2^2 \left(\frac{21}{120}\right) + 3^2 \left(\frac{1}{120}\right) = \frac{63 + 84 + 9}{120} = \frac{156}{120} = 1.3 E ( X 2 ) = 0 2 ( 120 35 ) + 1 2 ( 120 63 ) + 2 2 ( 120 21 ) + 3 2 ( 120 1 ) = 120 63 + 84 + 9 = 120 156 = 1.3 . D ( X ) = E ( X 2 ) − [ E ( X ) ] 2 = 1.3 − ( 0.9 ) 2 = 1.3 − 0.81 = 0.49 D(X) = E(X^2) - [E(X)]^2 = 1.3 - (0.9)^2 = 1.3 - 0.81 = 0.49 D ( X ) = E ( X 2 ) − [ E ( X ) ] 2 = 1.3 − ( 0.9 ) 2 = 1.3 − 0.81 = 0.49
With Replacement ( Y ∼ B ( 3 , 0.3 ) Y \sim B(3, 0.3) Y ∼ B ( 3 , 0.3 ) ) : p = 3 10 = 0.3 p = \frac{3}{10} = 0.3 p = 10 3 = 0.3 , n = 3 n = 3 n = 3 .
E ( Y ) = n p = 3 × 0.3 = 0.9 E(Y) = np = 3 \times 0.3 = 0.9 E ( Y ) = n p = 3 × 0.3 = 0.9 .
D ( Y ) = n p ( 1 − p ) = 3 × 0.3 × 0.7 = 0.63 D(Y) = np(1-p) = 3 \times 0.3 \times 0.7 = 0.63 D ( Y ) = n p ( 1 − p ) = 3 × 0.3 × 0.7 = 0.63 .
Insight : Expectation is identical ( 0.9 0.9 0.9 ), but sampling without replacement reduces variance ( 0.49 < 0.63 0.49 < 0.63 0.49 < 0.63 ) due to the finite population factor 10 − 3 10 − 1 = 7 9 ≈ 0.7778 \frac{10-3}{10-1} = \frac{7}{9} \approx 0.7778 10 − 1 10 − 3 = 9 7 ≈ 0.7778 , since 0.63 × 7 9 = 0.49 0.63 \times \frac{7}{9} = 0.49 0.63 × 9 7 = 0.49 .