📚 Edexcel AS and A Level Further Pure Mathematics 1 | Edexcel 进阶纯数学 1 知识点精讲
Further Pure Mathematics 1 (FP1) builds directly on the core A Level Mathematics syllabus, introducing advanced algebraic structures, complex numbers, matrix algebra, and formal proof techniques. This module is essential for students aiming at top universities, as it forms the intellectual bridge to university-level mathematics. In this article, we systematically break down every major topic in the Edexcel FP1 specification, providing clear explanations, worked examples, and exam-focused insights to help you master the content with confidence.
进阶纯数学 1（FP1）直接建立在 A Level 核心数学大纲之上，引入了高等代数结构、复数、矩阵代数和严谨的证明方法。对于志在顶尖大学的学生而言，这个模块至关重要，因为它构成了通往大学数学的思维桥梁。本文将系统地拆解 Edexcel FP1 考纲中的每一个核心主题，提供清晰的解释、典型例题和应试策略，帮助你自信地掌握全部内容。
1. Complex Numbers – Arithmetic and Argand Diagrams | 复数 – 运算与 Argand 图
A complex number z can be written as z = a + bi, where a and b are real numbers, and i is the imaginary unit satisfying i² = -1. The real part is Re(z) = a, and the imaginary part is Im(z) = b. Two complex numbers are equal if and only if both their real and imaginary parts are equal. Addition and subtraction are performed component-wise: (a + bi) ± (c + di) = (a ± c) + (b ± d)i. Multiplication uses the distributive law and the fact that i² = -1. Division is carried out by multiplying numerator and denominator by the complex conjugate of the denominator, turning the denominator into a real number.
复数 z 可以写成 z = a + bi，其中 a 和 b 是实数，i 是虚数单位，满足 i² = -1。实部为 Re(z) = a，虚部为 Im(z) = b。两个复数相等当且仅当它们的实部和虚部分别相等。加法和减法按分量进行：(a + bi) ± (c + di) = (a ± c) + (b ± d)i。乘法使用分配律并利用 i² = -1。除法通过将分子和分母同时乘以分母的共轭复数来完成，使分母化为实数。
An Argand diagram represents complex numbers as points or vectors in a plane, with the x-axis as the real axis and the y-axis as the imaginary axis. The modulus |z| = √(a² + b²) gives the distance from the origin, and the argument arg(z) = θ, measured from the positive real axis, typically in the range -π < θ ≤ π. The modulus-argument form z = r(cos θ + i sin θ) is fundamental for multiplication, division, and powers. Geometrically, multiplying two complex numbers multiplies their moduli and adds their arguments, while dividing divides the moduli and subtracts the arguments.
Argand 图将复数表示为平面上的点或向量，x 轴为实轴，y 轴为虚轴。模长 |z| = √(a² + b²) 表示到原点的距离，辐角 arg(z) = θ 从正实轴开始测量，通常取值范围为 -π < θ ≤ π。模-辐角形式 z = r(cos θ + i sin θ) 对于乘法、除法和乘方至关重要。从几何角度看，两个复数相乘相当于模长相乘、辐角相加；相除则相当于模长相除、辐角相减。
2. Complex Numbers – De Moivre’s Theorem and Roots | 复数 – 棣莫弗定理与求根
De Moivre’s theorem states that for any real number n, (cos θ + i sin θ)ⁿ = cos(nθ) + i sin(nθ). This elegant result allows us to raise complex numbers to integer powers efficiently. When n is an integer, the proof follows by induction. The theorem can also be extended to rational powers to find roots of complex numbers. To find the n distinct nth roots of a complex number w, first express w in modulus-argument form w = r(cos φ + i sin φ). Then the roots are given by zₖ = r^(1/n) [ cos( (φ + 2kπ)/n ) + i sin( (φ + 2kπ)/n ) ], where k = 0, 1, 2, …, n-1.
棣莫弗定理指出，对于任意实数 n，有 (cos θ + i sin θ)ⁿ = cos(nθ) + i sin(nθ)。这个简洁的结果使我们能够高效地计算复数的整数次幂。当 n 为整数时，可以通过归纳法证明。该定理还可以推广到有理数次幂来求解复数的根。为了求出一个复数 w 的 n 个不同的 n 次方根，首先将 w 表示为模-辐角形式 w = r(cos φ + i sin φ)。那么所有的根由下式给出：zₖ = r^(1/n) [ cos( (φ + 2kπ)/n ) + i sin( (φ + 2kπ)/n ) ]，其中 k = 0, 1, 2, …, n-1。
Geometrically, these n roots lie equally spaced on a circle of radius r^(1/n) in the Argand diagram, forming a regular n-gon. This is a favorite exam topic because it combines trigonometric identities with complex algebra. A common application is expressing cos(nθ) and sin(nθ) in terms of powers of cos θ and sin θ, or vice versa, by expanding (cos θ + i sin θ)ⁿ using the binomial theorem and then equating real and imaginary parts. These expansions are useful in integration and solving trigonometric equations.
从几何上看，这 n 个方根均匀地分布在 Argand 图中半径为 r^(1/n) 的圆上，构成一个正 n 边形。这是考试中的热门主题，因为它结合了三角恒等式与复数代数。一个常见的应用是通过二项式定理展开 (cos θ + i sin θ)ⁿ，然后比较实部和虚部，将 cos(nθ) 和 sin(nθ) 表示为 cos θ 和 sin θ 的幂，或反之。这些展开式在积分和解三角方程中非常有用。
3. Roots of Polynomial Equations – Relationships and Transformations | 多项式方程的根 – 关系与变换
For a quadratic equation ax² + bx + c = 0 with roots α and β, the sum of roots α + β = -b/a, and the product αβ = c/a. These elementary relationships extend to cubic and quartic equations. For a cubic ax³ + bx² + cx + d = 0 with roots α, β, γ, we have Σα = α + β + γ = -b/a, Σαβ = αβ + βγ + γα = c/a, and αβγ = -d/a. The notation Σαβ means the sum of products of pairs of roots. These symmetrical sums allow us to evaluate expressions involving roots without actually solving the equation, a technique vital for many proofs and applied problems.
对于二次方程 ax² + bx + c = 0，其根为 α 和 β，则有根的和 α + β = -b/a，根的积 αβ = c/a。这些基本关系可以推广到三次和四次方程。对于三次方程 ax³ + bx² + cx + d = 0，其根为 α, β, γ，我们有 Σα = α + β + γ = -b/a，Σαβ = αβ + βγ + γα = c/a，以及 αβγ = -d/a。符号 Σαβ 表示所有两根乘积之和。这些对称和使我们能够在不实际求解方程的情况下计算涉及根的表达式，这一技巧对许多证明和应用问题至关重要。
Another powerful tool is the substitution method for finding a new polynomial whose roots are related to those of a given polynomial. For example, if a cubic has roots α, β, γ, we can find the polynomial with roots α², β², γ² by letting y = x² and eliminating x. Typical transformations include y = kx (scaling), y = x + c (translation), and y = 1/x (reciprocal). The key is to express x in terms of y and substitute into the original polynomial, then rearrange to obtain a polynomial in y. Mastery of this topic requires careful algebraic manipulation and constant checking for errors.
另一个强大的工具是代换法，用于求一个新的多项式，其根与原多项式的根满足某种关系。例如，若某个三次方程的根是 α, β, γ，我们可以通过设 y = x² 并消去 x 来求出以 α², β², γ² 为根的多项式。典型的变换包括 y = kx（缩放），y = x + c（平移），以及 y = 1/x（倒数）。关键在于将 x 用 y 表示并代入原多项式，然后重新整理成关于 y 的多项式。掌握该主题需要仔细的代数操作并不断检查错误。
4. Summation of Series – Methods and Standard Results | 级数求和 – 方法与标准结果
The method of differences is a core technique for summing finite series where terms cancel successively. The typical approach involves expressing the general term as a difference of two related expressions, such as 1/[r(r+1)] = 1/r – 1/(r+1). When the sum is written out, most terms cancel, leaving only the first and last parts. This is particularly effective for rational functions and sometimes for trigonometric series. Always write the sum explicitly for the first few terms and the last few terms to confirm the pattern of cancellation.
差分法是求解有限级数之和的核心技巧，其中各项会相继抵消。典型的方法是将通项表示为两个相关表达式的差，例如 1/[r(r+1)] = 1/r – 1/(r+1)。将求和式展开后，大部分项都会消去，只留下首尾部分。该方法对于有理函数极为有效，有时也用于三角级数。一定要明确写出前几项和最后几项的求和形式，以确认抵消的模式。
FP1 also expects fluency with standard summation formulas: Σr = n(n+1)/2, Σr² = n(n+1)(2n+1)/6, and Σr³ = [n(n+1)/2]². These results, provable by induction, can be combined linearly to sum polynomial expressions. More complex sums may require splitting into partial fractions or applying the given standard forms after algebraic manipulation. Common pitfalls include miscounting the number of terms when the index starts from a value other than 1, so always convert to standard forms carefully.
FP1 还要求熟练运用标准求和公式：Σr = n(n+1)/2，Σr² = n(n+1)(2n+1)/6，以及 Σr³ = [n(n+1)/2]²。这些结果可用归纳法证明，并可线性组合来对多项式表达式求和。更复杂的求和可能需要拆分为部分分式，或经过代数变换后再应用标准形式。常见的陷阱包括当索引不从 1 开始时计错项数，因此务必谨慎地转化为标准形式。
5. Matrices – Operations, Determinants and Inverses | 矩阵 – 运算、行列式与逆矩阵
A matrix is a rectangular array of numbers. In FP1, we focus on 2×2 and 3×3 matrices. Addition and subtraction require matrices of the same order, performed element-wise. Multiplication of matrices is non-commutative in general (AB ≠ BA). For the product to be defined, the number of columns of the first must equal the number of rows of the second. The identity matrix I satisfies AI = IA = A. For 2×2 matrices, I = [[1,0],[0,1]]. The determinant of a 2×2 matrix M = [[a,b],[c,d]] is det(M) = ad – bc. For a 3×3 matrix, the determinant is calculated by expansion along a row or column, paying careful attention to the sign pattern.
矩阵是一个数字的矩形阵列。在 FP1 中，我们主要研究 2×2 和 3×3 矩阵。加法和减法要求矩阵同型，按元素逐一进行。矩阵乘法一般不满足交换律（AB ≠ BA）。乘法有意义的前提是第一个矩阵的列数等于第二个矩阵的行数。单位矩阵 I 满足 AI = IA = A。对于 2×2 矩阵，I = [[1,0],[0,1]]。2×2 矩阵 M = [[a,b],[c,d]] 的行列式为 det(M) = ad – bc。对于 3×3 矩阵，行列式通过按某一行或某一列展开来计算，需要特别注意符号规律。
The inverse of a square matrix A, denoted A⁻¹, satisfies AA⁻¹ = A⁻¹A = I. A matrix is invertible (non-singular) if and only if its determinant is non-zero. For a 2×2 matrix M = [[a,b],[c,d]], the inverse is (1/det(M)) [[d,-b],[-c,a]]. For 3×3 matrices, finding the inverse involves calculating the matrix of cofactors, transposing it to form the adjugate, and multiplying by 1/det(A). This is time-consuming but systematic. Simultaneous linear equations can be written in matrix form Ax = b, and if A is invertible, the solution is x = A⁻¹b. This matrix method is elegant and quickly verifies the consistency of a system.
方阵 A 的逆矩阵记为 A⁻¹，满足 AA⁻¹ = A⁻¹A = I。一个矩阵可逆（非奇异）当且仅当其行列式不为零。对于 2×2 矩阵 M = [[a,b],[c,d]]，逆矩阵为 (1/det(M)) [[d,-b],[-c,a]]。对于 3×3 矩阵，求逆需要计算余子式矩阵，将其转置得到伴随矩阵，再乘以 1/det(A)。这个过程虽然耗时但非常系统化。线性方程组可写成矩阵形式 Ax = b，若 A 可逆，则解为 x = A⁻¹b。这种矩阵方法十分优雅，且能快速验证方程组的一致性。
6. Matrices – Linear Transformations in the Plane | 矩阵 – 平面上的线性变换
Every 2×2 matrix can be viewed as a linear transformation of the plane, mapping the vector (x, y) to (x’, y’) via (x’, y’)ᵀ = M (x, y)ᵀ. Transformations can be described geometrically: rotations, reflections, stretches, shears, and their combinations. A rotation about the origin by angle θ counterclockwise is represented by [[cos θ, -sin θ],[sin θ, cos θ]]. A reflection in the line y = x gives [[0,1],[1,0]], and reflection in the x-axis gives [[1,0],[0,-1]]. Stretches parallel to axes use diagonal matrices with scale factors, while shears parallel to an axis have 1s on the diagonal and a zero in one off-diagonal position with a shear factor in the other.
每一个 2×2 矩阵都可以看作平面上的一个线性变换，通过 (x’, y’)ᵀ = M (x, y)ᵀ 将向量 (x, y) 映射到 (x’, y’)。变换可以用几何语言描述：旋转、反射、拉伸、剪切及其组合。绕原点逆时针旋转角度 θ 由矩阵 [[cos θ, -sin θ],[sin θ, cos θ]] 表示。关于直线 y = x 的反射给出 [[0,1],[1,0]]，关于 x 轴的反射给出 [[1,0],[0,-1]]。平行于坐标轴的伸缩使用对角矩阵，对角线上是伸缩因子；而平行于坐标轴的剪切变换在反对角位置上有一个剪切因子，对角线全为 1。
The determinant of the transformation matrix gives the area scale factor; if negative, the transformation involves a reflection (orientation reversed). To find the image of a line or curve under a transformation, substitute the transformed coordinates into the original equation. Invariant lines (lines mapped to themselves) and invariant points are tested by solving M v = v or M v = λ v. These geometric interpretations link algebra to visual reasoning and regularly appear in examination questions requiring both calculation and description.
变换矩阵的行列式给出了面积缩放因子；若为负值，则该变换包含反射（方向反转）。要寻找一条直线或曲线在变换下的像，只需将变换后的坐标代入原方程。不变直线（映射到自身的直线）和不变点可通过解 M v = v 或 M v = λ v 来检验。这些几何解释将代数与直观推理联系起来，并经常出现在既要求计算又要求描述的试题中。
7. Proof by Induction – Sequences, Divisibility and Matrix Powers | 归纳法证明 – 数列、整除性与矩阵幂
Mathematical induction is a rigorous method for proving statements that hold for all positive integers. The process consists of three clear steps: basis step, induction hypothesis, and induction step. First, verify the statement for n = 1 (or the smallest relevant value). Then assume the statement is true for n = k (the induction hypothesis). Finally, prove that if it holds for n = k, then it must hold for n = k + 1. The logic is that since it is true for 1, it is true for 2, and so on, cascading infinitely.
数学归纳法是一种严谨的方法，用于证明对所有正整数都成立的命题。该过程包含三个清晰的步骤：基础步、归纳假设和归纳步。首先，验证 n = 1（或最小的相关值）时命题成立。然后假设 n = k 时命题成立（归纳假设）。最后，证明如果命题对 n = k 成立，那么它对 n = k + 1 也必然成立。其逻辑在于：既然对 1 成立，那么对 2 也成立，以此类推，无限递推。
Typical FP1 induction problems include proving summation formulas (e.g., Σr³ = n²(n+1)²/4), divisibility statements (e.g., 3^(2n) – 1 is divisible by 8), and matrix power formulas (e.g., Mⁿ = …). For matrix induction, calculate M^(k+1) = M^k M using the assumed form, then simplify the product carefully. Always state the conclusion clearly: “Hence, by mathematical induction, the statement is true for all n ∈ Z⁺.” Avoid the common mistake of assuming what you want to prove in the induction step; always start with the left-hand side of the (k+1) case and transform it using the hypothesis.
FP1 中典型的归纳法问题包括：证明求和公式（如 Σr³ = n²(n+1)²/4）、整除性命题（如 3^(2n) – 1 能被 8 整除）以及矩阵的幂公式（如 Mⁿ = …）。对于矩阵归纳，利用假设形式计算 M^(k+1) = M^k M，然后仔细化简乘积。最后要明确写出结论：”因此，根据数学归纳法，该命题对所有 n ∈ Z⁺ 均成立。” 要避免在归纳步骤中假设要证明的结论；始终从 (k+1) 情形等式的左边出发，并利用归纳假设对其进行变换。
8. Complex Numbers in Exponential Form and Geometry | 复数的指数形式及其几何应用
Building on modulus-argument form, Euler’s formula e^(iθ) = cos θ + i sin θ allows us to write any complex number as re^(iθ). This exponential form makes multiplication, division, and powers extremely compact: r₁e^(iθ₁) · r₂e^(iθ₂) = (r₁r₂) e^(i(θ₁+θ₂)). The conjugate of re^(iθ) is re^(-iθ). De Moivre’s theorem is now simply (re^(iθ))ⁿ = rⁿ e^(inθ). The form also facilitates solving equations like zⁿ = w by taking the nth root of both sides in exponential form, automatically generating all n solutions through adding multiples of 2π to the argument before dividing by n.
在模-辐角形式的基础上，欧拉公式 e^(iθ) = cos θ + i sin θ 允许我们将任何复数写为 re^(iθ)。这种指数形式使得乘法、除法和乘方极其简洁：r₁e^(iθ₁) · r₂e^(iθ₂) = (r₁r₂) e^(i(θ₁+θ₂))。re^(iθ) 的共轭复数是 re^(-iθ)。棣莫弗定理现在简单地表示为 (re^(iθ))ⁿ = rⁿ e^(inθ)。该形式还有助于高效求解形如 zⁿ = w 的方程，在指数形式下两边开 n 次方根，通过在除法前给辐角加上 2π 的整数倍，自动生成全部 n 个解。
Geometrically, the set of points z satisfying |z – z₀| = r is a circle centered at z₀ with radius r. The inequality |z – z₁| ≤ |z – z₂| describes the half-plane closer to z₁ than to z₂, with the perpendicular bisector as the boundary. The argument arg(z – z₀) = constant represents a ray from z₀. Regions defined by loci combine these ideas. Exam questions often ask for sketching such loci on an Argand diagram and finding intersections or transformations of these regions, blending algebra with geometric intuition.
从几何角度看，满足 |z – z₀| = r 的点 z 的集合是以 z₀ 为圆心、半径为 r 的圆。不等式 |z – z₁| ≤ |z – z₂| 描述的是到 z₁ 比到 z₂ 更近的半平面，其边界为垂直平分线。辐角 arg(z – z₀) = 常数 表示从 z₀ 出发的一条射线。由轨迹定义的区域结合了这些概念。考试题通常要求在一个 Argand 图上绘制这些轨迹，并求交点或对这些区域进行变换，将代数与几何直觉融为一体。
9. Vector Cross Product and Its Applications | 向量的叉积及其应用
The cross product of two vectors a = a₁i + a₂j + a₃k and b = b₁i + b₂j + b₃k is defined as a × b = (a₂b₃ – a₃b₂)i + (a₃b₁ – a₁b₃)j + (a₁b₂ – a₂b₁)k. The result is a vector perpendicular to both a and b, with direction given by the right-hand rule. Its magnitude |a × b| = |a||b| sin θ gives the area of the parallelogram spanned by a and b. Thus, the area of a triangle with two sides given by vectors a and b is (1/2)|a × b|.
两个向量 a = a₁i + a₂j + a₃k 和 b = b₁i + b₂j + b₃k 的叉积定义为 a × b = (a₂b₃ – a₃b₂)i + (a₃b₁ – a₁b₃)j + (a₁b₂ – a₂b₁)k。其结果是同时垂直于 a 和 b 的一个向量，方向由右手定则确定。叉积的大小 |a × b| = |a||b| sin θ 给出了由 a 和 b 张成的平行四边形的面积。因此，以向量 a 和 b 为两边的三角形面积为 (1/2)|a × b|。
In FP1, the cross product is used to find a vector perpendicular to a plane, the shortest distance from a point to a line, and the volume of a parallelepiped (via the scalar triple product a · (b × c)). For example, the distance from a point P with position vector p to the line through point A with direction vector d is d = |(p – a) × d| / |d|. This formula arises because the magnitude of the cross product gives the area of a parallelogram with base |d| and height equal to the perpendicular distance. Consistent use of vector notation and careful determinant-like calculations are key to accuracy.
在 FP1 中，叉积用于求垂直于平面的向量、点到直线的最短距离以及平行六面体的体积（通过标量三重积 a · (b × c)）。例如，位置向量为 p 的点 P 到经过点 A 且方向向量为 d 的直线的距离为 d = |(p – a) × d| / |d|。这一公式源于叉积的大小给出了以 |d| 为底、高为垂直距离的平行四边形的面积。始终使用向量记号并谨慎地进行类似行列式的计算是确保准确的关键。
10. Solving Systems of Linear Equations Using Matrices | 使用矩阵解线性方程组
A system of linear equations can be expressed as Ax = b. When A is a square non-singular matrix, the unique solution is x = A⁻¹b. However, if the determinant of A is zero, the system either has no solutions or infinitely many, depending on whether the equations are consistent. For 2×2 systems, the inverse method is straightforward. For 3×3 systems, the augmented matrix (A|b) can be reduced to row-echelon form, a process covered more thoroughly in Further Pure, but FP1 expects students to handle 3×3 inverses by the adjugate method to obtain the unique solution.
一个线性方程组可以表示为 Ax = b。当 A 是非奇异方阵时，唯一解为 x = A⁻¹b。但是，如果 A 的行列式为零，则方程组要么无解，要么有无穷多解，取决于方程是否相容。对于 2×2 方程组，逆矩阵法非常直接。对于 3×3 方程组，增广矩阵 (A|b) 可化为行阶梯形，这一过程在进阶纯数学中会深入讨论，但 FP1 要求学生能够通过伴随矩阵法求 3×3 矩阵的逆，进而得到唯一解。
Geometrically, each linear equation in three variables represents a plane. Three planes typically intersect at a single point (unique solution), but they may intersect along a common line (infinitely many solutions) or not all intersect at a common point (no solution). The determinant condition det(A) = 0 signals that the normal vectors are coplanar, leading to these anomalies. In exams, you may be asked to determine the geometrical relationship of three planes based on the matrix form, so linking algebraic outcomes to geometry is essential.
从几何上看，三个变量的每一个线性方程代表一个平面。三个平面通常相交于一点（唯一解），但它们也可能沿一条公共直线相交（无穷多解），或者三者没有公共交点（无解）。行列式条件 det(A) = 0 表明法向量共面，从而导致这些异常情况。在考试中，你可能会被要求根据矩阵形式判断三个平面的几何关系，因此将代数结果与几何联系起来至关重要。
11. Inequalities with Modulus and Polynomial Expressions | 含绝对值与多项式的分式不等式
FP1 revisites inequalities involving rational functions and modulus signs. For polynomial inequalities like (x-1)(x+2)/(x-3) > 0, critical values are identified (where expression equals zero or is undefined) and a sign diagram is constructed. Do not multiply both sides by the denominator unless you are certain of its sign; instead, bring all terms to one side and form a common denominator. The final answer should be given in set notation or interval form.
FP1 再次涉及含有有理函数和绝对值符号的不等式。对于诸如 (x-1)(x+2)/(x-3) > 0 的多项式不等式，需确定临界值（表达式等于零或无定义的点），并做出符号表。除非确定分母的正负，否则不要两边乘以分母；相反，应将所有项移到一边并通分。最终答案应以集合符号或区间形式呈现。
Modulus inequalities such as |x – a| < b mean -b < x - a < b, whereas |x - a| > b corresponds to two separate intervals: x – a < -b or x - a > b. More complex forms like |2x – 1| < |x + 3| can be tackled by squaring both sides, since both sides are non-negative, or by considering critical points where the expressions inside the moduli change sign. Graphical methods can also help visualize the solution sets. Precision with strict versus non-strict inequalities is vital.
绝对值不等式如 |x – a| < b 等价于 -b < x - a < b，而 |x - a| > b 则对应于两个分离的区间：x – a < -b 或 x - a > b。更复杂的例如 |2x – 1| < |x + 3|，可以通过两边平方求解（因为两边非负），或通过考虑绝对值内部表达式改变符号的临界点来求解。图形方法也有助于直观理解解集。严格不等式与非严格不等式的精确区分至关重要。
12. Series and Method of Differences – Advanced Applications | 级数与差分法 – 高级应用
Beyond the basic telescoping sums, FP1 tests the ability to handle sums where the cancellation occurs over more than two consecutive terms, or where partial fractions lead to differences of three terms. For instance, a term like 1/[(r)(r+1)(r+2)] can be split as A/r + B/(r+1) + C/(r+2), then rearranged into a telescoping form. Summation of trigonometric series using method of differences often employs identities like sin(rθ) – sin((r-1)θ) = 2 cos((2r-1)θ/2) sin(θ/2), leading to a telescoping sum in terms of cos.
除了基本的缩并求和，FP1 还考查处理项数超过连续两项相消的求和的能力，或是部分分式导致三项差分的形式。例如，像 1/[(r)(r+1)(r+2)] 这样的项可以拆分为 A/r + B/(r+1) + C/(r+2)，然后重新整理成缩并形式。利用差分法求三角级数之和时，常使用恒等式如 sin(rθ) – sin((r-1)θ) = 2 cos((2r-1)θ/2) sin(θ/2)，从而得到一个关于余弦的缩并级数。
Another important aspect is the summation of series expressed in Σ notation with variable upper limits. Sometimes you must split a sum into two or more standard sums. For example, Σ (r²+2r-1) from r=1 to n can be split into Σr² + 2Σr – Σ1. Remember that Σ1 from r=1 to n equals n, not 1. A solid grasp of algebraic manipulation and the ability to recognize opportunities for difference of methods can turn a complex-looking sum into a trivial calculation.
另一个重要方面是使用 Σ 符号表示的可变上限求和。有时必须将一个和式拆分成两个或多个标准和式。例如，从 r=1 到 n 的 Σ (r²+2r-1) 可以拆分为 Σr² + 2Σr – Σ1。注意从 r=1 到 n 的 Σ1 等于 n，而不是 1。扎实的代数操作能力以及识别出适合使用差分法的机会，可以将一个看似复杂的求和转化为简单的计算。
Published by TutorHao | Further Pure Mathematics 1 Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导