Study guide
14.1 Fundamental Counting Principles (Addition and Multiplication Rules)
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
14.1 Fundamental Counting Principles (Addition and Multiplication Rules)
Key Takeaways Explain This Topic AI
The Addition Principle (Rule of Sum) applies when a task can be accomplished by choosing from mutually exclusive categories, yielding total choices N = m_1 + m_2 + ... + m_k.
The Multiplication Principle (Rule of Product) applies when a task consists of a sequence of dependent or independent steps executed in order, yielding total choices N = m_1 * m_2 * ... * m_k.
Distinguishing between classification (mutually exclusive paths yielding sums) and step-wise decomposition (sequential stages yielding products) is the foundation of combinatorial counting.
Complementary counting (the Principle of Subtraction, N_valid = N_total - N_invalid) significantly simplifies constrained counting problems such as 'at least one' conditions.
Grid paths, boundary map coloring, and constrained digit formation represent classic Gaokao paradigms for applying fundamental counting principles.
Last updated: July 2026
14.1 Fundamental Counting Principles (Addition and Multiplication Rules)
Counting principles provide the foundational mathematical framework for discrete mathematics, combinatorics, and probability theory in Gaokao Mathematics. Every complex counting problem—no matter how elaborate—can be reduced to systematic applications of two core rules: the Addition Principle (Rule of Sum) and the Multiplication Principle (Rule of Product). Mastering the distinction between when to add and when to multiply is essential for solving high-level Gaokao problems without overcounting (重复) or undercounting (遗漏).
- 1. Mathematical Definitions and Formal Foundations
- 1.1 The Addition Principle (Rule of Sum / 分类加法计数原理)
If a task T T T can be accomplished by choosing from one of k k k mutually exclusive and exhaustive categories (or cases) C 1 , C 2 , … , C k C_1, C_2, \dots, C_k C 1 , C 2 , … , C k , where category C 1 C_1 C 1 contains m 1 m_1 m 1 distinct ways to complete the task, category C 2 C_2 C 2 contains m 2 m_2 m 2 distinct ways, ..., and category C k C_k C k contains m k m_k m k distinct ways, then the total number of distinct ways to complete task T T T is given by: N = m 1 + m 2 + ⋯ + m k = ∑ i = 1 k m i N = m_1 + m_2 + \dots + m_k = \sum_{i=1}^k m_i N = m 1 + m 2 + ⋯ + m k = i = 1 ∑ k m i
Set-Theoretic Interpretation: Let S 1 , S 2 , … , S k S_1, S_2, \dots, S_k S 1 , S 2 , … , S k be pairwise disjoint sets representing the sets of options for each category, meaning S i ∩ S j = ∅ S_i \cap S_j = \emptyset S i ∩ S j = ∅ for all i ≠ j i \neq j i = j . The total set of choices is the disjoint union S = ⋃ i = 1 k S i S = \bigcup_{i=1}^k S_i S = ⋃ i = 1 k S i , and its cardinality is: ∣ S ∣ = ∣ S 1 ∣ + ∣ S 2 ∣ + ⋯ + ∣ S k ∣ |S| = |S_1| + |S_2| + \dots + |S_k| ∣ S ∣ = ∣ S 1 ∣ + ∣ S 2 ∣ + ⋯ + ∣ S k ∣
Key Criterion for Addition: The choices in different categories are mutually exclusive (互斥). Selecting a choice from category C i C_i C i completes the task independently of the choices in any other category C j C_j C j .
1.2 The Multiplication Principle (Rule of Product / 分步乘法计数原理)
If a task T T T must be accomplished through a sequence of k k k consecutive steps S 1 , S 2 , … , S k S_1, S_2, \dots, S_k S 1 , S 2 , … , S k , where Step 1 can be completed in m 1 m_1 m 1 distinct ways, Step 2 can be completed in m 2 m_2 m 2 distinct ways (regardless of the outcome of Step 1), ..., and Step k k k can be completed in m k m_k m k distinct ways (regardless of the outcomes of prior steps), then the total number of distinct ways to complete task T T T is given by: N = m 1 × m 2 × ⋯ × m k = ∏ i = 1 k m i N = m_1 \times m_2 \times \dots \times m_k = \prod_{i=1}^k m_i N = m 1 × m 2 × ⋯ × m k = i = 1 ∏ k m i
Set-Theoretic Interpretation: If A 1 , A 2 , … , A k A_1, A_2, \dots, A_k A 1 , A 2 , … , A k are the sets of options available at each stage, the total set of multi-step outcomes is represented by the Cartesian product A = A 1 × A 2 × ⋯ × A k A = A_1 \times A_2 \times \dots \times A_k A = A 1 × A 2 × ⋯ × A k . The cardinality is: ∣ A ∣ = ∣ A 1 ∣ × ∣ A 2 ∣ × ⋯ × ∣ A k ∣ |A| = |A_1| \times |A_2| \times \dots \times |A_k| ∣ A ∣ = ∣ A 1 ∣ × ∣ A 2 ∣ × ⋯ × ∣ A k ∣
Key Criterion for Multiplication: The task is incomplete after any single step; all steps must be executed sequentially in order to achieve a complete outcome.
1.3 Strategic Comparison: Classification vs. Step-by-Step Decomposition
- Feature Addition Principle (分类加法) Multiplication Principle (分步乘法)
- Core Concept Classification (分类) Step-by-step Execution (分步)
- Task Status per Choice Choice completes the entire task Choice completes only one stage of the task
- Relationship Between Sets Mutually exclusive paths (互斥无交集) Sequential dependencies (连续完成)
- Mathematical Operation Summation ( + + + ) Product ( × \times × )
Gaokao Rule of Thumb "Can I finish the task in just one of these ways?" → \to → ADD "Do I need to take the next step to finish the task?" → \to → MULTIPLY
2. Advanced Problem-Solving Methodologies for Gaokao
In Gaokao examinations, counting problems rarely present straightforward single-step calculations. Instead, students must structure complex conditions into rigorous mathematical schemes using three primary analytical methodologies:
2.1 The Exhaustive Case-Classification Strategy (分类讨论法)
When a problem contains multiple coupled constraints (such as restricted positions, specific digit properties, or color adjacency rules), classify the sample space into sub-cases based on a primary restricting variable.
Rule of Non-Overlapping & Non-Omission (不重不漏):
The union of all sub-cases must equal the entire valid space: ⋃ i = 1 k C i = S valid \bigcup_{i=1}^k C_i = \mathcal{S}_{\text{valid}} ⋃ i = 1 k C i = S valid .
No two sub-cases may share an outcome: C i ∩ C j = ∅ C_i \cap C_j = \emptyset C i ∩ C j = ∅ for i ≠ j i \neq j i = j .
Choosing the Classification Standard (选定分类标准): Always select the most restrictive condition as the branching variable (e.g., whether a specific region uses the same color as another non-adjacent region, or whether a unit digit is zero vs. non-zero).
2.2 The Indirect / Complementary Subtractive Strategy (正难则反 - 间接法)
When direct calculation requires analyzing numerous tedious cases (such as conditions involving "at least one", "not all equal", or "at least two adjacent"), switch to complementary counting: N ( Satisfying Conditions ) = N ( Total Sample Space ) − N ( Violating Conditions ) N(\text{Satisfying Conditions}) = N(\text{Total Sample Space}) - N(\text{Violating Conditions}) N ( Satisfying Conditions ) = N ( Total Sample Space ) − N ( Violating Conditions )
Example Principle: To count the number of 4-digit numbers containing at least one digit '8', it is far simpler to subtract the number of 4-digit numbers containing no '8' from the total number of valid 4-digit numbers: N = ( 9 × 10 3 ) − ( 8 × 9 3 ) = 9000 − 5832 = 3168 N = (9 \times 10^3) - (8 \times 9^3) = 9000 - 5832 = 3168 N = ( 9 × 1 0 3 ) − ( 8 × 9 3 ) = 9000 − 5832 = 3168
Loading diagram... Decision Tree for Applying Fundamental Counting Principles
- 3. Classic Gaokao Worked Examples and Solutions
- Worked Example 1: Map and Region Coloring under Adjacency Constraints
Problem Statement: A map consists of 5 regions labeled A , B , C , D , E A, B, C, D, E A , B , C , D , E . Region A A A is adjacent to all four other regions ( B , C , D , E B, C, D, E B , C , D , E ). Region B B B is adjacent to A , C , E A, C, E A , C , E . Region C C C is adjacent to A , B , D A, B, D A , B , D . Region D D D is adjacent to A , C , E A, C, E A , C , E . Region E E E is adjacent to A , B , D A, B, D A , B , D . There are 4 4 4 distinct colors available. Adjacent regions must be painted in different colors. Calculate the total number of valid coloring schemes.
Detailed Mathematical Solution:
Step 1: Analyze Adjacencies and Constraints. Region A A A touches all other 4 regions ( B , C , D , E B, C, D, E B , C , D , E ). Therefore, region A A A must be assigned a unique color first.
Step 2: Assign Color to Region A A A . Since there are 4 4 4 colors available, A A A can be colored in 4 4 4 ways. After coloring A A A , exactly 3 3 3 colors remain for the rest of the regions B , C , D , E B, C, D, E B , C , D , E .
Step 3: Classify based on non-adjacent regions B B B and D D D . Regions B B B and D D D are not adjacent to each other. We divide into two mutually exclusive cases based on whether B B B and D D D receive the same color or different colors .
Case 1: Regions B B B and D D D have the SAME color.
Select color for B B B : There are 3 3 3 available colors (excluding A A A 's color).
Color for D D D : Since D D D must share B B B 's color, there is only 1 1 1 choice for D D D .
Color for C C C : Region C C C is adjacent to A , B , D A, B, D A , B , D . Since B B B and D D D share the same color, C C C is adjacent to only 2 2 2 distinct colors (the color of A A A and the common color of B , D B, D B , D ). Thus, C C C has 4 − 2 = 2 4 - 2 = 2 4 − 2 = 2 choices.
Color for E E E : Region E E E is adjacent to A , B , D A, B, D A , B , D . Similarly, E E E has 4 − 2 = 2 4 - 2 = 2 4 − 2 = 2 choices.
Number of ways for Case 1: N 1 = 3 × 1 × 2 × 2 = 12 N_1 = 3 \times 1 \times 2 \times 2 = 12 N 1 = 3 × 1 × 2 × 2 = 12 ways.
Case 2: Regions B B B and D D D have DIFFERENT colors.
Select color for B B B : 3 3 3 choices (excluding A A A 's color).
Select color for D D D : D D D cannot use A A A 's color nor B B B 's color, leaving 4 − 2 = 2 4 - 2 = 2 4 − 2 = 2 choices.
Color for C C C : Region C C C is adjacent to A , B , D A, B, D A , B , D . Since A , B , D A, B, D A , B , D all have mutually distinct colors, 3 3 3 colors are used up. C C C has 4 − 3 = 1 4 - 3 = 1 4 − 3 = 1 choice.
Color for E E E : Region E E E is adjacent to A , B , D A, B, D A , B , D . Since A , B , D A, B, D A , B , D have distinct colors, E E E has 4 − 3 = 1 4 - 3 = 1 4 − 3 = 1 choice.
Number of ways for Case 2: N 2 = 3 × 2 × 1 × 1 = 6 N_2 = 3 \times 2 \times 1 \times 1 = 6 N 2 = 3 × 2 × 1 × 1 = 6 ways.
Step 4: Combine Cases and Multiply by A A A 's choices. The sub-total choices for regions ( B , C , D , E ) (B, C, D, E) ( B , C , D , E ) is N 1 + N 2 = 12 + 6 = 18 N_1 + N_2 = 12 + 6 = 18 N 1 + N 2 = 12 + 6 = 18 .
Multiplying by the choices for region A A A : N total = 4 × ( 12 + 6 ) = 4 × 18 = 72 N_{\text{total}} = 4 \times (12 + 6) = 4 \times 18 = 72 N total = 4 × ( 12 + 6 ) = 4 × 18 = 72
Worked Example 2: Constrained Digit Composition
Problem Statement: Using the digits { 0 , 1 , 2 , 3 , 4 , 5 } \{0, 1, 2, 3, 4, 5\} { 0 , 1 , 2 , 3 , 4 , 5 } , how many 4-digit even numbers without repeated digits can be formed?
Detailed Mathematical Solution:
Step 1: Identify Constraints.
A 4-digit number cannot have 0 0 0 in the thousands place (thousands digit ≠ 0 \neq 0 = 0 ).
An even number must have an even units digit ( 0 , 2 , 0, 2, 0 , 2 , or 4 4 4 ).
Digits cannot be repeated (without replacement).
Step 2: Classify based on the Units Digit. Since 0 0 0 affects both the thousands place constraint and the even units place constraint, we split into two mutually exclusive cases depending on whether the units digit is 0 0 0 or non-zero even ( 2 2 2 or 4 4 4 ).
Case 1: The units digit is 0 0 0 .
Units digit: 1 1 1 choice (digit 0 0 0 ).
Thousands digit: Can be any of { 1 , 2 , 3 , 4 , 5 } \{1, 2, 3, 4, 5\} { 1 , 2 , 3 , 4 , 5 } , so 5 5 5 choices.
Hundreds digit: Select from the remaining 4 4 4 digits, so 4 4 4 choices.
Tens digit: Select from the remaining 3 3 3 digits, so 3 3 3 choices.
Number of ways for Case 1: N 1 = 1 × 5 × 4 × 3 = 60 N_1 = 1 \times 5 \times 4 \times 3 = 60 N 1 = 1 × 5 × 4 × 3 = 60
Case 2: The units digit is 2 2 2 or 4 4 4 .
Units digit: 2 2 2 choices (either 2 2 2 or 4 4 4 ).
Thousands digit: Must not be 0 0 0 and must not be the units digit chosen. Out of 6 6 6 digits, excluding 0 0 0 and the chosen units digit leaves 6 − 2 = 4 6 - 2 = 4 6 − 2 = 4 choices.
Hundreds digit: Can now include 0 0 0 , excluding the thousands and units digits. Remaining choices: 6 − 2 = 4 6 - 2 = 4 6 − 2 = 4 choices.
Tens digit: Remaining choices: 6 − 3 = 3 6 - 3 = 3 6 − 3 = 3 choices.
Number of ways for Case 2: N 2 = 2 × 4 × 4 × 3 = 96 N_2 = 2 \times 4 \times 4 \times 3 = 96 N 2 = 2 × 4 × 4 × 3 = 96
Step 3: Apply the Addition Principle. N total = N 1 + N 2 = 60 + 96 = 156 N_{\text{total}} = N_1 + N_2 = 60 + 96 = 156 N total = N 1 + N 2 = 60 + 96 = 156