Study guide

14.2 Permutations and Combinations

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.2 Permutations and Combinations

Key Takeaways Explain This Topic AI

Permutations (A_n^m = n! / (n-m)!) count ordered arrangements; Combinations (C_n^m = n! / (m!(n-m)!)) count unordered selections.

Fundamental combinatorial identities include symmetry C_n^m = C_n^{n-m} and Pascal's identity C_n^m + C_n^{m-1} = C_{n+1}^m.

Core Gaokao strategies: Adjacent elements require the Bundle Method (捆绑法); Non-adjacent elements require the Gap Insertion Method (插空法); Restricted elements/positions require Priority Assignment (优先法).

Grouping and distribution problems require dividing by p! for p equal-sized unnamed groups to eliminate overcounting, followed by multiplying by k! when assigning to distinct targets.

The Stars and Bars method solves positive integer partition equations x_1 + x_2 + ... + x_k = n with x_i >= 1 yielding C_{n-1}^{k-1} solutions.

Last updated: July 2026

14.2 Permutations and Combinations

Permutations and combinations form the operational core of combinatorial counting in Gaokao Mathematics. While fundamental counting principles dictate when to add or multiply, permutation and combination formulas provide efficient algebraic tools to count ordered arrangements and unordered selections.

  • 1. Mathematical Definitions and Formulas
  • 1.1 Permutations (排列)

A permutation of n n n distinct elements taken m m m at a time ( 0 ≤ m ≤ n 0 \le m \le n 0 ≤ m ≤ n ) is an ordered arrangement of m m m elements chosen from the set of n n n elements. The total number of permutations is denoted by A n m A_n^m A n m ​ (or P ( n , m ) P(n, m) P ( n , m ) or P n m P_n^m P n m ​ ) and is calculated by: A n m = n ( n − 1 ) ( n − 2 ) ⋯ ( n − m + 1 ) = n ! ( n − m ) ! A_n^m = n(n-1)(n-2)\cdots(n-m+1) = \frac{n!}{(n-m)!} A n m ​ = n ( n − 1 ) ( n − 2 ) ⋯ ( n − m + 1 ) = ( n − m )! n ! ​

Special Cases:

When m = n m = n m = n , it represents a full permutation (全排列): A n n = n ! = n × ( n − 1 ) × ⋯ × 2 × 1 A_n^n = n! = n \times (n-1) \times \dots \times 2 \times 1 A n n ​ = n ! = n × ( n − 1 ) × ⋯ × 2 × 1 .

By definition, 0 ! = 1 0! = 1 0 ! = 1 , which ensures A n 0 = n ! n ! = 1 A_n^0 = \frac{n!}{n!} = 1 A n 0 ​ = n ! n ! ​ = 1 .

1.2 Combinations (组合)

A combination of n n n distinct elements taken m m m at a time ( 0 ≤ m ≤ n 0 \le m \le n 0 ≤ m ≤ n ) is an unordered selection of m m m elements chosen from the set of n n n elements. The total number of combinations is denoted by C n m C_n^m C n m ​ (or ( n m ) \binom{n}{m} ( m n ​ ) ) and is calculated by: C n m = A n m m ! = n ! m ! ( n − m ) ! C_n^m = \frac{A_n^m}{m!} = \frac{n!}{m!(n-m)!} C n m ​ = m ! A n m ​ ​ = m ! ( n − m )! n ! ​

1.3 Key Combinatorial Identities and Derivations

Symmetry Property (对称性): C n m = C n n − m C_n^m = C_n^{n-m} C n m ​ = C n n − m ​

Combinatorial Proof: Choosing m m m elements to include from n n n available items is logically equivalent to choosing n − m n-m n − m elements to leave behind.

Pascal's Identity / Recurrence Relation (加法公式 / 杨辉等式): C n m + C n m − 1 = C n + 1 m ( 1 ≤ m ≤ n ) C_n^m + C_n^{m-1} = C_{n+1}^m \quad (1 \le m \le n) C n m ​ + C n m − 1 ​ = C n + 1 m ​ ( 1 ≤ m ≤ n )

Combinatorial Proof: Consider a set of n + 1 n+1 n + 1 elements including a distinguished element x x x . To choose m m m elements from n + 1 n+1 n + 1 elements, split into two mutually exclusive cases:

Case 1: Element x x x is included. We must choose the remaining m − 1 m-1 m − 1 elements from the other n n n elements ⟹ C n m − 1 \implies C_n^{m-1} ⟹ C n m − 1 ​ ways.

Case 2: Element x x x is excluded. We must choose all m m m elements from the remaining n n n elements ⟹ C n m \implies C_n^m ⟹ C n m ​ ways.

Adding the two cases gives C n m + C n m − 1 = C n + 1 m C_n^m + C_n^{m-1} = C_{n+1}^m C n m ​ + C n m − 1 ​ = C n + 1 m ​ .

Absorption / Reduction Identity: k C n k = n C n − 1 k − 1 ⟹ C n k = n k C n − 1 k − 1 k C_n^k = n C_{n-1}^{k-1} \implies C_n^k = \frac{n}{k} C_{n-1}^{k-1} k C n k ​ = n C n − 1 k − 1 ​ ⟹ C n k ​ = k n ​ C n − 1 k − 1 ​

Combinatorial Proof: Selecting a committee of k k k people from n n n people and designating 1 leader is equivalent to picking the leader first ( n n n choices) and then picking the remaining k − 1 k-1 k − 1 members from n − 1 n-1 n − 1 people ( C n − 1 k − 1 C_{n-1}^{k-1} C n − 1 k − 1 ​ choices).

Sum of Combinations (Total Subsets): ∑ k = 0 n C n k = C n 0 + C n 1 + C n 2 + ⋯ + C n n = 2 n \sum_{k=0}^n C_n^k = C_n^0 + C_n^1 + C_n^2 + \dots + C_n^n = 2^n k = 0 ∑ n ​ C n k ​ = C n 0 ​ + C n 1 ​ + C n 2 ​ + ⋯ + C n n ​ = 2 n

Loading diagram... Taxonomy of Permutation and Combination Strategies

2. Standard Problem-Solving Strategies for Constrained Counting

Gaokao permutation and combination problems frequently introduce spatial, positional, or structural constraints. Five canonical methods govern these problems:

2.1 The Bundle Method for Adjacent Elements (捆绑法)

Applicability: Used when specified elements must be adjacent (必须相邻). Procedure:

Treat the constrained adjacent elements as a single "bundled super-element".

Arrange the super-element along with all remaining unconstrained elements.

Multiply by the internal permutations of the elements within the bundle.

Formula Structure: If k k k elements out of n n n must be adjacent, total arrangements equal: N = A n − k + 1 n − k + 1 × A k k = ( n − k + 1 ) ! × k ! N = A_{n-k+1}^{n-k+1} \times A_k^k = (n-k+1)! \times k! N = A n − k + 1 n − k + 1 ​ × A k k ​ = ( n − k + 1 )! × k !

2.2 The Gap Insertion Method for Non-Adjacent Elements (插空法)

Applicability: Used when specified elements cannot be adjacent (不能相邻). Procedure:

Arrange all unconstrained elements first, creating m + 1 m+1 m + 1 available "gaps" (including the two ends) around m m m arranged items.

Insert the k k k constrained non-adjacent elements into the available gaps ( k ≤ m + 1 k \le m+1 k ≤ m + 1 ).

Formula Structure: N = A m m × A m + 1 k = m ! × ( m + 1 ) ! ( m + 1 − k ) ! N = A_m^m \times A_{m+1}^k = m! \times \frac{(m+1)!}{(m+1-k)!} N = A m m ​ × A m + 1 k ​ = m ! × ( m + 1 − k )! ( m + 1 )! ​

2.3 Priority Assignment for Restricted Positions/Elements (优先法)

Applicability: Used when specific elements must occupy (or avoid) specific positions. Procedure: First satisfy the strict spatial/elemental constraints before arranging or selecting the remaining unrestricted items.

2.4 Grouping and Distribution Strategies (分组与分配问题)

Dividing n n n distinct objects into k k k groups is a core Gaokao topic:

Unequal Unnamed Grouping (不均匀分组): Dividing n n n objects into groups of sizes m 1 , m 2 , … , m k m_1, m_2, \dots, m_k m 1 ​ , m 2 ​ , … , m k ​ (where all m i m_i m i ​ are distinct and ∑ m i = n \sum m_i = n ∑ m i ​ = n ): N = C n m 1 × C n − m 1 m 2 × ⋯ × C m k m k N = C_n^{m_1} \times C_{n-m_1}^{m_2} \times \dots \times C_{m_k}^{m_k} N = C n m 1 ​ ​ × C n − m 1 ​ m 2 ​ ​ × ⋯ × C m k ​ m k ​ ​

Equal Unnamed Grouping (均匀分组): Dividing n n n objects into p p p groups of equal size m m m ( n = p × m n = p \times m n = p × m ). Since the groups are unnamed and identical in size, multiplying combinations overcounts by the p ! p! p ! permutations of the groups themselves: N = C n m × C n − m m × ⋯ × C m m p ! N = \frac{C_n^m \times C_{n-m}^m \times \dots \times C_m^m}{p!} N = p ! C n m ​ × C n − m m ​ × ⋯ × C m m ​ ​

Distribution to Named Targets (定向分配): If the groups are subsequently assigned to p p p distinct entities (e.g., p p p different schools or cities), multiply the grouping count by p ! p! p ! : N named distribution = N grouping × p ! N_{\text{named distribution}} = N_{\text{grouping}} \times p! N named distribution ​ = N grouping ​ × p !

2.5 The Stars and Bars Method (隔板法)

Applicability: Finding the number of positive integer solutions to x 1 + x 2 + ⋯ + x k = n x_1 + x_2 + \dots + x_k = n x 1 ​ + x 2 ​ + ⋯ + x k ​ = n where x i ≥ 1 x_i \ge 1 x i ​ ≥ 1 . Procedure: Place n n n identical items in a line, creating n − 1 n-1 n − 1 spaces between them. Insert k − 1 k-1 k − 1 dividers (bars) into these n − 1 n-1 n − 1 spaces. Formula: N = C n − 1 k − 1 N = C_{n-1}^{k-1} N = C n − 1 k − 1 ​

If x i ≥ 0 x_i \ge 0 x i ​ ≥ 0 (non-negative integer solutions), substitute y i = x i + 1 ⟹ y 1 + y 2 + ⋯ + y k = n + k y_i = x_i + 1 \implies y_1 + y_2 + \dots + y_k = n + k y i ​ = x i ​ + 1 ⟹ y 1 ​ + y 2 ​ + ⋯ + y k ​ = n + k with y i ≥ 1 y_i \ge 1 y i ​ ≥ 1 : N = C n + k − 1 k − 1 N = C_{n+k-1}^{k-1} N = C n + k − 1 k − 1 ​

  • 3. Classic Gaokao Worked Examples and Solutions
  • Worked Example 1: Combined Adjacent and Non-Adjacent Restrictions

Problem Statement: Seven students A , B , C , D , E , F , G A, B, C, D, E, F, G A , B , C , D , E , F , G stand in a single line for a photo. Calculate the number of valid line-up arrangements under the following simultaneous conditions:

Students A A A and B B B must stand adjacent to each other.

Students C C C and D D D cannot stand adjacent to each other.

Detailed Mathematical Solution:

Step 1: Bundle the adjacent students A A A and B B B . Treat ( A , B ) (A, B) ( A , B ) as a single bundled block X X X . Inside block X X X , A A A and B B B can be arranged in A 2 2 = 2 ! = 2 A_2^2 = 2! = 2 A 2 2 ​ = 2 ! = 2 ways.

Step 2: Identify the remaining unconstrained entities. The entities to be arranged first (excluding C C C and D D D ) are block X X X , student E E E , student F F F , and student G G G . This gives 4 4 4 items in total.

Step 3: Arrange the unconstrained entities to form gaps for C C C and D D D . Arranging these 4 4 4 items ( X , E , F , G X, E, F, G X , E , F , G ) in a row can be done in: A 4 4 = 4 ! = 24 ways A_4^4 = 4! = 24 \text{ ways} A 4 4 ​ = 4 ! = 24 ways

Step 4: Count available gaps for C C C and D D D . Arranging 4 4 4 items creates 4 + 1 = 5 4 + 1 = 5 4 + 1 = 5 available gaps (including both ends): ‾ Item 1 ‾ Item 2 ‾ Item 3 ‾ Item 4 ‾ \underline{\quad} \, \text{Item}_1 \, \underline{\quad} \, \text{Item}_2 \, \underline{\quad} \, \text{Item}_3 \, \underline{\quad} \, \text{Item}_4 \, \underline{\quad} ​ Item 1 ​ ​ Item 2 ​ ​ Item 3 ​ ​ Item 4 ​ ​

Step 5: Insert non-adjacent students C C C and D D D into the gaps. We choose 2 2 2 distinct gaps out of 5 5 5 for C C C and D D D in order: A 5 2 = 5 × 4 = 20 ways A_5^2 = 5 \times 4 = 20 \text{ ways} A 5 2 ​ = 5 × 4 = 20 ways

Step 6: Multiply all stage counts using the Multiplication Principle. N total = A 2 2 × A 4 4 × A 5 2 = 2 × 24 × 20 = 960 N_{\text{total}} = A_2^2 \times A_4^4 \times A_5^2 = 2 \times 24 \times 20 = 960 N total ​ = A 2 2 ​ × A 4 4 ​ × A 5 2 ​ = 2 × 24 × 20 = 960

Worked Example 2: Grouping and Assigned Distribution

Problem Statement: Six distinct volunteer teachers are to be assigned to 3 3 3 different rural schools ( S 1 , S 2 , S 3 S_1, S_2, S_3 S 1 ​ , S 2 ​ , S 3 ​ ) such that each school receives at least 1 1 1 teacher. How many different distribution schemes are possible?

Detailed Mathematical Solution:

Step 1: Analyze integer partitions of 6 6 6 into 3 3 3 positive parts. The number of teachers 6 6 6 can be partitioned into 3 3 3 positive integer parts in three distinct ways:

  • Pattern 1: Group sizes ( 4 , 1 , 1 ) (4, 1, 1) ( 4 , 1 , 1 )
  • Pattern 2: Group sizes ( 3 , 2 , 1 ) (3, 2, 1) ( 3 , 2 , 1 )
  • Pattern 3: Group sizes ( 2 , 2 , 2 ) (2, 2, 2) ( 2 , 2 , 2 )

Case 1: Grouping pattern ( 4 , 1 , 1 ) (4, 1, 1) ( 4 , 1 , 1 ) .

Unnamed Grouping: Since two groups have equal size ( 1 , 1 1, 1 1 , 1 ), divide by 2 ! 2! 2 ! : N group , 1 = C 6 4 × C 2 1 × C 1 1 2 ! = 15 × 2 × 1 2 = 15 N_{\text{group}, 1} = \frac{C_6^4 \times C_2^1 \times C_1^1}{2!} = \frac{15 \times 2 \times 1}{2} = 15 N group , 1 ​ = 2 ! C 6 4 ​ × C 2 1 ​ × C 1 1 ​ ​ = 2 15 × 2 × 1 ​ = 15

Distribution to 3 3 3 distinct schools: Multiply by 3 ! 3! 3 ! : N dist , 1 = 15 × 3 ! = 15 × 6 = 90 N_{\text{dist}, 1} = 15 \times 3! = 15 \times 6 = 90 N dist , 1 ​ = 15 × 3 ! = 15 × 6 = 90

Case 2: Grouping pattern ( 3 , 2 , 1 ) (3, 2, 1) ( 3 , 2 , 1 ) .

Unnamed Grouping: All group sizes are distinct ( 3 , 2 , 1 3, 2, 1 3 , 2 , 1 ), no division required: N group , 2 = C 6 3 × C 3 2 × C 1 1 = 20 × 3 × 1 = 60 N_{\text{group}, 2} = C_6^3 \times C_3^2 \times C_1^1 = 20 \times 3 \times 1 = 60 N group , 2 ​ = C 6 3 ​ × C 3 2 ​ × C 1 1 ​ = 20 × 3 × 1 = 60

Distribution to 3 3 3 distinct schools: Multiply by 3 ! 3! 3 ! : N dist , 2 = 60 × 3 ! = 60 × 6 = 360 N_{\text{dist}, 2} = 60 \times 3! = 60 \times 6 = 360 N dist , 2 ​ = 60 × 3 ! = 60 × 6 = 360

Case 3: Grouping pattern ( 2 , 2 , 2 ) (2, 2, 2) ( 2 , 2 , 2 ) .

Unnamed Grouping: All three groups have equal size ( 2 , 2 , 2 2, 2, 2 2 , 2 , 2 ), divide by 3 ! 3! 3 ! : N group , 3 = C 6 2 × C 4 2 × C 2 2 3 ! = 15 × 6 × 1 6 = 15 N_{\text{group}, 3} = \frac{C_6^2 \times C_4^2 \times C_2^2}{3!} = \frac{15 \times 6 \times 1}{6} = 15 N group , 3 ​ = 3 ! C 6 2 ​ × C 4 2 ​ × C 2 2 ​ ​ = 6 15 × 6 × 1 ​ = 15

Distribution to 3 3 3 distinct schools: Multiply by 3 ! 3! 3 ! : N dist , 3 = 15 × 3 ! = 15 × 6 = 90 N_{\text{dist}, 3} = 15 \times 3! = 15 \times 6 = 90 N dist , 3 ​ = 15 × 3 ! = 15 × 6 = 90

Step 2: Sum all cases using the Addition Principle. N total = N dist , 1 + N dist , 2 + N dist , 3 = 90 + 360 + 90 = 540 N_{\text{total}} = N_{\text{dist}, 1} + N_{\text{dist}, 2} + N_{\text{dist}, 3} = 90 + 360 + 90 = 540 N total ​ = N dist , 1 ​ + N dist , 2 ​ + N dist , 3 ​ = 90 + 360 + 90 = 540