阶乘记号与计算方法：A-Level数学基础 | Factorial Notation and Calculation Methods: A-Level Maths Basics

阶乘记号与计算方法：A-Level数学基础

一、什么是阶乘记号？定义与基本规则 | What is Factorial Notation? Definition and Basic Rules

阶乘是数学中一种重要的运算记号，表示从 1 到某个正整数 n 的所有整数的连乘积。例如 5! = 5×4×3×2×1 = 120。感叹号读作"阶乘"，在排列组合、概率论和二项式定理中反复出现。理解它的定义是掌握后续所有计算技巧的第一步，也是 A-Level 纯数学部分每年必考的基础知识点。无论是剑桥、爱德思还是 AQA 的试卷，阶乘题都稳定出现在统计或纯数部分，分值虽不大但出现频率极高，属于必须拿满的基础分。

Factorial notation is one of the most frequently used symbols in A-Level mathematics. For a positive integer n, the factorial n! is defined as the product of all integers from 1 up to n. For example, 5! = 5 × 4 × 3 × 2 × 1 = 120. The exclamation mark is read as "factorial". The definition may look simple, but the notation appears constantly in permutations, combinations, probability, and the binomial theorem, so fluency with it saves time across the whole pure mathematics syllabus.

二、0! 为什么等于 1？一个重要的约定 | Why Is 0! Equal to 1? An Important Convention

很多同学第一次看到 0! = 1 都会感到困惑。0! 并不是按定义直接乘出来的，而是一个人为约定的结果，目的是让公式保持一致。例如在组合数公式中 nC0 = n!/(0!×n!) 必须等于 1，因为从 n 个物品中选 0 个只有 1 种方式，只有规定 0! = 1 才能得到这个合理结论。同时，递推关系 n! = n×(n-1)! 在 n = 1 时给出 1! = 1×0!，同样要求 0! = 1。

Many students are puzzled when they first meet the statement 0! = 1. Unlike other factorials, this value is not obtained by direct multiplication; it is a convention chosen so that formulas remain consistent. In the combination formula, nC0 = n!/(0! × n!) must equal 1 because there is exactly one way to choose nothing from n objects, and this only works if 0! = 1. The recurrence relation n! = n × (n-1)! forces the same value: substituting n = 1 gives 1! = 1 × 0!, so 0! must be 1.

三、阶乘的递推关系：n! = n×(n-1)! | The Recurrence Relation: n! = n×(n-1)!

阶乘最重要的性质是递推关系 n! = n×(n-1)!，意思是每个阶乘都可以由前一个阶乘推出：6! = 6×5!，而 5! 又等于 5×4!，依此类推。考试中化简分式经常用到这个关系，例如 (n+1)!/n! = n+1。递推关系还常用来证明与阶乘有关的恒等式，也是解含未知数阶乘方程的核心工具，掌握它可以省去大量重复计算。

The most important property of factorials is the recurrence relation n! = n × (n-1)!, which states that every factorial can be built from the previous one: 6! = 6 × 5!, and 5! = 5 × 4!, and so on. This relation is the key to simplifying fractions such as (n+1)!/n! = n+1. It is also the standard tool for proving identities involving factorials and for solving equations that contain an unknown factorial. Whenever you see a ratio of factorials, expand the larger one using the recurrence until common factors appear. This single habit removes most of the arithmetic burden from factorial questions and is the difference between a quick solution and a long, error-prone calculation.

四、阶乘分式的化简技巧：先展开再约分 | Simplification Techniques: Expand Then Cancel

处理阶乘分式时，不要先把两个阶乘分别算出来，而要先展开并约分。例如 10!/7! = 10×9×8 = 720。更一般地，n!/(n-k)! 是恰好 k 个连续整数的乘积：n×(n-1)×...×(n-k+1)。如果分子分母都有阶乘，比如 8!/(5!×3!)，先把 8! 展开成 8×7×6×5!，与分母的 5! 约去，再算 8×7×6/6 = 56。这种先展开后约分的策略能显著减少计算量，也降低出错概率。

When simplifying factorial fractions, never evaluate the two factorials separately; expand the larger one and cancel instead. For example, 10!/7! = 10 × 9 × 8 = 720, because the 7! cancels completely. In general, n!/(n-k)! is a product of exactly k consecutive terms: n × (n-1) × ... × (n-k+1). When both numerator and denominator contain factorials, such as 8!/(5! × 3!), expand 8! as 8 × 7 × 6 × 5!, cancel the 5!, and finish with 8 × 7 × 6 / 6 = 56. Expand first, cancel second, and only multiply at the very end.

五、排列数 nPr：阶乘与顺序有关 | Permutations nPr: Factorials and Order

排列数 nPr 表示从 n 个不同元素中按顺序取出 r 个元素的排列方式总数，公式为 nPr = n!/(n-r)!。例如从 5 本书中选 3 本排成一列，共有 5P3 = 5!/2! = 60 种排法。排列强调顺序：同样三本书，顺序不同就是不同的排列。当 r = n 时，nPn = n!，即 n 个元素的全部排列数，这也是阶乘记号最常见的应用场景，考试中常以排列计数题的形式出现。实际题目中要注意区分"排成一排"和"选出一组"两种表述，前者用排列后者用组合，读题时先把关键词圈出来就能避免用错公式。

The permutation symbol nPr counts the number of ordered arrangements of r objects chosen from n distinct objects, with the formula nPr = n!/(n-r)!. For instance, arranging 3 books chosen from 5 on a shelf gives 5P3 = 5!/2! = 5 × 4 × 3 = 60 different orders. The key idea is order: the same three books in a different sequence count as a different permutation. When r = n, we obtain nPn = n!, the number of ways to arrange all n objects, which is exactly why factorial notation is so closely tied to counting arrangements.

六、组合数 nCr：阶乘与选择无关顺序 | Combinations nCr: Factorials Without Order

组合数 nCr 表示从 n 个不同元素中选出 r 个元素的组合总数，公式为 nCr = n!/(r!×(n-r)!)。与排列不同，组合不关心顺序：从 5 人中选 3 人组成委员会，无论按什么顺序选出都是同一种组合，所以 5C3 = 5!/(3!×2!) = 10。组合数与排列数之间有关系 nPr = r!×nCr，因为每种组合内部的 r! 种排列被合并为一种。组合数也常写作 C(n,r)，正是二项式系数。

The combination symbol nCr counts the number of ways to choose r objects from n distinct objects without regard to order, given by nCr = n!/(r! × (n-r)!). Selecting 3 people from 5 to form a committee gives 5C3 = 5!/(3! × 2!) = 10, because the order of selection does not matter. The connection between the two symbols is nPr = r! × nCr: each unordered combination contains r! possible orderings, so dividing permutations by r! converts them into combinations. Combinations are also written as C(n,r) and are exactly the binomial coefficients.

七、阶乘在二项式定理中的应用 | Factorials in the Binomial Theorem

二项式定理把 (a+b)^n 展开成 n+1 项之和，其中每一项的系数就是组合数 nCr。例如 (a+b)^4 = a^4 + 4a^3b + 6a^2b^2 + 4ab^3 + b^4，系数 1、4、6、4、1 正好是 4C0 到 4C4，构成杨辉三角的第四行。通项公式为 T(r+1) = nCr×a^(n-r)×b^r。考试常考求展开式中指定项的系数，方法是先写出通项，令所需指数等于目标值解出 r，再代回计算。

The binomial theorem expands (a+b)^n as a sum of n+1 terms, and the coefficient of each term is precisely a combination number. For example, (a+b)^4 = a^4 + 4a^3b + 6a^2b^2 + 4ab^3 + b^4, where the coefficients 1, 4, 6, 4, 1 are 4C0 through 4C4, the fourth row of Pascal's triangle. The general term is T(r+1) = nCr × a^(n-r) × b^r. A standard exam question asks for the coefficient of a specific power such as x^3; the method is to write down the general term, set the required exponent equal to the target value, solve for r, and substitute back.

八、用计算器和编程计算阶乘 | Computing Factorials with Calculators and Code

A-Level 考试允许使用图形计算器，绝大多数型号都内置阶乘功能，通常通过 MATH 菜单中的感叹号键或概率子菜单调用。计算 12! 这类大数时直接用计算器又快又准，但考试中更常见的是计算 nPr 与 nCr，这时可以直接使用计算器上的排列组合专用键。用 Python 等编程语言计算阶乘同样简单，可以用循环或 math.factorial 函数。需要注意的是阶乘增长极快，20! 已接近 2.43×10^18，超过 32 位整数范围，编程时要用大整数类型。

A-Level examinations permit graphical calculators, and nearly every model has a built-in factorial function, usually accessed through the MATH menu or the probability submenu. Typing 12! directly into the calculator is fast and reliable, but in exams you will more often need nPr and nCr, which have their own dedicated keys. In programming, a factorial is a natural exercise for loops, and Python's math.factorial handles it in a single call. One caution: factorials grow extremely quickly. The value of 20! is close to 2.43 × 10^18, which already exceeds the range of 32-bit integers, so languages with fixed-width integers need a big-integer type.

九、大数阶乘的近似：斯特林公式 | Stirling's Approximation for Large Factorials

当 n 很大时，直接计算 n! 既不现实也没有必要，这时可以用斯特林公式近似：n! ≈ √(2πn)×(n/e)^n。这个公式的误差随 n 增大而迅速缩小，n = 10 时相对误差已不足 1%。在统计与概率的后续学习中，斯特林公式还用于推导正态分布和泊松分布等结论。A-Level 阶段一般只需要知道它的存在和大致形式，理解阶乘可以用指数型公式近似这一思想即可，不必深入推导。

When n is large, computing n! directly is neither practical nor necessary, and Stirling's approximation provides the standard shortcut: n! is approximately √(2πn) × (n/e)^n. The relative error shrinks quickly as n grows, dropping below 1% by n = 10. The approximation is more than a curiosity: it underpins derivations of the normal and Poisson distributions in statistics, and it appears whenever the growth rates of large factorials are compared. At A-Level, you only need to recognise the formula and appreciate the idea that a factorial can be approximated by an exponential-type expression.

十、阶乘运算的常见错误与考试技巧 | Common Mistakes and Exam Tips

阶乘题目的失分点非常集中。第一，忘记 0! = 1，把它当成 0 来计算；第二，把 (n+1)! 错写成 n! + 1；第三，误以为 (ab)! = a!b!，实际上阶乘对乘法没有分配律；第四，计算 n!/(n-2)! 时展开项数出错，正确结果是 n(n-1)。考试技巧方面：遇到分式先约分再相乘；含未知数 n 的阶乘方程先把阶乘展开成多项式再解；最后养成用计算器验算 nPr 与 nCr 结果的习惯，能有效避免粗心失分。

Mistakes with factorials cluster around a few well-known traps. Students forget that 0! = 1 and treat it as 0; they rewrite (n+1)! as n! + 1; they assume (ab)! equals a!b!, although factorials do not distribute over multiplication; and they expand n!/(n-2)! incorrectly, where the correct result is simply n(n-1). For exam technique, always cancel before multiplying, expand factorial equations containing an unknown n into polynomials using the recurrence relation, and finish by checking nPr and nCr answers on the calculator. These habits turn the most common factorial errors into easy marks.

十一、阶乘方程与不等式的解法 | Solving Factorial Equations and Inequalities

含阶乘的方程是 A-Level 考试中的常见题型。解这类方程的核心思路是把较大的阶乘按递推关系展开，直到能与较小的阶乘约分。例如方程 (n+1)!/(n-1)! = 20，左边展开为 (n+1)n(n-1)!/(n-1)! = (n+1)n，于是问题转化为解二次方程 n(n+1) = 20，即 n^2 + n - 20 = 0，解得 n = 4 或 n = -5，由于 n 必须为正整数，最终答案是 n = 4。如果题目给出不等式，比如 n! < 50，只需从小到大逐个试验：1! = 1，2! = 2，3! = 6，4! = 24，5! = 120，因此满足条件的最大整数是 4。逐个代入是处理阶乘不等式最稳妥的方法。

Equations containing factorials are a common question type in A-Level examinations. The core idea is to expand the larger factorial using the recurrence relation until cancellation with the smaller one is possible. For example, in the equation (n+1)!/(n-1)! = 20, the left-hand side expands to (n+1)n(n-1)!/(n-1)! = (n+1)n, so the problem reduces to the quadratic equation n(n+1) = 20, that is n^2 + n - 20 = 0, which gives n = 4 or n = -5. Since n must be a positive integer, the answer is n = 4. For factorial inequalities such as n! < 50, the safest method is to test values one by one: 1! = 1, 2! = 2, 3! = 6, 4! = 24, 5! = 120, so the largest integer that works is 4. Substitution by trial is the most reliable approach for factorial inequalities.

十二、阶乘在概率与计数中的应用 | Factorials in Probability and Counting

阶乘在概率计算中同样扮演关键角色。当所有结果等可能时，古典概率等于有利结果数除以总结果数，而这两个数常常用排列组合来计数。例如把单词 FACTOR 的 7 个字母全部排列，总数为 7! = 5040 种；如果要求首字母必须是 F，则剩下 6 个字母任意排列，有利结果数为 6! = 720，所以概率为 720/5040 = 1/7。再如从一副扑克牌中任取 5 张，总数为 52C5，要计算其中恰好有 2 张 A 的概率，需要分别计算选 A 的方式 4C2 与选其他牌的方式 48C3。这些例子说明，把实际问题翻译成阶乘表达式是解题的第一步。

Factorials also play a key role in probability calculations. When all outcomes are equally likely, the classical probability equals the number of favourable outcomes divided by the total number of outcomes, and both quantities are often counted with permutations and combinations. For example, arranging all 7 letters of the word FACTOR gives 7! = 5040 total arrangements; if the first letter must be F, the remaining 6 letters can be arranged in 6! = 720 ways, so the probability is 720/5040 = 1/7. As another example, drawing 5 cards from a standard deck gives 52C5 possible hands; to find the probability of exactly 2 aces, count the ways to choose the aces, 4C2, and the ways to choose the other cards, 48C3. These examples show that translating a real problem into factorial expressions is the first step of the solution. With practice, this translation becomes automatic, and probability questions stop looking like a new challenge and start looking like familiar counting problems.

需要专业A-Level辅导？
16621398022
同微信 | 免费咨询课程规划
访问 aleveler.com 了解更多

更多咨询请联系16621398022（同微信）