Factorial Notation and Calculation Methods | 阶乘记号与计算方法

📚 Factorial Notation and Calculation Methods | 阶乘记号与计算方法

Factorials are a cornerstone of mathematics, playing a vital role in combinatorics, calculus, probability, and number theory. The factorial of a non-negative integer n, written as n!, is the product of all positive integers from 1 to n. This compact notation simplifies many complex expressions and is essential for solving problems involving permutations, combinations, and series expansions.

阶乘是数学的基石之一，在组合数学、微积分、概率论和数论中扮演着重要角色。非负整数 n 的阶乘，记为 n!，是从 1 到 n 的所有正整数的乘积。这种简洁的记号简化了许多复杂的表达式，对于解决涉及排列、组合和级数展开的问题至关重要。

1. Definition and Notation | 定义与记号

The factorial of a non-negative integer n is formally defined as: n! = n × (n−1) × (n−2) × … × 2 × 1, with the special case 0! = 1. The symbol ‘!’ is placed after the number, for example, 5! = 5 × 4 × 3 × 2 × 1 = 120. This notation was first introduced by Christian Kramp in 1808, and it has since become a standard tool in mathematical writing.

非负整数 n 的阶乘正式定义为：n! = n × (n−1) × (n−2) × … × 2 × 1，特殊情况 0! = 1。符号“!”放置在数字之后，例如，5! = 5 × 4 × 3 × 2 × 1 = 120。这一记号由 Christian Kramp 于 1808 年首次引入，此后成为数学写作中的标准工具。

n! = n × (n−1) × … × 2 × 1, with 0! = 1

It is crucial to understand that n must be a non-negative integer. Factorials of negative numbers and non-integer values are not defined in the elementary context, though extensions exist through the gamma function for real and complex numbers.

关键在于 n 必须是非负整数。在基础情境中，负数和非整数的阶乘没有定义，尽管可以通过伽马函数推广到实数和复数范围。

2. Fundamental Properties | 基本性质

Several key properties make factorials powerful. First, the recursive relation (n+1)! = (n+1) × n! holds for all n ≥ 0, which allows for efficient computation and simplification. Second, 0! is defined as 1, which is not immediately intuitive but is necessary for consistency in formulas.

几个关键性质使阶乘非常有用。首先，递推关系 (n+1)! = (n+1) × n! 对所有 n ≥ 0 成立，这允许高效计算和简化。其次，0! 定义为 1，虽然不完全直观，但为了公式的一致性必不可少。

Identity: 0! = 1 is a convention that simplifies formulas such as combinations when r = n.
Growth: n! grows extremely fast, faster than exponential functions like 2ⁿ.
Divisibility: n! is divisible by every integer from 1 to n, making it a common tool in number theory.

恒等式：0! = 1 是一种约定，简化了如 r = n 时的组合公式。
增长性：n! 增长极快，快于指数函数如 2ⁿ。
整除性：n! 能被从 1 到 n 的所有整数整除，这使其成为数论中的常用工具。

These properties are not merely theoretical; they form the basis for simplifying factorial expressions in equations, especially when dealing with ratios like n!/(n−k)!.

这些性质不仅仅是理论上的，它们构成了简化方程中阶乘表达式的基础，特别是在处理如 n!/(n−k)! 的比例时。

3. Basic Calculation Methods | 基本计算方法

The most straightforward method is direct multiplication. To compute n!, we multiply all integers from 1 up to n. For example, 6! = 6 × 5 × 4 × 3 × 2 × 1 = 720. This brute-force approach works well for small values of n, typically n ≤ 20, but becomes inefficient for larger values.

最直接的方法是连乘。要计算 n!，我们将从 1 到 n 的所有整数相乘。例如，6! = 6 × 5 × 4 × 3 × 2 × 1 = 720。这种暴力方法适用于小数值，通常 n ≤ 20，但对更大的值效率不高。

For programming, a simple loop or recursion is often used. The iterative method initializes a result variable to 1 and multiplies it by each integer up to n. The recursive method relies on the defining recurrence, with a base case of 0! = 1.

在编程中，常使用简单循环或递归。迭代方法将结果变量初始化为 1，然后乘以从 1 到 n 的每个整数。递归方法依赖定义中的递推关系，基准情况为 0! = 1。

Algorithm: result = 1; for i = 1 to n: result = result × i

In practice, calculators and software use lookup tables for small n and advanced algorithms for larger n, but the core principle remains the same. For educational purposes, understanding direct multiplication is essential because it clarifies the meaning of the notation.

在实践中，计算器和软件对小 n 使用查找表，对较大 n 使用高级算法，但核心原理保持不变。在教育场景中，理解直接连乘至关重要，因为它阐明了记号的含义。

4. Recursive Computation | 递归计算

Recursion is a natural way to define and compute factorials. The recurrence relation n! = n × (n−1)! allows us to break down the problem into smaller subproblems. For instance, 5! = 5 × 4!, and 4! = 4 × 3!, continuing until we reach the base case 0! = 1.

递归是定义和计算阶乘的自然方式。递推关系 n! = n × (n−1)! 允许我们将问题分解为更小的子问题。例如，5! = 5 × 4!，而 4! = 4 × 3!，一直持续到达到基准情况 0! = 1。

Recursive definition: f(0)=1; f(n)=n×f(n−1) for n>0

Recursion is elegant and directly mirrors the mathematical definition, making it easy to implement in languages like Python or C++. However, it has overhead due to function calls and can cause stack overflow for large n. Therefore, iterative methods are often preferred in performance-critical applications.

递归优雅且直接反映了数学定义，使其在 Python 或 C++ 等语言中易于实现。然而，由于函数调用有开销，且对较大 n 可能导致栈溢出。因此，在性能关键的应用中，迭代方法通常更受青睐。

To illustrate, computing 4! recursively looks like: 4! → 4×3! → 4×(3×2!) → 4×(3×(2×1!)) → 4×(3×(2×(1×0!))) → 4×(3×(2×(1×1))) = 24. This step-by-step expansion is often taught to reinforce the concept.

举例来说，递归计算 4! 的过程为：4! → 4×3! → 4×(3×2!) → 4×(3×(2×1!)) → 4×(3×(2×(1×0!))) → 4×(3×(2×(1×1))) = 24。这种逐步展开常用于强化理解。

5. Approximation and Stirling’s Formula | 近似与斯特林公式

For large n, exact calculation of n! is impractical due to enormous growth. Stirling’s approximation provides a powerful tool for estimating factorials. It states that n! is approximately equal to √(2πn) × (n/e)ⁿ, where e is Euler’s number (approximately 2.71828).

对于较大的 n，由于增长过快，精确计算 n! 不切实际。斯特林近似提供了估算阶乘的有力工具。它指出 n! 近似等于 √(2πn) × (n/e)ⁿ，其中 e 是欧拉数（约为 2.71828）。

n! ≈ √(2πn) × (n/e)ⁿ

The relative error of this approximation decreases as n increases, making it invaluable in fields like statistical mechanics and probability theory. For example, when n = 100, the exact value has 158 digits, but Stirling’s formula gives a close estimate that is much easier to handle.

随着 n 增大，该近似的相对误差减小，这使其在统计力学和概率论等领域非常宝贵。例如，当 n = 100 时，精确值有 158 位数字，而斯特林公式给出容易处理的近似。

The formula can also be used to solve equations involving factorials, such as finding n if n! is given approximately. For instance, using logarithms, we can invert the approximation to estimate n. This is especially useful in complex mathematical modeling.

该公式也可用于求解涉及阶乘的方程，例如，在给定 n! 的近似值情况下查找 n。例如，使用对数，我们可以反转近似来估计 n。这在复杂数学建模中特别有用。

6. Applications in Permutations and Combinations | 排列组合中的应用

Factorials are central to counting problems. The number of permutations of n distinct objects taken r at a time is given by P(n,r) = n!/(n−r)!. This counts ordered arrangements. For example, the number of ways to arrange 3 books on a shelf out of 5 is P(5,3) = 5!/(5−3)! = 5!/2! = 60.

阶乘是计数问题的核心。从 n 个不同对象中取 r 个的排列数为 P(n,r) = n!/(n−r)!，它计算有序排列。例如，从 5 本书中选 3 本放到书架上的方法数为 P(5,3) = 5!/(5−3)! = 5!/2! = 60。

P(n,r) = n! / (n−r)! , C(n,r) = n! / [r! (n−r)!]

Combinations, which ignore order, use the formula C(n,r) = n!/[r!(n−r)!]. For instance, C(5,2) = 5!/(2!×3!) = 10, representing the number of ways to choose 2 items from 5. These formulas appear everywhere in probability puzzles, lottery calculations, and statistical sampling.

组合不考虑顺序，使用公式 C(n,r) = n!/[r!(n−r)!]。例如，C(5,2) = 5!/(2!×3!) = 10，代表从 5 个中选 2 个的方法数。这些公式出现在概率谜题、彩票计算和统计抽样等各个领域。

The binomial theorem also relies heavily on factorials: (a+b)ⁿ = Σ C(n,k) aⁿ⁻ᵏ bᵏ, where the coefficients are combinations. This theorem allows us to expand powers of binomials efficiently, with factorial-based coefficients forming Pascal’s triangle.

二项式定理也严重依赖阶乘：(a+b)ⁿ = Σ C(n,k) aⁿ⁻ᵏ bᵏ，其中系数是组合数。该定理允许我们高效展开二项式的幂，基于阶乘的系数形成帕斯卡三角。

7. Applications in Probability and Series | 概率与级数中的应用

In probability theory, factorials appear in the definition of expected values for Poisson and binomial distributions. The Poisson distribution has the probability mass function P(X=k) = (λᵏ e⁻ᵏ)/k!, where k! appears in the denominator. This formula models the number of events occurring in a fixed interval, such as phone calls per minute.

在概率论中，阶乘出现在泊松分布和二项分布的期望值定义中。泊松分布的概率质量函数为 P(X=k) = (λᵏ e⁻ᵏ)/k!，其中 k! 出现在分母中。该公式模拟固定时间间隔内事件发生的次数，如每分钟电话呼叫次数。

Factorials are also fundamental in Taylor series expansions. For example, eˣ = Σ xⁿ/n! for n from 0 to infinity, and sin(x) and cos(x) also involve factorial denominators. These expansions are vital in numerical analysis and physics, allowing functions to be approximated by polynomials.

阶乘在泰勒级数展开中也至关重要。例如，eˣ = Σ xⁿ/n!（n 从 0 到无穷），sin(x) 和 cos(x) 也涉及阶乘分母。这些展开在数值分析和物理学中至关重要，允许用多项式近似函数。

In combinatorics, factorial identities help solve recurrence equations. For instance, the number of derangements (permutations with no fixed point) is given by !n = n! Σ (−1)ᵏ/k!, which heavily uses factorial notation and summation.

在组合数学中，阶乘恒等式帮助解递推方程。例如，错排数（没有不动点的排列数）为 !n = n! Σ (−1)ᵏ/k!，这大量使用阶乘记号和求和。

8. Special Factorials and Extensions | 特殊阶乘与推广

While standard factorials are defined for non-negative integers, there are related concepts such as double factorial. The double factorial n!! is defined as the product of all integers from n down to 1 with the same parity. For example, 5!! = 5 × 3 × 1 = 15, and 6!! = 6 × 4 × 2 = 48.

标准阶乘定义于非负整数，但也有相关概念如双阶乘。双阶乘 n!! 定义为从 n 到 1 且与 n 具有相同奇偶性的所有整数的乘积。例如，5!! = 5 × 3 × 1 = 15，而 6!! = 6 × 4 × 2 = 48。

Another extension is the gamma function Γ(n), which generalizes factorial to real and complex numbers, with Γ(n+1) = n! for positive integers. This is crucial in advanced calculus and differential equations, allowing factorials to be used for non-integer arguments.

另一个推广是伽马函数 Γ(n)，它将阶乘推广到实数和复数，对于正整数有 Γ(n+1) = n!。这在高等微积分和微分方程中至关重要，允许阶乘用于非整数自变量。

Prime factorials, denoted n#, are the product of all primes less than or equal to n, used in number theory. For example, 5# = 2 × 3 × 5 = 30. These special forms are less common but appear in specific mathematical contexts.

质数阶乘，记为 n#，是所有小于等于 n 的质数的乘积，用于数论。例如，5# = 2 × 3 × 5 = 30。这些特殊形式虽不常见，但出现在特定数学情境中。

9. Computational Challenges and Optimization | 计算挑战与优化

As n grows, n! quickly exceeds the range of standard integer types. For instance, 20! = 2.43 × 10¹⁸, already beyond 64-bit integers. In programming, handling large factorials requires arbitrary-precision arithmetic or using logarithms to work with log(n!) instead.

随着 n 增长，n! 很快超出标准整数类型的范围。例如，20! = 2.43 × 10¹⁸，已经超过 64 位整数。在编程中，处理大阶乘需要任意精度算术或使用对数来计算 log(n!)。

A common optimization is to use the gamma function or Stirling’s approximation for rough estimates. For exact calculations, languages like Python support big integers natively, but for other languages, libraries like GMP are needed. In probability calculations, it is often better to work with log-factorials to avoid overflow.

常见优化是使用伽马函数或斯特林近似进行粗略估计。对于精确计算，Python 等语言原生支持大整数，但其他语言需要 GMP 等库。在概率计算中，通常最好使用对数阶乘以避免溢出。

To compute log(n!) efficiently, one can sum logarithms: log(n!) = log(1) + log(2) + … + log(n). This is numerically stable and widely used in statistical software. For very large n, even the sum becomes heavy, and approximation formula for log(n!) is employed.

为高效计算 log(n!)，可以求和对数：log(n!) = log(1) + log(2) + … + log(n)。这在数值上稳定，广泛用于统计软件。对于非常大的 n，即使求和也很沉重，此时会使用 log(n!) 的近似公式。

Additionally, precomputing factorials up to a certain limit and storing them in an array is a standard technique in competitive programming, trading space for speed. This is especially useful when many queries require factorial values.

此外，预计算到某个上限的阶乘并存储在数组中，是竞赛编程中的标准技术，用空间换速度。这在许多查询需要阶乘值时特别有用。

10. Examples and Practice Problems | 示例与练习

Let’s work through a few examples to solidify the concepts. First, compute 7!. Using direct multiplication: 7! = 7 × 6 × 5 × 4 × 3 × 2 × 1 = 5040. Next, simplify the expression 10!/7!. Using the property (n+1)! = (n+1)n!, we get 10!/7! = (7! × 8 × 9 × 10)/7! = 720.

让我们通过几个示例巩固概念。首先，计算 7!。使用直接连乘：7! = 7 × 6 × 5 × 4 × 3 × 2 × 1 = 5040。接着，简化表达式 10!/7!。利用性质 (n+1)! = (n+1)n!，我们得到 10!/7! = (7! × 8 × 9 × 10)/7! = 720。

Now, solve for n if n! = 120. By testing small values, 5! = 120, so n = 5. For a harder problem, find C(6,3). Using the formula, C(6,3) = 6!/(3!×3!) = 720/(6×6) = 20. These problems highlight the direct usage of factorial calculation and simplification.

现在，若 n! = 120，求 n。通过试值，5! = 120，所以 n = 5。一个更难的问题：求 C(6,3)。使用公式，C(6,3) = 6!/(3!×3!) = 720/(6×6) = 20。这些问题突出了阶乘计算和简化的直接应用。

Finally, estimate 10! using Stirling’s formula. With π ≈ 3.1416, e ≈ 2.7183, we have √(2π×10) ≈ 7.926, and (10/e)¹⁰ ≈ (3.6788)¹⁰. Calculating gives approximately 3.6 × 10⁶, while the exact value is 3,628,800, showing a small relative error.

最后，用斯特林公式估算 10!。取 π ≈ 3.1416，e ≈ 2.7183，则 √(2π×10) ≈ 7.926，(10/e)¹⁰ ≈ (3.6788)¹⁰。计算得到约 3.6 × 10⁶，而精确值为 3,628,800，显示相对误差很小。

Published by TutorHao | Mathematics Revision Series | aleveler.com

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

Factorial Notation and Calculation Methods | 阶乘记号与计算方法