📚 PDF资源导航

aleveler.com

Category: Edexcel A-Level Further Maths

  • Polar Coordinates: The Complete Core Pure 2 Guide — 极坐标：Core Pure 2 完整指南

    1. What Are Polar Coordinates? The (r, θ) System | 什么是极坐标？(r, θ) 坐标系

    在 Core Pure 2 中，极坐标是继直角坐标之后最重要的坐标系之一。直角坐标用 (x, y) 表示点到两条互相垂直的数轴的距离，而极坐标用 (r, θ) 表示点的位置：r 是该点到极点（原点）的距离，θ 是从极轴（通常为正 x 轴方向）逆时针旋转到该点的角度，单位为弧度。一个点可以在极坐标下有无数种表示方式，例如 (2, π/3) 也可以写成 (2, π/3 + 2π)。这一特性是极坐标与直角坐标最本质的区别。

    In Core Pure 2, polar coordinates are one of the most important coordinate systems after Cartesian coordinates. Cartesian coordinates use (x, y) to locate a point by its distances from two perpendicular axes, while polar coordinates use (r, θ): r is the distance from the pole (the origin) to the point, and θ is the angle measured anticlockwise from the initial line (usually the positive x-axis direction) to the point, in radians. A single point has infinitely many polar representations, for example (2, π/3) can also be written as (2, π/3 + 2π). This property is the most fundamental difference between polar and Cartesian coordinates.

    为什么要引入极坐标？因为有些曲线用直角坐标方程描述非常繁琐，但用极坐标却极其简洁。例如以原点为圆心、半径为 a 的圆，直角坐标方程是 x² + y² = a²，而极坐标方程只需要 r = a。再比如等角螺线 r = aθ，用直角坐标几乎无法简洁表达。在 Edexcel 的考试中，你需要能够识别这些方程、画出它们的图像，并用积分计算它们围成的面积。

    Why do we need polar coordinates at all? Because some curves are extremely cumbersome to describe with Cartesian equations but become beautifully simple in polar form. For example, a circle centred at the origin with radius a has Cartesian equation x² + y² = a², but its polar equation is simply r = a. As another example, the spiral r = aθ is almost impossible to express concisely in Cartesian form. In Edexcel exams you need to recognise these equations, sketch their graphs, and use integration to find the areas they enclose.

    2. Converting Between Polar and Cartesian: Four Key Formulas | 极坐标与直角坐标互化：四个关键公式

    极坐标与直角坐标之间的转换是整个章节的计算基础。从极坐标 (r, θ) 到直角坐标 (x, y)，只需要两个公式：x = r cosθ 和 y = r sinθ。反过来，从直角坐标到极坐标，则需要 r² = x² + y² 和 tanθ = y/x。这四个公式必须熟练掌握，因为它们会出现在几乎所有题目中，无论是转换方程、求交点还是画图。

    Converting between polar and Cartesian coordinates is the computational foundation of the whole chapter. To go from polar (r, θ) to Cartesian (x, y), you need only two formulas: x = r cosθ and y = r sinθ. To go the other way, from Cartesian to polar, use r² = x² + y² and tanθ = y/x. These four formulas must be mastered, because they appear in almost every question, whether you are converting equations, finding intersections, or sketching graphs.

    实际做题时有一个非常实用的技巧：当题目给出极坐标方程并要求你转换成直角坐标方程时，先把方程两边同乘 r，通常就能凑出 r cosθ、r sinθ 或 r² 的形式。例如方程 r = 2a cosθ，两边同乘 r 得到 r² = 2ar cosθ，代入 x² + y² = r² 和 x = r cosθ，立刻得到 x² + y² = 2ax，这是一个圆心在 (a, 0)、半径为 a 的圆。这个技巧在处理所有”圆类”极坐标方程时都有效。

    There is a very practical trick for working problems: when a question gives a polar equation and asks you to convert it to Cartesian form, multiply both sides by r first. This usually lets you spot r cosθ, r sinθ or r² directly. For example, take the equation r = 2a cosθ. Multiplying both sides by r gives r² = 2ar cosθ. Substituting x² + y² = r² and x = r cosθ immediately yields x² + y² = 2ax, which is a circle with centre (a, 0) and radius a. This trick works for every circular-type polar equation.

    3. Standard Polar Curves: Circles, Cardioids, Spirals and Roses | 标准极坐标曲线：圆、心形线、螺线与玫瑰线

    Core Pure 2 要求你熟悉四类标准极坐标曲线。第一类是圆：r = a 是以原点为圆心、半径 a 的圆；r = 2a cosθ 是圆心在 (a, 0) 的圆；r = 2a sinθ 是圆心在 (0, a) 的圆。第二类是心形线 r = a(1 + cosθ) 或 r = a(1 + sinθ)，图像像一个心形，在 θ = 0 或 θ = π/2 处有尖点。第三类是螺线 r = aθ，图像像蜗牛壳一样不断向外盘旋，随着 θ 增大 r 线性增大。第四类是玫瑰线 r = a cos(nθ) 或 r = a sin(nθ)，当 n 为奇数时有 n 片花瓣，当 n 为偶数时有 2n 片花瓣。

    Core Pure 2 requires you to be familiar with four standard families of polar curves. The first family is circles: r = a is a circle centred at the origin with radius a; r = 2a cosθ is a circle centred at (a, 0); r = 2a sinθ is a circle centred at (0, a). The second family is cardioids r = a(1 + cosθ) or r = a(1 + sinθ), whose heart-shaped graph has a cusp at θ = 0 or θ = π/2. The third family is spirals r = aθ, whose snail-shell shape winds outward as r increases linearly with θ. The fourth family is rose curves r = a cos(nθ) or r = a sin(nθ), which have n petals when n is odd and 2n petals when n is even.

    记忆这些标准曲线对考试非常有帮助。Edexcel 的题目经常直接给出这些标准方程，然后要求你”sketch the curve”。如果你已经知道 r = a(1 + cosθ) 是心形线、r = 3cos 2θ 是四叶玫瑰线，你就能快速画出形状并检查自己的关键点是否正确。建议把这些标准曲线整理成一张速查表，把图像、方程和关键特征（对称轴、尖点、与极轴的交点）放在一起反复记忆。

    Memorising these standard curves pays off heavily in exams. Edexcel questions often hand you one of these standard equations and ask you to “sketch the curve”. If you already know that r = a(1 + cosθ) is a cardioid and r = 3cos 2θ is a four-petal rose, you can quickly sketch the shape and check whether your key points are correct. A good idea is to build a revision table pairing each curve with its equation and key features (axes of symmetry, cusps, intersections with the initial line), and review it regularly.

    4. How to Sketch Polar Curves: Key Points and Symmetry | 如何绘制极坐标曲线：关键点与对称性

    画极坐标曲线的标准方法是”列表取点”。取 θ = 0、π/6、π/4、π/3、π/2、2π/3、π、3π/2、2π 等关键角度，逐一代入方程算出对应的 r 值，把点标在极坐标网格上再平滑连接。考试中只需要画出示意草图，不需要精确到每个点，但关键点必须标对，尤其是曲线与极轴的交点（θ = 0 和 θ = π 处）以及与极轴垂直方向的交点。

    The standard method for sketching a polar curve is to tabulate points. Take key angles such as θ = 0, π/6, π/4, π/3, π/2, 2π/3, π, 3π/2 and 2π, substitute each into the equation to find the corresponding r value, plot the points on a polar grid, and join them with a smooth curve. In the exam you only need a rough sketch, not every point, but the key points must be correct, especially the intersections with the initial line (at θ = 0 and θ = π) and with the line perpendicular to it.

    对称性可以帮你省一半的工作量。如果方程只含 cosθ，那么曲线关于极轴对称（即关于 x 轴对称），因为 cos(-θ) = cosθ，所以 θ 和 -θ 给出相同的 r。如果方程只含 sinθ，曲线关于 θ = π/2 这条线对称，因为 sin(π – θ) = sinθ。利用对称性，你只需画出半边，再镜像过去即可。另外注意 r 可以为负值，例如 r = a cosθ 在 θ 属于 (π/2, 3π/2) 时 r < 0，此时点在相反方向上，这是初学者最容易画错的地方。

    Symmetry can halve your workload. If the equation contains only cosθ, the curve is symmetric about the initial line (the x-axis), because cos(-θ) = cosθ, so θ and -θ give the same r. If the equation contains only sinθ, the curve is symmetric about the line θ = π/2, because sin(π – θ) = sinθ. Using symmetry, you only need to draw one half and mirror it. Also note that r can be negative: for example r = a cosθ gives r < 0 when θ lies in (π/2, 3π/2), and the point is then plotted in the opposite direction. This is the most common sketching mistake made by beginners.

    5. Area Enclosed by a Polar Curve: A = 1/2 ∫ r² dθ | 极坐标曲线围成的面积：A = 1/2 ∫ r² dθ

    求极坐标曲线围成的面积是 Core Pure 2 的核心考点，也是积分在极坐标中的主要应用。面积公式为 A = (1/2) ∫ r² dθ，积分区间从起始角 α 到终止角 β。这个公式的推导思路是：把面积细分成无数个极小的扇形，每个扇形的面积近似为 (1/2) r² Δθ，然后让 Δθ 趋近于零求和取极限，就得到定积分。理解这个推导能帮助你在考试中写对公式，而不是死记硬背。

    Finding the area enclosed by a polar curve is a core assessment point of Core Pure 2 and the main application of integration in polar coordinates. The area formula is A = (1/2) ∫ r² dθ, integrated from a start angle α to an end angle β. The derivation splits the area into infinitely many tiny sectors, each of approximate area (1/2) r² Δθ, then lets Δθ tend to zero and sums the limit, which produces the definite integral. Understanding this derivation helps you write the formula correctly in the exam instead of relying on rote memory.

    使用面积公式时最关键的步骤是确定积分的上下限。上下限是曲线”扫过”所求区域时 θ 的起止角度，通常通过求曲线与极轴、与其他曲线的交点来确定。求交点时令两条曲线的 r 相等：例如求 r = 3cosθ 与 r = 1 + cosθ 的交点，令 3cosθ = 1 + cosθ，解得 cosθ = 1/2，即 θ = π/3。两个角度之间的面积必须弄清是哪一部分区域，必要时画出草图辅助判断，否则很容易把面积算成两倍的差值。

    The most critical step in using the area formula is determining the limits of integration. The limits are the start and end angles of θ as the curve sweeps out the required region, usually found by locating intersections with the initial line or with other curves. To find an intersection, set the r values equal: for example, to intersect r = 3cosθ with r = 1 + cosθ, solve 3cosθ = 1 + cosθ, which gives cosθ = 1/2 and hence θ = π/3. When two angles bound an area, you must be clear about which part of the region you are finding; sketch the graph to help decide, otherwise you may end up calculating twice the difference of two areas.

    6. Tangents Parallel and Perpendicular to the Initial Line | 与极轴平行和垂直的切线

    切线问题是 Core Pure 2 极坐标章节的进阶考点，要求你找曲线上切线平行于极轴或垂直于极轴的点。解决这类问题的关键是参数化：把 x = r cosθ、y = r sinθ 代入极坐标方程，把曲线看成参数方程。切线平行于极轴（水平切线）时 dy/dθ = 0；切线垂直于极轴（竖直切线）时 dx/dθ = 0。解出对应的 θ 值，再代回原方程求出 r，就得到切点坐标。

    Tangent problems are the advanced assessment point of the polar coordinates chapter in Core Pure 2, asking you to find points where the tangent is parallel or perpendicular to the initial line. The key to these problems is parametrisation: substitute x = r cosθ and y = r sinθ into the polar equation so the curve is treated as a parametric curve. A horizontal tangent (parallel to the initial line) satisfies dy/dθ = 0; a vertical tangent (perpendicular to the initial line) satisfies dx/dθ = 0. Solve for the corresponding θ values, substitute back into the original equation to find r, and you have the tangent points.

    计算时要注意使用乘积法则。因为 x = r cosθ，所以 dx/dθ = (dr/dθ)cosθ – r sinθ；同理 dy/dθ = (dr/dθ)sinθ + r cosθ。把这两个表达式分别令为零并化简，通常会得到一个关于 θ 的三角方程。例如对于 r = 1 + cosθ，dy/dθ = 0 可以化简为 sinθ(2cosθ + 1) = 0，解得 θ = 0、π、2π/3、4π/3。不要忘记检查 r = 0 的特殊点（极点），在某些曲线中极点的切线问题需要单独讨论。

    Remember to use the product rule when differentiating. Since x = r cosθ, we have dx/dθ = (dr/dθ)cosθ – r sinθ; similarly dy/dθ = (dr/dθ)sinθ + r cosθ. Setting each expression to zero and simplifying usually yields a trigonometric equation in θ. For example, for r = 1 + cosθ, setting dy/dθ = 0 simplifies to sinθ(2cosθ + 1) = 0, giving θ = 0, π, 2π/3 and 4π/3. Do not forget to check the special point where r = 0 (the pole); for some curves the tangent at the pole must be discussed separately.

    7. Worked Example 1: Area of a Cardioid | 例题一：心形线面积计算

    来看一道完整的典型例题。设曲线 C 的极坐标方程为 r = a(1 + cosθ)，其中 a > 0。求曲线 C 围成的面积。第一步，确定 θ 的范围：因为 r = a(1 + cosθ) 在 θ 从 0 到 2π 时完整地画出一圈心形线，所以积分区间是 [0, 2π]。但利用对称性，可以先算 [0, π] 部分的面积再乘以 2，因为曲线关于极轴对称。

    Let us work through a complete typical example. Let curve C have polar equation r = a(1 + cosθ), where a > 0. Find the area enclosed by C. Step one: determine the range of θ. As θ runs from 0 to 2π, r = a(1 + cosθ) traces the cardioid exactly once, so the interval of integration is [0, 2π]. However, by symmetry about the initial line, we may integrate over [0, π] and double the result.

    第二步，代入面积公式。A = (1/2) ∫ r² dθ = (1/2) ∫ a²(1 + cosθ)² dθ，从 0 积到 π，再乘 2。展开 (1 + cosθ)² = 1 + 2cosθ + cos²θ，其中 cos²θ = (1 + cos 2θ)/2。于是被积函数化为 (3/2) + 2cosθ + (1/2)cos 2θ。逐项积分得到 (3/2)θ + 2sinθ + (1/4)sin 2θ，代入上下限 π 和 0：上限处为 (3/2)π，下限处为 0，所以半心形面积是 (1/2) a² × (3/2)π = (3/4)a²π。整个心形线面积为两倍，即 A = (3/2)a²π。

    Step two: substitute into the area formula. A = (1/2) ∫ r² dθ = (1/2) ∫ a²(1 + cosθ)² dθ integrated from 0 to π, then doubled. Expand (1 + cosθ)² = 1 + 2cosθ + cos²θ, using cos²θ = (1 + cos 2θ)/2. The integrand becomes (3/2) + 2cosθ + (1/2)cos 2θ. Integrating term by term gives (3/2)θ + 2sinθ + (1/4)sin 2θ. Substituting the limits π and 0: the upper limit gives (3/2)π, the lower limit gives 0, so half the cardioid has area (1/2) a² × (3/2)π = (3/4)a²π. Doubling gives the full cardioid area A = (3/2)a²π.

    这道题的几个要点值得注意。第一，展开平方和倍角公式是计算的必经之路，任何一步化简错误都会导致结果错误，建议每一步都写清楚。第二，利用对称性可以把计算量减半，但如果曲线不对称，必须老老实实从起点积到终点。第三，最终答案中不要忘记保留 a 的符号，a > 0 时面积是正的。检查答案的常用技巧：当 a = 1 时，心形线面积约为 4.71，与 (3/2)π 吻合。

    Several points in this example deserve attention. First, expanding the square and using the double-angle formula are unavoidable steps, and any simplification error will ruin the result, so write every step clearly. Second, symmetry halves the computation, but if the curve is not symmetric you must integrate honestly from start to finish. Third, do not forget to keep the parameter a in the final answer; the area is positive when a > 0. A useful sanity check: when a = 1, the cardioid area is about 4.71, matching (3/2)π.

    8. Worked Example 2: Tangent Points on a Rose Curve | 例题二：玫瑰曲线上的切点

    再看一道切线例题。曲线 C 的极坐标方程为 r = 3cos 2θ，求 C 上切线平行于极轴的所有点。首先把曲线写成参数形式：x = r cosθ = 3cos 2θ cosθ，y = r sinθ = 3cos 2θ sinθ。切线平行于极轴意味着 dy/dθ = 0。用乘积法则对 y 求导：dy/dθ = 3[-2sin 2θ sinθ + cos 2θ cosθ]。令其为零，化简得到 cos 3θ = 0，这一步用到了积化和差公式。

    Here is another tangent example. Curve C has polar equation r = 3cos 2θ. Find all points on C where the tangent is parallel to the initial line. First parametrise: x = r cosθ = 3cos 2θ cosθ and y = r sinθ = 3cos 2θ sinθ. A tangent parallel to the initial line means dy/dθ = 0. Differentiate y using the product rule: dy/dθ = 3[-2sin 2θ sinθ + cos 2θ cosθ]. Setting this to zero and simplifying gives cos 3θ = 0, using a product-to-sum identity.

    解方程 cos 3θ = 0，得 3θ = π/2 + kπ，即 θ = π/6 + kπ/3。在 [0, 2π) 内取值得 θ = π/6、π/2、5π/6、7π/6、3π/2、11π/6。把每个角度代回 r = 3cos 2θ 求 r：例如 θ = π/6 时 r = 3cos(π/3) = 3/2，对应的点是 ((3/2)cos(π/6), (3/2)sin(π/6)) = (3√3/4, 3/4)。按同样的方法处理其余五个角度，得到六个切点，它们恰好位于四叶玫瑰线的六个水平切点位置。

    Solving cos 3θ = 0 gives 3θ = π/2 + kπ, so θ = π/6 + kπ/3. Within [0, 2π) the values are θ = π/6, π/2, 5π/6, 7π/6, 3π/2 and 11π/6. Substitute each angle back into r = 3cos 2θ to find r: for example at θ = π/6, r = 3cos(π/3) = 3/2, and the point is ((3/2)cos(π/6), (3/2)sin(π/6)) = (3√3/4, 3/4). Processing the other five angles in the same way gives six tangent points, which are exactly the six horizontal tangent positions of the four-petal rose.

    这道题展示了切线问题的完整解题流程：参数化、求导、令导数为零、解三角方程、回代求坐标。每一步都有固定的套路，值得反复练习直到形成条件反射。特别提醒：解三角方程时不要遗漏周期内的所有解；回代时注意 r 可能为负，若 r < 0 则点在实际角度的反方向，坐标要按 (r cosθ, r sinθ) 直接计算，不需要人为改变符号。最后用草图验证所有切点都在曲线上。

    This question demonstrates the complete workflow of tangent problems: parametrise, differentiate, set the derivative to zero, solve the trigonometric equation, and substitute back to find coordinates. Every step follows a fixed routine, so it is worth practising until it becomes automatic. Two reminders: do not miss any solutions within the period when solving the trigonometric equation, and when substituting back, r may be negative; if r < 0 the point lies in the opposite direction, so compute the coordinates directly as (r cosθ, r sinθ) without manually flipping signs. Finally, verify with a sketch that all tangent points actually lie on the curve.

    9. Intersections of Polar Curves: Setting r1 = r2 | 极坐标曲线的交点：令 r1 = r2

    求两条极坐标曲线的交点，是面积题和坐标系转换题的常见前置步骤。基本方法是令两条曲线的 r 相等：设曲线 C1 为 r = f(θ)，曲线 C2 为 r = g(θ)，解方程 f(θ) = g(θ) 得到交点的角度，再代回任一方程求 r。例如求 r = 3cosθ 与 r = 1 + cosθ 的交点：令 3cosθ = 1 + cosθ，得 2cosθ = 1，所以 cosθ = 1/2，θ = π/3 或 5π/3。代回得 r = 3/2，交点为 (3/2, π/3) 和 (3/2, 5π/3)。

    Finding the intersections of two polar curves is a common preliminary step in area problems and coordinate conversion questions. The basic method is to set the r values equal: let curve C1 be r = f(θ) and curve C2 be r = g(θ), solve f(θ) = g(θ) for the angles of intersection, then substitute back into either equation to find r. For example, to intersect r = 3cosθ with r = 1 + cosθ: set 3cosθ = 1 + cosθ, giving 2cosθ = 1, so cosθ = 1/2 and θ = π/3 or 5π/3. Substituting back gives r = 3/2, so the intersection points are (3/2, π/3) and (3/2, 5π/3).

    有两个细节需要警惕。第一，两条曲线可能还在极点处相交，即 r = 0 的情况。此时 f(θ) = 0 与 g(θ) = 0 的解不同，但几何上它们都对应同一个点（极点），所以极点只能算一个交点。例如 r = 3cosθ 在 θ = π/2 处 r = 0，而 r = 1 + cosθ 在 θ = π 处 r = 0，这两个角度都对应极点，但交点只有一个。第二，当两条曲线的方程含有不同的三角函数时，可能需要对 θ 的周期做完整扫描，避免漏解；必要时画图核对交点个数。

    Two details demand caution. First, two curves may also intersect at the pole, where r = 0. The solutions of f(θ) = 0 and g(θ) = 0 may differ, but geometrically they all correspond to the same point (the pole), so the pole counts as only one intersection. For example, r = 3cosθ gives r = 0 at θ = π/2, while r = 1 + cosθ gives r = 0 at θ = π; both angles correspond to the pole, yet there is only one intersection point there. Second, when the two equations involve different trigonometric functions, scan the full period of θ to avoid missing solutions, and sketch the curves to check the number of intersections.

    交点角度确定之后，面积计算就顺理成章了。若要求两曲线之间的区域面积，先画草图判断区域由哪段弧围成，再分别用 A = (1/2) ∫ r² dθ 对每段弧积分，最后相减或相加。例如求圆 r = 3cosθ 外部与心形线 r = 1 + cosθ 内部的公共区域面积，先算心形线从 0 到 π/3 扫过的面积，再算圆从 π/3 到 π/2 扫过的面积，两部分相加即可。把”找交点”和”画图定区间”这两个动作练熟，面积题就成功了一半。

    Once the intersection angles are found, area calculations follow naturally. To find the area of the region between two curves, sketch first to see which arcs bound the region, integrate each arc separately with A = (1/2) ∫ r² dθ, then subtract or add the results. For example, for the region outside the circle r = 3cosθ and inside the cardioid r = 1 + cosθ, first find the area swept by the cardioid from 0 to π/3, then the area swept by the circle from π/3 to π/2, and add the two parts. Master the two habits of finding intersections and sketching to fix the intervals, and half of every area question is already solved.

    10. Common Exam Mistakes and How to Avoid Them | 常见考试错误与避坑指南

    第一个常见错误是忘记角度用弧度制。极坐标章节的所有角度都必须用弧度，积分上下限、三角方程的解、坐标表示全部是弧度。如果你把 θ = 60° 写进积分，结果一定错。第二个常见错误是面积公式漏掉 1/2。A = (1/2) ∫ r² dθ 中的 1/2 来自扇形面积公式 (1/2)r²Δθ，漏掉它答案会变成正确的两倍。第三个常见错误是积分上下限取错，尤其是涉及两条曲线之间的面积时，必须用草图确认哪段弧对应哪个范围。

    The first common mistake is forgetting that angles must be in radians. Every angle in the polar coordinates chapter is in radians: integration limits, solutions of trigonometric equations, and coordinate representations. If you write θ = 60 degrees into an integral, the result will certainly be wrong. The second common mistake is dropping the factor 1/2 in the area formula. The 1/2 in A = (1/2) ∫ r² dθ comes from the sector area formula (1/2)r²Δθ, and omitting it doubles the answer. The third common mistake is choosing the wrong integration limits, especially for areas between two curves; always use a sketch to confirm which arc corresponds to which range.

    第四个常见错误是在转换方程时混淆 x = r cosθ 与 r = √(x² + y²) 的适用场景。求直角坐标方程时优先用 x、y 表达；求极坐标方程时优先用 r、θ 表达。第五个常见错误是画图时忽略 r 为负值的情况。第六个常见错误是切线问题中忘记 dx/dθ 与 dy/dθ 各自的含义：水平切线看 dy/dθ，竖直切线看 dx/dθ，不要搞反。最后，考试中画草图一定要标注极轴方向、交点角度和关键点坐标，这些标注往往是得分点。

    The fourth common mistake is confusing when to use x = r cosθ and when to use r = √(x² + y²). When converting to a Cartesian equation, express everything in x and y; when converting to a polar equation, express everything in r and θ. The fifth common mistake is ignoring negative r when sketching. The sixth common mistake is mixing up the meanings of dx/dθ and dy/dθ in tangent problems: horizontal tangents look at dy/dθ, vertical tangents look at dx/dθ. Finally, always label the direction of the initial line, the intersection angles and the key point coordinates on your exam sketch, because these labels are often where method marks are awarded.

    10. Summary | 总结

    极坐标是 Edexcel A-Level 进阶数学 Core Pure 2 的重要章节，核心内容可以概括为四句话：第一，用 (r, θ) 表示点的位置，r 是到极点的距离，θ 是从极轴转过的弧度角；第二，用四个公式 x = r cosθ、y = r sinθ、r² = x² + y²、tanθ = y/x 完成两种坐标系的互化；第三，用 A = (1/2) ∫ r² dθ 计算曲线围成的面积，上下限由交点确定；第四，用参数化求导处理平行或垂直于极轴的切线，水平切线 dy/dθ = 0，竖直切线 dx/dθ = 0。

    Polar coordinates is an important chapter in Edexcel A-Level Further Mathematics Core Pure 2. The whole chapter can be summarised in four sentences. First, locate points with (r, θ), where r is the distance from the pole and θ is the angle in radians from the initial line. Second, convert between the two coordinate systems with the four formulas x = r cosθ, y = r sinθ, r² = x² + y² and tanθ = y/x. Third, compute enclosed areas with A = (1/2) ∫ r² dθ, with limits fixed by intersection points. Fourth, handle tangents parallel or perpendicular to the initial line by parametrising and differentiating: horizontal tangents satisfy dy/dθ = 0 and vertical tangents satisfy dx/dθ = 0.

    备考建议：把标准曲线（圆、心形线、螺线、玫瑰线）的图像和方程整理成速查表，每天过一遍；把面积计算和切线问题各做透十道真题，总结出固定的解题步骤；画图时养成标注关键点的习惯。做到这三点，极坐标章节的题目就能稳定拿分。祝同学们在 Core Pure 2 考试中取得好成绩！

    Revision advice: organise the standard curves (circles, cardioids, spirals and roses) into a quick-reference table with their equations and review it daily; master ten past-paper questions each for area calculation and tangent problems, and summarise the fixed solution steps; develop the habit of labelling key points when sketching. If you do these three things, you can reliably score on polar coordinates questions. Good luck in your Core Pure 2 exam!

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

  • Edexcel Further Maths Core Pure 2: De Moivre’s Theorem and Roots of Unity — Edexcel进阶数学 Core Pure 2：棣莫弗定理与单位根

    一、棣莫弗定理的陈述：从复数的模-幅角形式出发 | De Moivre’s Theorem: Statement from the Modulus-Argument Form

    在 Edexcel 进阶数学 Core Pure 2 中，棣莫弗定理（De Moivre’s Theorem）是连接复数代数与三角函数的桥梁。任何一个非零复数都可以写成模-幅角形式 z = r(cos θ + i sin θ)，其中 r = |z| 是模（modulus），θ = arg z 是幅角（argument）。棣莫弗定理告诉我们，对这个形式取 n 次幂时，规则极其简洁：模取 n 次幂，幅角乘以 n。

    In Edexcel Further Maths Core Pure 2, De Moivre’s Theorem is the bridge that connects complex algebra with trigonometry. Any non-zero complex number can be written in modulus-argument form z = r(cos θ + i sin θ), where r = |z| is the modulus and θ = arg z is the argument. De Moivre’s Theorem tells us that when we raise this form to the power n, the rule is remarkably clean: raise the modulus to the power n, and multiply the argument by n.

    定理的正式表述是：对于任意整数 n，[r(cos θ + i sin θ)]ⁿ = rⁿ(cos nθ + i sin nθ)。当 r = 1 时，它退化为 (cos θ + i sin θ)ⁿ = cos nθ + i sin nθ。这个结果对正整数 n 可以用数学归纳法严格证明，对负整数 n 和零则需要借助倒数与三角函数的奇偶性来推广。理解证明本身，能帮助你记住”模相乘、幅角相加”这个更深层的乘法本质。

    The formal statement is: for any integer n, [r(cos θ + i sin θ)]ⁿ = rⁿ(cos nθ + i sin nθ). When r = 1, it reduces to (cos θ + i sin θ)ⁿ = cos nθ + i sin nθ. This result can be proved rigorously by mathematical induction for positive integers n, and extended to negative integers and zero using reciprocals and the parity properties of sine and cosine. Understanding the proof itself helps you remember the deeper multiplicative essence: moduli multiply, arguments add.

    定理之所以重要，是因为它把”乘方”这种看似复杂的运算，转化成了两个独立的、更简单的操作：先对模做实数乘方，再对幅角做整数乘法。这一思想会贯穿 Core Pure 2 的多个考点，从求高次幂、推导三角恒等式，一直到求复数的 n 次方根。

    The theorem matters because it turns the seemingly complicated operation of “raising to a power” into two independent, simpler operations: first take a real power of the modulus, then multiply the argument by an integer. This idea runs through several Core Pure 2 topics, from finding high powers and deriving trigonometric identities, all the way to finding the nth roots of a complex number.

    二、用棣莫弗定理求复数的幂：一个三步行法 | Raising Complex Numbers to Powers: A Three-Step Method

    考试中一个非常常见的题型是：已知 z = 1 + i√3，求 z⁶ 或 z¹⁰。直接二项式展开会非常痛苦，而棣莫弗定理给出了一套标准的三步行法。第一步：把 z 写成模-幅角形式。对 z = 1 + i√3，模 r = √(1² + (√3)²) = 2，幅角 θ = arctan(√3/1) = π/3，因此 z = 2(cos π/3 + i sin π/3)。

    A very common exam question is: given z = 1 + i√3, find z⁶ or z¹⁰. Direct binomial expansion would be extremely painful, but De Moivre’s Theorem gives a standard three-step method. Step one: write z in modulus-argument form. For z = 1 + i√3, the modulus is r = √(1² + (√3)²) = 2 and the argument is θ = arctan(√3/1) = π/3, so z = 2(cos π/3 + i sin π/3).

    第二步：对模和幅角分别应用定理。z⁶ = 2⁶(cos(6 × π/3) + i sin(6 × π/3)) = 64(cos 2π + i sin 2π)。第三步：把结果化简回笛卡尔形式。因为 cos 2π = 1 且 sin 2π = 0，所以 z⁶ = 64(1 + 0) = 64。这个答案干净漂亮，整个过程不超过一分钟，而二项式展开 z⁶ 却要展开六项再合并，极易出错。

    Step two: apply the theorem to the modulus and argument separately. z⁶ = 2⁶(cos(6 × π/3) + i sin(6 × π/3)) = 64(cos 2π + i sin 2π). Step three: simplify the result back to Cartesian form. Since cos 2π = 1 and sin 2π = 0, we get z⁶ = 64(1 + 0) = 64. The answer is clean and beautiful, and the whole process takes under a minute, whereas binomial-expanding z⁶ requires expanding and combining six terms, which is extremely error-prone.

    关键技巧在于幅角要处理”转圈”问题。当 nθ 超过 2π 时，cos(nθ) 和 sin(nθ) 会自动给出正确的值，因为三角函数以 2π 为周期。所以即使 z¹⁰ 的幅角是 10π/3，你也无需担心：cos(10π/3) = cos(4π/3)，因为两者相差 2π。养成先把 nθ 减去若干个 2π、落到主值区间 [0, 2π) 再求值的习惯，能避免符号错误。

    The key technique is handling the “winding” of the argument. When nθ exceeds 2π, cos(nθ) and sin(nθ) still give the correct values because the trigonometric functions are periodic with period 2π. So even if the argument of z¹⁰ is 10π/3, you need not worry: cos(10π/3) = cos(4π/3) because the two differ by 2π. Get into the habit of subtracting multiples of 2π from nθ to land in the principal range [0, 2π) before evaluating, and you will avoid sign errors.

    三、指数形式与欧拉公式：三种表示法的统一 | Exponential Form and Euler’s Formula: Unifying the Three Forms

    Core Pure 2 引入了一个更紧凑的记法：指数形式。欧拉公式 e^(iθ) = cos θ + i sin θ 把指数函数与三角函数联系了起来。借助它，模-幅角形式 z = r(cos θ + i sin θ) 可以写成 z = re^(iθ)。这个形式看起来简洁，但在求 n 次方根时威力巨大，因为指数运算的规则可以直接使用。

    Core Pure 2 introduces a more compact notation: the exponential form. Euler’s formula e^(iθ) = cos θ + i sin θ links the exponential function to the trigonometric functions. With it, the modulus-argument form z = r(cos θ + i sin θ) can be written as z = re^(iθ). This form looks elegant, but its real power shows when finding nth roots, because the usual rules of exponents apply directly.

    三种形式各有所长：笛卡尔形式 z = a + bi 最适合加减法；模-幅角形式最适合乘方与理解几何意义；指数形式最适合求根与书写简洁。例如，(re^(iθ))ⁿ = rⁿe^(inθ)，这一行就完整表达了棣莫弗定理，读者一眼就能看出”模取 n 次幂、幅角乘 n”的规则。考试中你应该能在这三种形式之间快速、准确地转换。

    The three forms each have their strengths: the Cartesian form z = a + bi is best for addition and subtraction; the modulus-argument form is best for powers and for understanding geometric meaning; the exponential form is best for finding roots and for concise writing. For example, (re^(iθ))ⁿ = rⁿe^(inθ) expresses De Moivre’s Theorem in a single line, and the reader can see at a glance the rule “raise the modulus to the n, multiply the argument by n”. In the exam you should be able to convert quickly and accurately among all three forms.

    一个常见误区是把 e^(iθ) 当成普通的实数指数来”开方”或”取对数”。要注意，幅角 θ 具有多值性：e^(iθ) = e^(i(θ+2πk)) 对任意整数 k 都成立。这个多值性正是下一节求 n 次方根时会产生 n 个不同根的根本原因，也是学生最容易忽略的细节。

    A common misconception is treating e^(iθ) like an ordinary real exponent and trying to “take roots” or “take logarithms” carelessly. Note that the argument θ is multi-valued: e^(iθ) = e^(i(θ+2πk)) for any integer k. This multi-valued nature is the very reason why finding nth roots produces n distinct roots, as we will see in the next section, and it is the detail students most often overlook.

    四、单位根：解方程 zⁿ = 1 的几何之美 | Roots of Unity: The Geometry of Solving zⁿ = 1

    单位根（roots of unity）是方程 zⁿ = 1 的 n 个解。用指数形式求解非常直接：设 z = re^(iθ)，代入 zⁿ = 1 得 rⁿe^(inθ) = 1 = e^(i·2πk)。比较模得到 rⁿ = 1，故 r = 1（模非负）；比较幅角得到 nθ = 2πk，故 θ = 2πk/n，其中 k = 0, 1, …, n-1。

    The roots of unity are the n solutions to the equation zⁿ = 1. Solving in exponential form is very direct: let z = re^(iθ), substitute into zⁿ = 1 to get rⁿe^(inθ) = 1 = e^(i·2πk). Comparing moduli gives rⁿ = 1, hence r = 1 (the modulus is non-negative); comparing arguments gives nθ = 2πk, hence θ = 2πk/n, where k = 0, 1, …, n-1.

    于是 n 个单位根是 z_k = e^(2πik/n) = cos(2πk/n) + i sin(2πk/n)，k = 0, 1, …, n-1。几何上，它们均匀分布在单位圆上，相邻两根之间的幅角差恒为 2π/n，构成了正 n 边形的顶点。例如 z⁴ = 1 的四个根是 1, i, -1, -i，恰好是单位圆上正方形的四个顶点。这种”旋转对称”的几何图像，是理解单位根求和等于零的关键：n 个对称分布的向量相加，结果自然为零。

    The n roots of unity are therefore z_k = e^(2πik/n) = cos(2πk/n) + i sin(2πk/n), for k = 0, 1, …, n-1. Geometrically, they are evenly spaced around the unit circle, with a constant argument difference of 2π/n between consecutive roots, forming the vertices of a regular n-gon. For example, the four roots of z⁴ = 1 are 1, i, -1, -i, which are exactly the four vertices of a square on the unit circle. This “rotational symmetry” picture is the key to understanding why the sum of the roots of unity is zero: n symmetrically distributed vectors add up to zero.

    单位根还有两个常考性质。第一，所有 n 个单位根之和为 0，即 1 + ω + ω² + … + ωⁿ⁻¹ = 0（ω 为任意 n 次本原单位根）。第二，单位根成对共轭：cos(2πk/n) + i sin(2πk/n) 与 cos(2πk/n) – i sin(2πk/n) 互为共轭，因此它们的乘积为 1、实部相同、虚部相反。这些性质常与复系数多项式、根的对称性等题目结合考查。

    Roots of unity also have two frequently tested properties. First, the sum of all n roots of unity is 0, that is 1 + ω + ω² + … + ωⁿ⁻¹ = 0 (where ω is any primitive nth root of unity). Second, roots of unity come in conjugate pairs: cos(2πk/n) + i sin(2πk/n) and cos(2πk/n) – i sin(2πk/n) are conjugates, so their product is 1, their real parts are equal, and their imaginary parts are opposite. These properties are often combined with questions on complex-coefficient polynomials and symmetry of roots.

    五、一般复数的 n 次方根：模开 n 次方、幅角加 2πk 后平分 | nth Roots of a General Complex Number: Root the Modulus, Divide the Argument

    把单位根的方法推广到一般复数 w = r(cos θ + i sin θ) 的 n 次方根，是 Core Pure 2 的核心计算题。设根为 z = s(cos φ + i sin φ)，由 zⁿ = w 比较模得 sⁿ = r，故 s = r^(1/n)（取正的 n 次方根）；比较幅角得 nφ = θ + 2πk，故 φ = (θ + 2πk)/n，其中 k = 0, 1, …, n-1。

    Generalising the roots-of-unity method to the nth roots of a general complex number w = r(cos θ + i sin θ) is a core calculation in Core Pure 2. Let the root be z = s(cos φ + i sin φ); from zⁿ = w, comparing moduli gives sⁿ = r, so s = r^(1/n) (the positive nth root); comparing arguments gives nφ = θ + 2πk, so φ = (θ + 2πk)/n, where k = 0, 1, …, n-1.

    因此 w 的 n 个 n 次方根是 z_k = r^(1/n)[cos((θ + 2πk)/n) + i sin((θ + 2πk)/n)]，k = 0, 1, …, n-1。记忆口诀是”模开 n 次方，幅角加 2πk 再除以 n”。关键陷阱在于那个 +2πk：许多学生只写出 k = 0 的那一个根，漏掉了其余 n-1 个根。务必记住，方程 zⁿ = w 在复数域内恰好有 n 个根（重根按重数计）。

    The n nth roots of w are therefore z_k = r^(1/n)[cos((θ + 2πk)/n) + i sin((θ + 2πk)/n)], for k = 0, 1, …, n-1. A useful mnemonic is “root the modulus, add 2πk to the argument and divide by n”. The key trap is that +2πk term: many students write only the k = 0 root and miss the other n-1 roots. Always remember that the equation zⁿ = w has exactly n roots over the complex numbers (counting multiplicity).

    几何上，这 n 个根都落在以原点为圆心、半径为 r^(1/n) 的圆上，且等间距分布，相邻根之间的幅角差为 2π/n。换句话说，它们把以原点为圆心、半径 r^(1/n) 的圆”均匀分割”成 n 段圆弧。这个几何图像可以用来快速检查答案：如果你算出的几个根没有等距分布在同一个圆上，那一定是哪里算错了。

    Geometrically, these n roots all lie on the circle centred at the origin with radius r^(1/n), and are equally spaced, with an argument difference of 2π/n between consecutive roots. In other words, they evenly divide the circle of radius r^(1/n) into n equal arcs. This geometric picture can be used to check your answer quickly: if the roots you calculated are not equally spaced on a single circle, then something has gone wrong.

    六、复平面中的轨迹：垂直平分线、圆与半直线 | Loci in the Complex Plane: Perpendicular Bisectors, Circles and Half-Lines

    轨迹（loci）问题是 Core Pure 2 的另一个高频考点，考查的是复数的几何意义。最常见的三类轨迹如下。第一类，|z – a| = r 表示以点 a 为圆心、半径为 r 的圆，因为 |z – a| 恰好是 z 到 a 的距离。第二类，|z – a| = |z – b| 表示线段 ab 的垂直平分线，因为它描述的是”到两点距离相等”的点集。

    Locus problems are another high-frequency topic in Core Pure 2, testing the geometric meaning of complex numbers. The three most common types of locus are as follows. Type one, |z – a| = r, represents the circle centred at a with radius r, because |z – a| is exactly the distance from z to a. Type two, |z – a| = |z – b|, represents the perpendicular bisector of the segment ab, because it describes the set of points equidistant from two given points.

    第三类，arg(z – a) = θ 表示从点 a 出发、与正实轴成角 θ 的一条半直线（不含起点 a 本身）。此外还有区间形式，如 arg(z) 介于两个角之间表示一个扇形区域，|z – a| < r 表示圆内部的区域（不含边界）。理解这些轨迹的关键，是把 |z - a| 读作"距离"、把 arg(z - a) 读作"方向角"。

    Type three, arg(z – a) = θ, represents a half-line starting from the point a and making an angle θ with the positive real axis (excluding the starting point a itself). There are also interval forms, such as arg(z) lying between two angles representing a sector region, and |z – a| < r representing the interior of the circle (excluding the boundary). The key to understanding these loci is to read |z - a| as "distance" and arg(z - a) as "direction angle".

    典型综合题会要求你先求某条件对应的轨迹，再找出轨迹上的最值点或交点。例如”求满足 |z – 3| = 2 的 z 中，模最大的那个 z”：轨迹是圆心 3、半径 2 的圆，到原点距离最大的点就是圆上离原点最远的点，即 z = 5。把代数条件翻译成几何图像，往往比直接做代数运算更快、更直观。

    A typical composite question asks you to first find the locus corresponding to a condition, then find the extremum point or intersection point on that locus. For example, “find the z satisfying |z – 3| = 2 that has the largest modulus”: the locus is the circle centred at 3 with radius 2, and the point farthest from the origin is the point on the circle furthest from the origin, namely z = 5. Translating an algebraic condition into a geometric picture is often faster and more intuitive than doing the algebra directly.

    七、考试技巧：Core Pure 2 棣莫弗定理的常见失分点 | Exam Technique: Common Pitfalls with De Moivre’s Theorem in Core Pure 2

    第一，幅角主值的选择。arg z 通常取主值区间 (-π, π]，但求 n 次方根时必须回到”一般幅角” θ + 2πk，否则会漏根。第二，忘记模的 n 次方根要用正的实数根 r^(1/n)，而不是带符号的根。第三，三角函数的特殊值记错，例如 cos π/3 = 1/2、sin π/6 = 1/2，这些基本功错误在压轴题里尤其致命。

    First, the choice of principal argument. The argument arg z is usually taken in the principal range (-π, π], but when finding nth roots you must return to the “general argument” θ + 2πk, otherwise you will miss roots. Second, forgetting that the nth root of the modulus should be the positive real root r^(1/n), not a signed root. Third, misremembering special trigonometric values, such as cos π/3 = 1/2 and sin π/6 = 1/2; these basic errors are especially fatal in the harder final questions.

    第四，用棣莫弗定理推导三角恒等式时的方向选择。典型题型是”用棣莫弗定理把 cos 5θ 表示成 cos θ 的多项式”，方法是展开 (cos θ + i sin θ)⁵ 并取实部；反过来”把 cos⁵θ 表示成 cos θ 的倍角之和”则要用 z + 1/z = 2cos θ 这个代换。两个方向都要熟练。第五，最后答案要按要求的形式呈现，评分标准常要求精确值或根式形式，而不是保留一堆小数。

    Fourth, the direction choice when using De Moivre’s Theorem to derive trigonometric identities. A typical question is “use De Moivre’s Theorem to express cos 5θ as a polynomial in cos θ”, done by expanding (cos θ + i sin θ)⁵ and taking the real part; conversely, “express cos⁵θ as a sum of multiple-angle terms in cos θ” uses the substitution z + 1/z = 2cos θ. You should be fluent in both directions. Fifth, present the final answer in the required form; the mark scheme often asks for exact values or surd form rather than a string of decimals.

    最后，把 n 次方根写完整。标准写法要明确写出 k = 0, 1, …, n-1 的全体根，并用一句话说明这些根等距分布在半径为 r^(1/n) 的圆上。完整、清晰的表达不仅避免漏解扣分，也能在检查时帮你快速发现计算错误。平时练习时建议逐题画出根在复平面上的位置，养成几何直觉。

    Finally, write out the nth roots completely. The standard presentation should explicitly list all the roots for k = 0, 1, …, n-1, and include a sentence noting that these roots are equally spaced on the circle of radius r^(1/n). Complete, clear presentation not only avoids losing marks for missing solutions, but also helps you spot calculation errors quickly when checking. In daily practice, it is recommended to sketch the position of the roots on the complex plane for each problem, to build geometric intuition.

    八、用棣莫弗定理推导倍角公式：实部虚部分离法 | Deriving Multiple-Angle Formulas with De Moivre’s Theorem: Separating Real and Imaginary Parts

    棣莫弗定理的另一个经典用途是推导三角恒等式。以 cos 3θ 和 sin 3θ 为例，由定理可知 (cos θ + i sin θ)³ = cos 3θ + i sin 3θ。把左边按二项式展开：(cos θ + i sin θ)³ = cos³θ + 3cos²θ(i sin θ) + 3cos θ(i sin θ)² + (i sin θ)³。

    Another classic use of De Moivre’s Theorem is deriving trigonometric identities. Take cos 3θ and sin 3θ as an example; the theorem gives (cos θ + i sin θ)³ = cos 3θ + i sin 3θ. Expand the left side using the binomial theorem: (cos θ + i sin θ)³ = cos³θ + 3cos²θ(i sin θ) + 3cos θ(i sin θ)² + (i sin θ)³.

    利用 i² = -1 化简，得到 cos³θ + 3i cos²θ sin θ – 3cos θ sin²θ – i sin³θ。现在分别比较实部与虚部：实部给出 cos 3θ = cos³θ – 3cos θ sin²θ；虚部给出 sin 3θ = 3cos²θ sin θ – sin³θ。再用 sin²θ = 1 – cos²θ 代换，就能得到教材中的标准形式 cos 3θ = 4cos³θ – 3cos θ。

    Using i² = -1 to simplify, we get cos³θ + 3i cos²θ sin θ – 3cos θ sin²θ – i sin³θ. Now compare the real and imaginary parts separately: the real part gives cos 3θ = cos³θ – 3cos θ sin²θ, and the imaginary part gives sin 3θ = 3cos²θ sin θ – sin³θ. Then substituting sin²θ = 1 – cos²θ yields the standard textbook form cos 3θ = 4cos³θ – 3cos θ.

    这个方法的核心思路是”实部虚部分离”：先用棣莫弗定理把一个复数的 n 次方等于另一个复数，再把两边都化成 a + bi 的形式，最后让实部对实部、虚部对虚部。对于更高次的情形，如 cos 5θ，二项式展开会变长，但方法完全相同。掌握这一套路后，任何倍角公式都能自行推导，无需死记硬背。

    The core idea of this method is “separating real and imaginary parts”: first use De Moivre’s Theorem to equate a complex number raised to the n with another complex number, then rewrite both sides in a + bi form, and finally match real parts to real parts and imaginary parts to imaginary parts. For higher powers, such as cos 5θ, the binomial expansion grows longer but the method is identical. Once you master this routine, you can derive any multiple-angle formula yourself, with no need to memorise them.

    九、完整例题：求 z³ = -8 的全部根 | Worked Example: Finding All Roots of z³ = -8

    下面通过一道完整例题巩固整个流程。求方程 z³ = -8 的全部根。第一步，把右边写成模-幅角形式：-8 = 8(cos π + i sin π)，因此 r = 8、θ = π。第二步，套用求根公式 z_k = r^(1/n)[cos((θ + 2πk)/n) + i sin((θ + 2πk)/n)]，其中 n = 3。

    Let us consolidate the whole process with a complete worked example. Find all roots of the equation z³ = -8. Step one: write the right side in modulus-argument form, -8 = 8(cos π + i sin π), so r = 8 and θ = π. Step two: apply the root formula z_k = r^(1/n)[cos((θ + 2πk)/n) + i sin((θ + 2πk)/n)], with n = 3.

    先算模的立方根：8^(1/3) = 2。于是 z_k = 2[cos((π + 2πk)/3) + i sin((π + 2πk)/3)]。分别取 k = 0, 1, 2：当 k = 0 时，z₀ = 2(cos π/3 + i sin π/3) = 2(1/2 + i√3/2) = 1 + i√3；当 k = 1 时，z₁ = 2(cos π + i sin π) = 2(-1 + 0) = -2；当 k = 2 时，z₂ = 2(cos 5π/3 + i sin 5π/3) = 2(1/2 – i√3/2) = 1 – i√3。

    First compute the cube root of the modulus: 8^(1/3) = 2. Hence z_k = 2[cos((π + 2πk)/3) + i sin((π + 2πk)/3)]. Taking k = 0, 1, 2 in turn: for k = 0, z₀ = 2(cos π/3 + i sin π/3) = 2(1/2 + i√3/2) = 1 + i√3; for k = 1, z₁ = 2(cos π + i sin π) = 2(-1 + 0) = -2; for k = 2, z₂ = 2(cos 5π/3 + i sin 5π/3) = 2(1/2 – i√3/2) = 1 – i√3.

    因此 z³ = -8 的三个根是 1 + i√3、-2、1 – i√3。验证一下：这三个根都落在以原点为圆心、半径为 2 的圆上，且相邻两根的幅角差都是 2π/3，均匀分布，符合”n 次方程有 n 个等距分布的根”的几何规律。在答题纸上完整写出这三个根并配上一句几何说明，就是满分作答的标准。

    The three roots of z³ = -8 are therefore 1 + i√3, -2, and 1 – i√3. As a check, all three roots lie on the circle centred at the origin with radius 2, and consecutive roots differ in argument by 2π/3, so they are evenly spaced, consistent with the geometric rule that an nth-degree equation has n equally spaced roots. Writing out these three roots in full, together with a one-sentence geometric remark, is the standard for a full-mark answer.

    Summary | 总结

    本文围绕 Edexcel 进阶数学 Core Pure 2 的棣莫弗定理与单位根主题，系统梳理了核心方法与考点。棣莫弗定理 [r(cos θ + i sin θ)]ⁿ = rⁿ(cos nθ + i sin nθ) 把复数的乘方拆成”模取 n 次幂、幅角乘 n”两个独立操作，是求高次幂和推导三角恒等式的利器。

    This article has systematically organised the core methods and exam points around De Moivre’s Theorem and roots of unity in Edexcel Further Maths Core Pure 2. De Moivre’s Theorem, [r(cos θ + i sin θ)]ⁿ = rⁿ(cos nθ + i sin nθ), splits raising a complex number to a power into two independent operations: raising the modulus to the nth power and multiplying the argument by n. It is a powerful tool for finding high powers and deriving trigonometric identities.

    欧拉公式 e^(iθ) = cos θ + i sin θ 引出了指数形式 z = re^(iθ)，它与笛卡尔形式、模-幅角形式共同构成三种等价表示。求 n 次方根时，牢记”模开 n 次方、幅角加 2πk 后除以 n”的规则，就能完整写出 k = 0, 1, …, n-1 的 n 个根，它们等距分布在半径为 r^(1/n) 的圆上。

    Euler’s formula e^(iθ) = cos θ + i sin θ leads to the exponential form z = re^(iθ), which together with the Cartesian form and the modulus-argument form makes three equivalent representations. When finding nth roots, remember the rule “root the modulus, add 2πk to the argument and divide by n”, and you can write out all n roots for k = 0, 1, …, n-1, equally spaced on the circle of radius r^(1/n).

    轨迹问题则把代数条件翻译为几何图像：|z – a| = r 是圆，|z – a| = |z – b| 是垂直平分线，arg(z – a) = θ 是半直线。掌握这些对应关系，配合特殊角的三角函数值，就能在考试中又快又稳地完成 Core Pure 2 的复数压轴题。

    Locus problems translate algebraic conditions into geometric pictures: |z – a| = r is a circle, |z – a| = |z – b| is a perpendicular bisector, and arg(z – a) = θ is a half-line. With these correspondences in hand, along with the special-angle trigonometric values, you can tackle the complex-number final questions of Core Pure 2 quickly and reliably in the exam.

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

  • Decision Mathematics 1 (D1): Graph Algorithms for Minimum Spanning Trees and Shortest Paths — 决策数学1(D1)：最小生成树与最短路径的图论算法

    一、什么是决策数学：从算法思维出发 | What Is Decision Mathematics: Starting from Algorithmic Thinking

    决策数学（Decision Mathematics，简称 D1）是 Edexcel A-Level 进阶数学（Further Mathematics）中一门非常独特的模块。它与纯数学（Pure Mathematics）处理连续函数、极限和微积分不同，也与力学（Mechanics）研究运动和受力不同，决策数学研究的是”如何用明确的步骤解决离散问题”。这类问题的核心不是”计算一个数值”，而是”设计一个过程”：给定一堆数据或一个网络，找到最优解或者可行的解。

    Decision Mathematics (D1) is a distinctive module within Edexcel A-Level Further Mathematics. Unlike Pure Mathematics, which deals with continuous functions, limits and calculus, and unlike Mechanics, which studies motion and forces, Decision Mathematics is concerned with “how to solve discrete problems using explicit steps.” The core of these problems is not “compute a value” but “design a procedure”: given a set of data or a network, find an optimal solution or a feasible solution.

    在这门课里，你会反复遇到一个关键词：算法（algorithm）。算法是一组可以一步一步执行的、明确而有限的指令。例如，把一副扑克牌按从小到大的顺序排好，你可以用冒泡排序（bubble sort），也可以用快速排序（quick sort）；从一张地铁线路图里找出从 A 站到 B 站的最短乘车路线，你可以用 Dijkstra 算法。掌握决策数学，本质上是学会”像计算机一样思考”，并把这种思考用人类能检查的方式写在答题纸上。

    In this module you will meet one keyword again and again: the algorithm. An algorithm is a finite, unambiguous set of instructions that can be carried out step by step. For example, to sort a deck of cards into ascending order you can use bubble sort or quick sort; to find the shortest route from station A to station B on a metro map you can use Dijkstra’s algorithm. Mastering Decision Mathematics is essentially learning to “think like a computer” while writing your thinking in a way an examiner can check on paper.

    Edexcel 的 D1 考试非常强调”过程”。一道最小生成树（Minimum Spanning Tree）或者最短路径（Shortest Path）的题目，即使你写出了正确的最终答案，只要中间的排序、选边或者标号过程有一步顺序错误，就会被扣分。因此，理解每一个算法”为什么这样走”比死记步骤更重要。本文聚焦 D1 中最常考、也最容易被扣分的图论算法：Kruskal、Prim 和 Dijkstra，并从”图与网络”的基础概念讲起。

    Edexcel D1 exams place heavy emphasis on process. For a Minimum Spanning Tree or Shortest Path question, even if you write down the correct final answer, you will lose marks if any intermediate step of sorting, edge-selection or labelling is out of order. Therefore, understanding “why each algorithm moves the way it does” matters more than memorising steps. This article focuses on the graph-theory algorithms that are most frequently examined and most often penalised in D1: Kruskal, Prim and Dijkstra, starting from the basic concepts of graphs and networks.

    二、图与网络的基本结构：顶点、边、权与树 | Graphs and Networks: Vertices, Edges, Weights and Trees

    在决策数学里，一个”图”（graph）由两个集合组成：顶点（vertices 或 nodes）的集合，以及连接这些顶点的边（edges 或 arcs）的集合。顶点通常用大写字母表示，例如 A、B、C、D；每条边连接两个顶点，可以带有一个数字，这个数字叫”权”（weight）。权可以表示距离、时间、成本或者任何你希望最小化的量。带权的图就叫”网络”（network）。

    In Decision Mathematics a graph consists of two sets: a set of vertices (nodes) and a set of edges (arcs) joining them. Vertices are usually written with capital letters, for example A, B, C, D; each edge joins two vertices and may carry a number called its weight. The weight can represent distance, time, cost or any quantity you wish to minimise. A weighted graph is called a network.

    有几类特殊的图需要牢牢记住。第一，”简单图”（simple graph）中任意两个顶点之间最多只有一条边，且没有连接某个顶点到它自己的”环”（loop）。第二，”有向图”（digraph 或 directed graph）中的边有方向，用箭头表示，例如表示”从 A 出发、沿单行道到达 B”；而”无向图”中的边可以双向通行。第三，”树”（tree）是一种特殊的连通图：它把所有的顶点都连在一起，但不存在任何回路（cycle）。树在 D1 中极为重要，因为最小生成树本质上就是”权最小的树”。

    Several special kinds of graph must be remembered. First, in a simple graph there is at most one edge between any two vertices and no loop joining a vertex to itself. Second, a directed graph (digraph) has edges with directions, shown by arrows, for example representing “travel from A along a one-way street to B”; in an undirected graph the edges can be traversed in both directions. Third, a tree is a special connected graph: it joins all the vertices together but contains no cycles. Trees matter enormously in D1, because a minimum spanning tree is essentially “the tree of smallest total weight.”

    另外一个反复出现的概念是顶点的”度”（degree）：就是与该顶点相连的边的条数。例如，如果一个顶点连接了 3 条边，它的度就是 3。度在判断一个图能否构成树、以及在”路线检查”（route inspection）等问题里都很有用。理解了这些术语，我们就可以进入 D1 的核心问题：在给定网络里，如何用最小的总代价把全部顶点连接起来。

    Another recurring concept is the degree of a vertex: the number of edges incident to it. If a vertex has three edges attached, its degree is 3. Degree is useful when deciding whether a graph can form a tree, and in problems such as route inspection. Once you understand these terms, we can move to the central question of D1: given a network, how do we connect all the vertices at minimum total cost?

    三、最小生成树问题：用最小的总代价连接所有顶点 | The Minimum Spanning Tree Problem: Connecting All Vertices at Minimum Cost

    设想你要为一片新开发区铺设水管，把几个居民点全部连到同一个供水系统里。管道可以沿居民点之间的道路铺设，每条道路的铺设成本不同。你的任务是：让所有居民点都连在一起（不要求每一对居民点之间都有直接管道，只要通过管网彼此可达即可），同时让总成本尽可能低。这就是”最小生成树”（Minimum Spanning Tree，简称 MST）问题。

    Imagine you are laying water pipes in a new housing estate so that several settlements are all joined to one supply system. Pipes can run along roads between the settlements, and each road has a different laying cost. Your task is to connect all the settlements together (you do not need a direct pipe between every pair, only that they are all reachable through the network) while keeping the total cost as low as possible. This is the Minimum Spanning Tree (MST) problem.

    最小生成树有两条必须同时满足的性质。第一，它必须是”生成”的（spanning）：图中每一个顶点都必须被包含进来。第二，它必须是”树”（tree）：连通且没有回路。一个包含 n 个顶点的树恰好有 n − 1 条边，这是一个非常方便的检查条件：如果你最终画出的 MST 边数不是 n − 1，那一定算错了。第三，它必须是”最小”的：所有可能生成树中，它的边的总权最小。

    A minimum spanning tree must satisfy two properties at the same time. First, it must be spanning: every vertex of the graph must be included. Second, it must be a tree: connected and cycle-free. A tree on n vertices has exactly n − 1 edges, which is a very convenient check: if the MST you finally draw does not have n − 1 edges, something is wrong. Third, it must be minimal: among all possible spanning trees, its total edge weight is the smallest.

    注意，最小生成树在”总权最小”的意义下是唯一的，但在”具体选了哪些边”上可能不唯一：当网络里有若干条边权相等时，可能存在多个总权相同的最小生成树。考试时，只要边的总权正确、边数为 n − 1、且连通无回路，通常就能拿到满分，即使你选择的边和答案示例不完全一样。Edexcel 的评分标准要求你展示”选边的顺序”，因此接下来我们要学习的 Kruskal 和 Prim 两种算法，本质上就是两种”系统地挑选最小权边”的方法。

    Note that the MST is unique in the sense of “minimum total weight” but not necessarily unique in the specific edges chosen: when several edges have equal weight, there can be several MSTs with the same total. In an exam, as long as the total weight is correct, the number of edges is n − 1, and the result is connected and cycle-free, you will normally get full marks even if your chosen edges differ from a sample answer. Edexcel mark schemes require you to show the order in which you select edges, so the two algorithms we now study, Kruskal and Prim, are essentially two ways of “systematically picking the smallest-weight edges.”

    四、Kruskal 算法：按边权从小到大排序、逐个连接 | Kruskal’s Algorithm: Sort Edges by Weight and Join Them One by One

    Kruskal 算法的思路非常直观：既然我们要总权最小，那就先把所有的边按权从小到大排好，然后从最小的边开始，一条一条地加入。唯一要遵守的规则是”不要形成回路”：如果一条边会把已经连起来的两个顶点再次连在一起（也就是会形成回路），就跳过它。重复这个过程，直到选满 n − 1 条边为止。

    The idea behind Kruskal’s algorithm is very intuitive: since we want the smallest total weight, first sort all the edges in ascending order of weight, then add them one by one starting from the smallest. The only rule to obey is “do not form a cycle”: if an edge would reconnect two vertices that are already joined (that is, it would close a cycle), skip it. Repeat until exactly n − 1 edges have been chosen.

    我们用一个具体例子来说明。考虑一个有 5 个顶点 A、B、C、D、E 的网络，边的权如下（单位忽略）：AB = 3，AE = 1，BC = 5，BE = 4，CE = 2，CD = 7，DE = 6。首先按权从小到大排序：AE(1)、CE(2)、AB(3)、BE(4)、BC(5)、DE(6)、CD(7)。然后逐个检查并选边。

    Let us illustrate with a concrete example. Consider a network on 5 vertices A, B, C, D, E with the following edge weights: AB = 3, AE = 1, BC = 5, BE = 4, CE = 2, CD = 7, DE = 6. First sort the edges in ascending order: AE(1), CE(2), AB(3), BE(4), BC(5), DE(6), CD(7). Then examine and select edges one at a time.

    步骤 Step 考虑的边 Edge 权 Weight 是否选入 Included? 理由 Reason
    1 AE 1 是 Yes 不形成回路 No cycle
    2 CE 2 是 Yes 不形成回路 No cycle
    3 AB 3 是 Yes 不形成回路 No cycle
    4 BE 4 否 No 会形成回路 A-B-E-A Would form cycle A-B-E-A
    5 BC 5 否 No 会形成回路 A-B-C-E-A Would form cycle
    6 DE 6 是 Yes 不形成回路，边数已满 4 条 No cycle, 4 edges reached

    最终选入的边是 AE、CE、AB、DE，共 4 条（n − 1 = 4），总权为 1 + 2 + 3 + 6 = 12。检查：5 个顶点全部连通，没有任何回路，边数正好是 4，因此这就是最小生成树。注意 BE 和 BC 被跳过是因为它们会形成回路，而不是因为它们的权比某些已选边更大。

    The edges finally chosen are AE, CE, AB and DE, four edges in total (n − 1 = 4), with total weight 1 + 2 + 3 + 6 = 12. Check: all five vertices are connected, there is no cycle, and the edge count is exactly 4, so this is the minimum spanning tree. Note that BE and BC were skipped because they would create a cycle, not because their weights are larger than some chosen edge.

    考试时展示 Kruskal 的关键是：第一，先把所有边按权排序写出来（这是得分点）；第二，按顺序一条条列出来，明确写出”选”还是”拒”，并对拒绝的边给出”形成回路”的理由；第三，最后写出总权和边的数量。千万不要只画一张图了事，排序列表和拒绝理由正是 Edexcel 评分标准里”方法分”的来源。

    The keys to presenting Kruskal in an exam are: first, write out the sorted list of all edges by weight (this earns method marks); second, list them one by one, clearly writing “choose” or “reject”, giving the reason “would form a cycle” for rejected edges; third, finish with the total weight and the number of edges. Never just draw a diagram and stop: the sorted list and the rejection reasons are exactly where the Edexcel mark scheme awards method marks.

    五、Prim 算法：从一个顶点出发、向外生长的树 | Prim’s Algorithm: Grow the Tree Outward from a Single Vertex

    Prim 算法走的是另一条路：它不先给所有边排序，而是”从内部向外生长”。你先任意选择一个起始顶点，把它加入树中；然后反复执行这样一步：在所有”一端在树内、另一端在树外”的边中，选出权最小的那一条，把树外的那个顶点和这条边一起加入树中。重复，直到所有顶点都进入树里。

    Prim’s algorithm takes a different route: rather than sorting all edges first, it grows “from the inside outward”. You first choose any starting vertex and add it to the tree; then repeatedly perform this step: among all edges with one end inside the tree and the other end outside, choose the one of smallest weight, and add both that outside vertex and that edge to the tree. Repeat until every vertex is in the tree.

    Prim 有两个常见变体：基于顶点矩阵的”表格形式”（matrix form），以及基于网络的”图形形式”（graphical form）。表格形式适合顶点很多、但网络是完整图（每对顶点之间都有边）的情形，它用一个不断增大的表格记录”已选边”和”候选边的权”。考试中 Edexcel 通常要求你明确采用其中一种形式，并保持格式一致。

    Prim has two common variants: the matrix (tabular) form based on a table of vertices, and the graphical form based on the network. The matrix form suits cases with many vertices where the network is complete (an edge between every pair); it records “chosen edges” and “candidate edge weights” in a growing table. In exams Edexcel usually asks you to use one specific form and to keep the format consistent.

    还是用上一节的同一个网络做例子，这次从顶点 A 开始。树内初始只有 {A}。候选边中，连接 A 到树外顶点的只有 AB(3) 和 AE(1)，最小的权是 1，所以选 AE，把 E 加入树中。现在树内是 {A, E}，候选边变为：AB(3)、EB(4)、EC(2)、ED(6)，最小的是 EC(2)，选 CE，把 C 加入。树内是 {A, E, C}，候选边为：AB(3)、EB(4)、CB(5)、CD(7)、ED(6)，最小的是 AB(3)，选 AB，把 B 加入。最后树内是 {A, E, C, B}，候选边为 CB(5)、CD(7)、ED(6)，最小的是 ED(6)，选 DE，把 D 加入。全部 5 个顶点都进入树中，结束。

    Let us reuse the same network from the previous section, this time starting from vertex A. Initially the tree contains only {A}. Among the candidate edges, those joining A to outside vertices are AB(3) and AE(1); the smallest weight is 1, so we choose AE and add E to the tree. Now the tree is {A, E}, and the candidates are AB(3), EB(4), EC(2) and ED(6); the smallest is EC(2), so we choose CE and add C. The tree is {A, E, C}, with candidates AB(3), EB(4), CB(5), CD(7) and ED(6); the smallest is AB(3), so we choose AB and add B. Finally the tree is {A, E, C, B}, with candidates CB(5), CD(7) and ED(6); the smallest is ED(6), so we choose DE and add D. All five vertices are now in the tree, so we stop.

    Prim 最终选入的边也是 AE、CE、AB、DE，总权同样是 12。这印证了一个重要事实：无论用 Kruskal 还是 Prim，只要网络的最小生成树总权唯一，两种算法都会得到相同的总权；不同的只是选边的顺序和思考方式。考试时如果题目要求”用 Prim 算法”，你必须从指定的（或你声明的）起始顶点开始，并清楚地列出每一步的候选边和所选边。

    Prim’s final edge set is also AE, CE, AB and DE, with the same total weight of 12. This confirms an important fact: whether you use Kruskal or Prim, as long as the MST total weight is unique, both algorithms yield the same total weight; they differ only in the order of selection and the way of thinking. In an exam, if the question says “use Prim’s algorithm”, you must start from the specified (or your declared) starting vertex and clearly list the candidate edges and the chosen edge at every step.

    六、Dijkstra 算法：单源最短路径的标号法 | Dijkstra’s Algorithm: The Labelling Method for Shortest Paths

    最小生成树解决的是”用最小总代价把大家连起来”，而 Dijkstra 算法解决的是另一个问题：”从一个指定的起点，到图中每一个顶点的最短路径是多长”。这在现实里对应着导航软件、物流调度、网络路由等场景。Dijkstra 只适用于”边权非负”的网络（这也是 D1 考试中的默认情形），并且要求网络通常是无向的或者已被处理成合适的形式。

    The MST problem answers “how to connect everyone at minimum total cost”, whereas Dijkstra’s algorithm answers a different question: “from one specified start vertex, what is the shortest path to every other vertex in the graph?” In real life this corresponds to navigation software, logistics scheduling and network routing. Dijkstra only applies to networks with non-negative edge weights (the default situation in D1 exams), and the network is usually undirected or already prepared into a suitable form.

    Dijkstra 的核心是”标号”（labelling）。每个顶点都会得到一个标签，形如 (距离, 前驱顶点)，表示”目前已知的、从起点到达该顶点的最短距离，以及这条最短路径上紧邻它的前一个顶点”。算法开始时，起点被标为 (0, −)，其余所有顶点被标为”暂时无穷大”。然后重复”松弛”（relax）过程：每次从未确定（temporary）的顶点中选出距离最小的一个，把它变成确定（permanent），再检查通过它能否让它的邻居获得更短的距离，如果能，就更新邻居的标签。

    The heart of Dijkstra is labelling. Each vertex receives a label of the form (distance, previous vertex), meaning “the shortest distance currently known from the start to this vertex, together with the vertex immediately before it on that path”. At the start, the source vertex is labelled (0, −) and every other vertex is labelled “temporarily infinite”. Then the relaxation process repeats: each time, among the temporary vertices choose the one with the smallest distance and make it permanent; then check whether travelling through it can give its neighbours a shorter distance, and if so, update those neighbours’ labels.

    我们用一个例子完整地走一遍。考虑网络：A 为起点，边为 AB = 4，AC = 2，BC = 1，BD = 5，CD = 8，CE = 10，DE = 2，其中 A、B、C、D、E 为顶点。初始标签：A(0, −)，其余均为 (∞, −)。第一步，把 A 确定为永久，松弛 A 的邻居：B 变为 (4, A)，C 变为 (2, A)。第二步，未确定顶点中距离最小的是 C(2)，把 C 永久化，松弛 C 的邻居：通过 C 到 B 的距离为 2 + 1 = 3，比 B 当前的 4 更小，所以 B 更新为 (3, C)；通过 C 到 D 为 2 + 8 = 10，D 更新为 (10, C)；通过 C 到 E 为 2 + 10 = 12，E 更新为 (12, C)。

    Let us walk through an example fully. Consider a network with A as the source, and edges AB = 4, AC = 2, BC = 1, BD = 5, CD = 8, CE = 10, DE = 2, with vertices A, B, C, D, E. Initial labels: A(0, −), all others (∞, −). Step 1, make A permanent and relax A’s neighbours: B becomes (4, A) and C becomes (2, A). Step 2, among temporary vertices the smallest distance is C(2), so make C permanent and relax C’s neighbours: via C the distance to B is 2 + 1 = 3, smaller than B’s current 4, so B updates to (3, C); via C to D is 2 + 8 = 10, so D updates to (10, C); via C to E is 2 + 10 = 12, so E updates to (12, C).

    第三步，未确定顶点中最小的是 B(3)，把 B 永久化，松弛 B 的邻居：通过 B 到 D 为 3 + 5 = 8，比 D 当前的 10 更小，D 更新为 (8, B)。第四步，最小的是 D(8)，把 D 永久化，松弛 D 的邻居：通过 D 到 E 为 8 + 2 = 10，比 E 当前的 12 更小，E 更新为 (10, D)。第五步，只剩 E(10)，把 E 永久化。算法结束。最终最短距离：A=0，C=2，B=3，D=8，E=10。

    Step 3, the smallest temporary vertex is B(3), so make B permanent and relax B’s neighbours: via B to D is 3 + 5 = 8, smaller than D’s current 10, so D updates to (8, B). Step 4, the smallest is D(8), so make D permanent and relax D’s neighbours: via D to E is 8 + 2 = 10, smaller than E’s current 12, so E updates to (10, D). Step 5, only E(10) remains, so make E permanent. The algorithm ends. Final shortest distances: A = 0, C = 2, B = 3, D = 8, E = 10.

    要还原某条最短路径本身，只需从目标顶点沿着”前驱”标签一路回溯到起点。例如 E 的最短路径：E 的前驱是 D，D 的前驱是 B，B 的前驱是 C，C 的前驱是 A，所以 A 到 E 的最短路径是 A → C → B → D → E，总长 10。回溯时要特别注意标签的前驱字段是否在后面的松弛中已被更新，必须用最终的标签来回溯。

    To recover the actual shortest path, simply trace back from the target vertex through the “previous vertex” labels to the source. For example, the shortest path to E: E’s previous is D, D’s previous is B, B’s previous is C, C’s previous is A, so the shortest path from A to E is A → C → B → D → E with total length 10. When tracing back, be careful that a label’s previous-vertex field may have been updated by later relaxations; you must trace using the final labels.

    七、三种算法的对比与考试易错点 | Comparing the Three Algorithms and Common Exam Pitfalls

    把三个算法放在一起对比，能帮你更清楚地记住它们各自的适用场景。Kruskal 和 Prim 都属于”求最小生成树”，目标是连通所有顶点且总权最小，最终得到 n − 1 条边、无回路；而 Dijkstra 属于”求最短路径”，目标是给出从单个起点到每个顶点的最短距离，结果不是树而是一组”距离 + 前驱”标签。用错算法是 D1 最常见的失分原因之一。

    Placing the three algorithms side by side helps you remember when to use each. Kruskal and Prim both solve the MST problem: the goal is to connect all vertices at minimum total weight, producing n − 1 edges with no cycles. Dijkstra, by contrast, solves the shortest-path problem: the goal is the shortest distance from a single source to every vertex, and the result is not a tree but a set of “distance + previous” labels. Using the wrong algorithm is one of the most common causes of lost marks in D1.

    维度 Aspect Kruskal Prim Dijkstra
    目标 Goal 最小生成树 MST 最小生成树 MST 单源最短路径 Shortest path
    起点 Start 不需要 Not needed 任选或指定 Any or specified 指定起点 Specified source
    输出 Output n − 1 条边 n − 1 edges n − 1 条边 n − 1 edges 距离 + 前驱标签 Labels
    关键操作 Key action 先排序再选边 Sort then pick 从树内向外选最小边 Grow outward 永久化 + 松弛 Permanent + relax
    限制 Constraint 不得形成回路 No cycle 不得形成回路 No cycle 边权非负 Non-negative weights

    考试中还有几个高频易错点需要特别注意。第一，Kruskal 里排序一定要”从小到大完整列出”，漏掉排序列表会被扣方法分；拒绝边的理由必须写”形成回路”（would form a cycle），不能只写”跳过”。第二，Prim 里每一步都要写清楚”当前候选边有哪些、选了哪条”，否则过程分拿不全；如果题目指定了起始顶点，一定要从它开始。第三，Dijkstra 里”永久化”和”松弛”两个动作不能混在一起，必须先把距离最小的顶点永久化，再更新它的邻居；更新邻居时，只有得到”更小”的距离才改标签，相等或更大都不改。

    There are several high-frequency pitfalls to watch in exams. First, in Kruskal you must write the full sorted list in ascending order; omitting it loses method marks. The reason for a rejected edge must be “would form a cycle”, not just “skip”. Second, in Prim you must state clearly at every step which candidate edges exist and which one was chosen, otherwise you lose process marks; if the question specifies a starting vertex, start from it. Third, in Dijkstra “making permanent” and “relaxing” must not be mixed: you must first make permanent the vertex with the smallest distance, then update its neighbours; when updating, change a label only if you obtain a strictly smaller distance, not when it is equal or larger.

    还有一个非常实用的检查技巧：无论哪种图论算法，做完后都花十秒钟做一遍”合理性检查”。最小生成树检查边数是否等于 n − 1、是否连通、是否无回路；Dijkstra 检查每个顶点的最终距离是否小于或等于任何”绕路”得到的距离（三角形不等式）。这些检查往往能在一眼之间发现漏选边、误选边或者标号顺序错误，是考场上的最后一道防线。

    One more very useful checking technique: after any graph algorithm, spend ten seconds on a sanity check. For the MST, check that the edge count equals n − 1, that it is connected, and that it is cycle-free. For Dijkstra, check that every vertex’s final distance is at most the distance obtained by any detour (the triangle inequality). These checks often spot a missing edge, a wrongly chosen edge, or an out-of-order labelling at a glance, serving as a final line of defence in the exam room.

    Summary | 总结

    决策数学 D1 的核心是”算法思维”，而图论算法是其中最具考试价值的部分。本文从”图与网络”的基本概念（顶点、边、权、树、度）出发，系统讲解了三类核心算法：Kruskal 算法通过”先排序、再选边、拒绝回路”求最小生成树；Prim 算法通过”从单点向外生长”求同一个最小生成树；Dijkstra 算法通过”永久化 + 松弛”的标号法求单源最短路径。三者虽然都作用于带权网络，但目标和输出完全不同，切不可混用。

    The core of Decision Mathematics D1 is algorithmic thinking, and graph algorithms are its most exam-worthy part. Starting from the basic concepts of graphs and networks (vertices, edges, weights, trees, degree), this article systematically covered three core algorithms: Kruskal’s algorithm finds the MST by “sorting first, picking edges, and rejecting cycles”; Prim’s algorithm finds the same MST by “growing outward from a single vertex”; Dijkstra’s algorithm finds single-source shortest paths by the “permanent + relax” labelling method. Although all three operate on weighted networks, their goals and outputs are completely different and must never be confused.

    掌握这三个算法，要点在于”过程”而非”结果”：在 Edexcel 的评分标准里，排序列表、候选边、拒绝理由、标号顺序都是方法分的来源。最后请记住几条硬性检查：最小生成树必须恰好有 n − 1 条边、连通且无回路；Dijkstra 只适用于边权非负的网络，回溯最短路径必须使用最终的”前驱”标签。把这些规则内化，图论算法题就能从”容易扣分的陷阱”变成”稳定拿分的板块”。

    The key to mastering these three algorithms is process rather than result: in the Edexcel mark scheme, the sorted list, candidate edges, rejection reasons and labelling order are all sources of method marks. Finally, remember a few hard checks: an MST must have exactly n − 1 edges, be connected and be cycle-free; Dijkstra applies only to networks with non-negative edge weights, and tracing the shortest path must use the final “previous” labels. Once you internalise these rules, graph-algorithm questions change from “traps that easily lose marks” into “sections where marks come steadily.”

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

  • Edexcel Decision Maths 1: Algorithms, Graphs & Linear Programming — Edexcel D1决策数学：算法、图论与线性规划

    一、什么是决策数学？D1在A-Level进阶数学中的位置 | What Is Decision Maths? D1’s Place in A-Level Further Maths

    决策数学（Decision Mathematics）是Edexcel考试局A-Level进阶数学（Further Mathematics）课程中的一个独特模块，编号为D1。与纯数学（Pure Mathematics）关注代数与微积分、力学（Mechanics）关注运动与力、统计学（Statistics）关注数据与概率不同，决策数学研究的是”如何做最优决策” – 即在有限资源和约束条件下找到最佳方案的科学。D1模块涵盖了排序算法、图论、关键路径分析和线性规划等主题，这些内容在计算机科学、运筹学、物流管理和工程设计中有广泛应用。

    Decision Mathematics is a distinctive module within the Edexcel A-Level Further Mathematics syllabus, designated as D1. Unlike Pure Mathematics (algebra and calculus), Mechanics (motion and forces), and Statistics (data and probability), Decision Mathematics studies “how to make optimal decisions” – the science of finding the best solutions under limited resources and constraints. The D1 module covers sorting algorithms, graph theory, critical path analysis, and linear programming, all of which have wide-ranging applications in computer science, operations research, logistics management, and engineering design.

    在Edexcel的A-Level进阶数学体系中，学生通常需要选择两个应用模块（Applied Modules）。D1是最受欢迎的选项之一，因为它的思维方式与其他数学分支截然不同 – 它更接近”计算思维”（Computational Thinking），要求学生按照明确的步骤（算法）系统地解决问题。这种结构化的思维方式对有志于学习计算机科学、工程管理或经济学的大学生尤其有帮助。

    Within Edexcel’s A-Level Further Mathematics framework, students typically choose two Applied Modules. D1 is one of the most popular options because its way of thinking is fundamentally different from other branches of mathematics – it is closer to “computational thinking,” requiring students to follow explicit steps (algorithms) to solve problems systematically. This structured approach to problem-solving is especially valuable for students planning to study computer science, engineering management, or economics at university.

    D1模块主要涵盖四大领域 | The Four Main Areas of D1

    Edexcel D1模块的内容可以归纳为以下四大主题领域：

    The content of the Edexcel D1 module can be grouped into the following four major topic areas:

    1. 算法与排序（Algorithms & Sorting）：包括冒泡排序（Bubble Sort）、快速排序（Quick Sort）以及装箱算法（Bin Packing），如First-Fit、First-Fit Decreasing和Full-Bin算法。学生需要理解算法效率的概念，能够追踪（trace）算法的执行过程，并比较不同算法的优劣。

    1. Algorithms & Sorting: Includes Bubble Sort, Quick Sort, and Bin Packing algorithms such as First-Fit, First-Fit Decreasing, and Full-Bin. Students need to understand the concept of algorithm efficiency, be able to trace algorithm execution, and compare the strengths and weaknesses of different algorithms.

    2. 图论（Graph Theory）：涵盖图的基本概念（顶点、边、度数）、最小生成树（Kruskal算法和Prim算法）以及最短路径问题（Dijkstra算法）。图论是D1中占比最大的部分，也是考试中最常出现的题型。

    2. Graph Theory: Covers basic graph concepts (vertices, edges, degree), minimum spanning trees (Kruskal’s and Prim’s algorithms), and shortest path problems (Dijkstra’s algorithm). Graph theory is the largest section of D1 and the most frequently tested topic in exams.

    3. 关键路径分析（Critical Path Analysis）：通过构建活动网络图（Activity Network）来确定项目完成的最短时间，识别关键活动和非关键活动的浮动时间（Float）。这是项目管理中的核心技术。

    3. Critical Path Analysis: Uses activity network diagrams to determine the minimum project completion time, identifying critical activities and the float (slack) of non-critical activities. This is a core technique in project management.

    4. 线性规划（Linear Programming）：在给定线性约束条件下，通过图解法找到目标函数的最大值或最小值。这是运筹学中最基础也是最经典的优化方法。

    4. Linear Programming: Finding the maximum or minimum value of an objective function under given linear constraints, solved graphically. This is the most fundamental and classic optimization method in operations research.

    二、冒泡排序与快速排序：两种经典排序算法的对比与追踪 | Bubble Sort vs. Quick Sort: Comparing and Tracing Two Classic Sorting Algorithms

    排序（Sorting）是D1模块中最基础的主题。Edexcel考试要求学生掌握两种排序算法：冒泡排序（Bubble Sort）和快速排序（Quick Sort）。两种算法都能将无序列表按升序排列，但它们的效率和实现方式有显著差异。

    Sorting is the most fundamental topic in the D1 module. Edexcel exams require students to master two sorting algorithms: Bubble Sort and Quick Sort. Both algorithms can arrange an unordered list into ascending order, but they differ significantly in efficiency and implementation approach.

    冒泡排序的完整追踪过程 | Tracing the Bubble Sort Algorithm Step by Step

    冒泡排序的核心思想是：对列表进行多次遍历（pass），在每次遍历中依次比较相邻的两个元素，如果它们的顺序错误（前一个大于后一个），就交换它们的位置。每一轮遍历结束后，最大的未排序元素会”冒泡”到正确的位置。当一整轮遍历中没有任何交换发生时，排序完成。

    The core idea of Bubble Sort is to make multiple passes through the list, comparing adjacent elements in each pass and swapping them if they are in the wrong order (the earlier one is larger than the later one). After each pass, the largest unsorted element “bubbles” to its correct position. Sorting is complete when a full pass occurs with no swaps.

    示例：对列表 [8, 3, 6, 1, 5] 进行冒泡排序

    Example: Sorting the list [8, 3, 6, 1, 5] using Bubble Sort

    第一轮（Pass 1）：比较8和3→交换，得到[3, 8, 6, 1, 5]；比较8和6→交换，得到[3, 6, 8, 1, 5]；比较8和1→交换，得到[3, 6, 1, 8, 5]；比较8和5→交换，得到[3, 6, 1, 5, 8]。第一轮结束，最大值8到达正确位置。本轮有交换发生，继续下一轮。

    Pass 1: Compare 8 and 3 → swap, giving [3, 8, 6, 1, 5]; compare 8 and 6 → swap, giving [3, 6, 8, 1, 5]; compare 8 and 1 → swap, giving [3, 6, 1, 8, 5]; compare 8 and 5 → swap, giving [3, 6, 1, 5, 8]. Pass 1 ends, the maximum value 8 is in its correct position. Swaps occurred, so continue to the next pass.

    第二轮（Pass 2）：比较3和6→不交换；比较6和1→交换，得到[3, 1, 6, 5, 8]；比较6和5→交换，得到[3, 1, 5, 6, 8]。6到达正确位置。本轮有交换，继续。

    Pass 2: Compare 3 and 6 → no swap; compare 6 and 1 → swap, giving [3, 1, 6, 5, 8]; compare 6 and 5 → swap, giving [3, 1, 5, 6, 8]. 6 is now in its correct position. Swaps occurred, continue.

    第三轮（Pass 3）：比较3和1→交换，得到[1, 3, 5, 6, 8]；比较3和5→不交换；比较5和6→不交换（已排好序）。本轮有交换，继续。

    Pass 3: Compare 3 and 1 → swap, giving [1, 3, 5, 6, 8]; compare 3 and 5 → no swap; compare 5 and 6 → no swap. Swaps occurred, continue.

    第四轮（Pass 4）：比较1和3→不交换；比较3和5→不交换；比较5和6→不交换。本轮无任何交换，排序结束。最终排好序的列表：[1, 3, 5, 6, 8]。

    Pass 4: Compare 1 and 3 → no swap; compare 3 and 5 → no swap; compare 5 and 6 → no swap. No swaps in this pass, sorting is complete. Final sorted list: [1, 3, 5, 6, 8].

    效率分析：冒泡排序在最坏情况下（完全逆序）需要进行n−1轮遍历，每轮进行n−1次比较，总比较次数约为n²/2。对于n个元素的列表，冒泡排序的最大比较次数为n(n−1)/2，最大交换次数也为n(n−1)/2。因此，冒泡排序的时间复杂度为O(n²)。虽然效率不高，但冒泡排序易于理解和实现，是学习算法思想的良好起点。

    Efficiency Analysis: In the worst case (completely reversed list), Bubble Sort requires n−1 passes, each with n−1 comparisons, giving approximately n²/2 total comparisons. For a list of n elements, the maximum number of comparisons is n(n−1)/2, and the maximum number of swaps is also n(n−1)/2. Thus, Bubble Sort has a time complexity of O(n²). While not the most efficient, Bubble Sort is easy to understand and implement, making it an excellent starting point for learning algorithmic thinking.

    快速排序的分治策略与枢轴选择 | Quick Sort’s Divide-and-Conquer Strategy and Pivot Selection

    快速排序（Quick Sort）采用分治策略（Divide and Conquer），其效率通常远高于冒泡排序。快速排序的核心步骤是：(1) 选择一个元素作为枢轴（pivot）；(2) 将所有小于枢轴的元素放到枢轴左边，大于枢轴的放到右边（这一步称为分区，partitioning）；(3) 对左右两个子列表递归应用相同的步骤。

    Quick Sort employs a divide-and-conquer strategy and is generally much more efficient than Bubble Sort. The core steps are: (1) choose an element as the pivot; (2) place all elements smaller than the pivot to its left and all larger elements to its right (this step is called partitioning); (3) recursively apply the same steps to the left and right sublists.

    Edexcel考试中的快速排序：Edexcel要求学生使用列表的第一个元素作为枢轴，并采用一种特定的分区方法 – 从列表两端向中间扫描。具体做法是：使用两个指针（或索引），左指针从枢轴的下一个位置向右移动，寻找大于枢轴的元素；右指针从列表末尾向左移动，寻找小于枢轴的元素。当两个指针找到符合条件的元素后，交换它们。当指针交叉时，分区完成，将枢轴放到正确位置。

    Quick Sort in Edexcel Exams: Edexcel requires students to use the first element of the list as the pivot and a specific partitioning method – scanning inward from both ends. Specifically: use two pointers (or indices), the left pointer moves right from the position after the pivot looking for elements greater than the pivot; the right pointer moves left from the end looking for elements smaller than the pivot. When both find qualifying elements, swap them. When the pointers cross, partitioning is complete – place the pivot in its correct position.

    示例：对 [9, 4, 7, 2, 6, 1, 5] 进行快速排序

    Example: Sorting [9, 4, 7, 2, 6, 1, 5] using Quick Sort

    选择9为枢轴。左指针从4开始寻找>9的元素（找不到），右指针从5向左寻找<9的元素，找到5、1、6、2、7、4均小于9。右指针一直移到索引1处（元素4），此时左指针在索引7（已超出列表），指针交叉。将枢轴9与右指针位置的元素（4）交换→[4, 9, 7, 2, 6, 1, 5]不对，因为右指针已经在枢轴左边了...实际上，当右指针移到枢轴位置左侧时，不需要交换，因为枢轴已经在正确位置...等等，让我们严格按照Edexcel的方法重新追踪。

    Select 9 as the pivot. The left pointer starts from 4 looking for >9 (none found), the right pointer moves left from 5 looking for <9, finding 5, 1, 6, 2, 7, 4 are all smaller than 9. The right pointer moves all the way to index 1 (element 4), at which point the left pointer is at index 7 (beyond the list), pointers cross. Swap pivot 9 with the element at the right pointer (4) → [4, 9, 7, 2, 6, 1, 5] - this is incorrect because the right pointer is already left of the pivot. Actually, when the right pointer has moved past the pivot position to the left, no swap is needed since the pivot is already in the correct position. Let me re-trace strictly following the Edexcel method.

    正确追踪（Edexcel方法）：枢轴=9（第一个元素）。从左向右找>9的元素（指针从4开始）→到末尾也没找到，左指针停在列表末尾后。从右向左找<9的元素（指针从5开始）→5<9，右指针停在5处。指针未交叉，交换当前元素（没有左元素可交换，因为左指针已出界），将枢轴9与右指针位置的5交换→得到[5, 4, 7, 2, 6, 1, 9]。两个子列表：[5, 4, 7, 2, 6, 1]和[]（空）。对左子列表递归：枢轴=5，左指针从4找>5→找到7；右指针从1找<5→找到1；交换7和1→[5, 4, 1, 2, 6, 7]。继续，左指针从2找>5→找到6；右指针从6找<5→找到2（在左指针已经经过的位置）；指针交叉。交换枢轴5与右指针的2→[2, 4, 1, 5, 6, 7, 9]。子列表：[2, 4, 1]和[6, 7]。继续递归直到全部有序。

    Correct Trace (Edexcel Method): Pivot = 9 (first element). Scan left to right for >9 (pointer starts at 4) → reaches the end without finding any, left pointer stops beyond the list. Scan right to left for <9 (pointer starts at 5) → 5 < 9, right pointer stops at 5. Pointers haven't crossed; swap pivot 9 with the element at the right pointer position (5) → [5, 4, 7, 2, 6, 1, 9]. Two sublists: [5, 4, 7, 2, 6, 1] and [] (empty). Recurse on left sublist: pivot = 5, left pointer from 4 looking for >5 → finds 7; right pointer from 1 looking for <5 → finds 1; swap 7 and 1 → [5, 4, 1, 2, 6, 7]. Continue, left pointer from 2 looking for >5 → finds 6; right pointer from 6 looking for <5 → finds 2 (already to the left of left pointer); pointers cross. Swap pivot 5 with right pointer's 2 → [2, 4, 1, 5, 6, 7, 9]. Sublists: [2, 4, 1] and [6, 7]. Continue recursively until fully sorted.

    效率对比：快速排序的平均时间复杂度为O(n log n)，远优于冒泡排序的O(n²)。但在最坏情况下（例如已经排好序的列表，且每次都选第一个元素作为枢轴），快速排序的性能会退化到O(n²)。不过，这种情况在实际应用中可以通过随机选择枢轴来避免。在Edexcel考试中，学生需要能够在笔试条件下完整追踪快速排序的每一轮分区过程。

    Efficiency Comparison: Quick Sort has an average time complexity of O(n log n), far superior to Bubble Sort’s O(n²). However, in the worst case (e.g., an already-sorted list with the first element always chosen as the pivot), Quick Sort degrades to O(n²). In practice, this can be avoided by choosing the pivot randomly. In Edexcel exams, students need to be able to fully trace each round of Quick Sort partitioning under written exam conditions.

    三、装箱算法：First-Fit、First-Fit Decreasing 与 Full-Bin 策略 | Bin Packing Algorithms: First-Fit, First-Fit Decreasing, and Full-Bin Strategies

    装箱问题（Bin Packing Problem）是决策数学中另一类重要的算法问题。问题的核心是：给定一组具有不同”大小”（重量、长度、时间等）的物品和一个固定容量的箱子（bin），如何用最少的箱子装下所有物品？D1模块要求掌握三种装箱算法。

    The Bin Packing Problem is another important algorithmic problem in Decision Mathematics. The core question is: given a set of items with different “sizes” (weights, lengths, times, etc.) and bins of fixed capacity, how can we pack all items using the minimum number of bins? The D1 module requires mastery of three bin packing algorithms.

    First-Fit 算法：按顺序放入第一个能装的箱子 | The First-Fit Algorithm: Sequential Placement

    First-Fit是最直观的装箱策略：按照物品给定的顺序，依次将每个物品放入第一个有足够剩余空间的箱子中。如果当前所有箱子都装不下该物品，则打开一个新箱子。

    First-Fit is the most intuitive packing strategy: following the given order of items, place each item into the first bin that has sufficient remaining capacity. If no existing bin can accommodate the item, open a new bin.

    示例：箱子容量=10，物品为 [6, 4, 5, 2, 7, 3, 2]

    Example: Bin capacity = 10, items = [6, 4, 5, 2, 7, 3, 2]

    物品6→箱子1放入（剩余4）。物品4→箱子1还有4，正好放入（剩余0）。物品5→箱子1满了，箱子2为空，放入箱子2（剩余5）。物品2→箱子2剩余5≥2，放入箱子2（剩余3）。物品7→箱子2剩余3不够，箱子3为空，放入箱子3（剩余3）。物品3→箱子1满了，箱子2剩余3≥3，放入箱子2（剩余0）。物品2→箱子1、2满了，箱子3剩余3≥2，放入箱子3（剩余1）。结果：使用3个箱子。

    Item 6 → placed in Bin 1 (remaining 4). Item 4 → Bin 1 has 4 left, fits perfectly (remaining 0). Item 5 → Bin 1 full, Bin 2 empty, placed in Bin 2 (remaining 5). Item 2 → Bin 2 has 5 ≥ 2, placed in Bin 2 (remaining 3). Item 7 → Bin 2 has only 3, not enough. Bin 3 empty, placed in Bin 3 (remaining 3). Item 3 → Bins 1 and 2 full, Bin 3 has 3 ≥ 3, placed in Bin 3 (remaining 0). Item 2 → Bins 1, 2, 3 all full. Open Bin 4, placed in Bin 4 (remaining 8). Result: 4 bins used.

    等等，让我重新算。箱子3放进3后剩余0，最后一个物品2放不进已满的箱子，打开箱子4。结果是4个箱子：箱子1=[6,4]，箱子2=[5,2]，箱子3=[7,3]，箱子4=[2]。总共用了4个箱子。

    Wait, let me recalculate. After placing item 3 in Bin 3, Bin 3 has 0 remaining. The last item 2 cannot fit in any full bin, so open Bin 4. Result: 4 bins – Bin 1 = [6,4], Bin 2 = [5,2], Bin 3 = [7,3], Bin 4 = [2]. Total: 4 bins used.

    First-Fit Decreasing：先排序再装箱的改进策略 | First-Fit Decreasing: Sort First, Then Pack

    First-Fit Decreasing (FFD) 是对First-Fit的简单但有效的改进：先将所有物品按大小降序排列，然后对排序后的列表应用First-Fit算法。

    First-Fit Decreasing (FFD) is a simple but effective improvement on First-Fit: first sort all items in descending order of size, then apply the First-Fit algorithm to the sorted list.

    对同一示例应用FFD：降序排列→[7, 6, 5, 4, 3, 2, 2]。7→箱1（剩3）；6→箱1装不下，箱2（剩4）；5→箱2装不下，箱3（剩5）；4→箱2剩4正好（剩0）；3→箱1剩3正好（剩0）；2→箱3剩5≥2（剩3）；2→箱3剩3≥2（剩1）。结果：3个箱子 – 箱1=[7,3]，箱2=[6,4]，箱3=[5,2,2]。FFD用了3个箱子，比First-Fit的4个更优。

    Applying FFD to the same example: Sort descending → [7, 6, 5, 4, 3, 2, 2]. 7 → Bin 1 (remaining 3); 6 → Bin 1 can’t fit, Bin 2 (remaining 4); 5 → Bin 2 can’t fit, Bin 3 (remaining 5); 4 → Bin 2 has 4, fits perfectly (remaining 0); 3 → Bin 1 has 3, fits perfectly (remaining 0); 2 → Bin 3 has 5 ≥ 2 (remaining 3); 2 → Bin 3 has 3 ≥ 2 (remaining 1). Result: 3 bins – Bin 1 = [7,3], Bin 2 = [6,4], Bin 3 = [5,2,2]. FFD uses 3 bins, better than First-Fit’s 4.

    Full-Bin 算法：寻找刚好装满的组合 | The Full-Bin Algorithm: Finding Perfect-Fit Combinations

    Full-Bin算法采用了一种不同的思路：通过目测（inspection）寻找能够刚好装满一个箱子的物品组合（即物品之和等于箱子容量），优先使用这些”满箱”组合，然后对剩余物品应用First-Fit。虽然Full-Bin并非总是产生最优解，但它通常在物品大小分布均匀时表现良好。

    The Full-Bin algorithm takes a different approach: by inspection, find combinations of items that exactly fill a bin (i.e., items summing to the bin capacity), use these “full-bin” combinations first, then apply First-Fit to the remaining items. While Full-Bin does not always produce the optimal solution, it generally performs well when item sizes are evenly distributed.

    对同一示例应用Full-Bin：目测发现[6,4]是一个满箱组合（6+4=10），[7,3]也是一个满箱组合（7+3=10）。先使用这两个组合（占用2个箱子），剩余物品为[5, 2, 2]。对剩余物品应用First-Fit：5→箱3（剩5），2→箱3（剩3），2→箱3（剩1）。结果：3个箱子。注意，Full-Bin和FFD在这个例子中产生了相同的结果，但在其他例子中可能不同。

    Applying Full-Bin to the same example: By inspection, [6,4] is a full-bin combination (6+4=10), and [7,3] is also a full-bin combination (7+3=10). Use these two combinations first (2 bins), remaining items: [5, 2, 2]. Apply First-Fit: 5 → Bin 3 (remaining 5), 2 → Bin 3 (remaining 3), 2 → Bin 3 (remaining 1). Result: 3 bins. Note that Full-Bin and FFD produce the same result in this example but may differ in others.

    考试提示：Edexcel D1考试中的装箱问题通常会要求考生依次应用三种算法并比较结果。记住要清晰展示每一步的装箱过程，包括每个箱子放入物品后的剩余容量。在比较算法时，FFD通常（但不总是）优于First-Fit，而Full-Bin的效果取决于能否找到足够多的”满箱”组合。

    Exam Tips: Bin packing questions in Edexcel D1 exams typically require candidates to apply all three algorithms in sequence and compare results. Remember to clearly show the packing process for each step, including the remaining capacity after each item is placed. When comparing algorithms, FFD is usually (but not always) better than First-Fit, while Full-Bin’s effectiveness depends on how many full-bin combinations can be found.

    四、图论基础：顶点、边、度数以及图在D1中的表示方法 | Graph Theory Fundamentals: Vertices, Edges, Degree, and Representations in D1

    图论（Graph Theory）是D1模块中篇幅最大、考试权重最高的主题。图（graph）由顶点（vertices/nodes）和连接顶点的边（edges/arcs）组成。图论提供了一种强大的数学语言来描述和分析网络结构 – 无论是交通网络、通信网络还是社交网络。

    Graph Theory is the largest and most heavily weighted topic in the D1 module. A graph consists of vertices (nodes) and edges (arcs) connecting them. Graph theory provides a powerful mathematical language for describing and analyzing network structures – whether transportation networks, communication networks, or social networks.

    图的基本概念与术语 | Basic Concepts and Terminology of Graphs

    顶点（Vertex/Node）：图中的基本元素，通常用字母或数字表示（如A, B, C, D）。在D1考试中，顶点通常代表地点、任务或状态。

    Vertex (Node): The basic element of a graph, typically denoted by letters or numbers (e.g., A, B, C, D). In D1 exams, vertices usually represent locations, tasks, or states.

    边（Edge/Arc）：连接两个顶点的线段。边可以带权重（weight），表示距离、时间或成本。如果边有方向（从一个顶点指向另一个顶点），则称为有向边（directed edge/arc），对应的图称为有向图（digraph）。

    Edge (Arc): A line segment connecting two vertices. Edges can have weights representing distance, time, or cost. If an edge has a direction (pointing from one vertex to another), it is called a directed edge (arc), and the corresponding graph is a digraph (directed graph).

    度数（Degree/Valency/Order）：一个顶点的度数是与该顶点相连的边的数量。在D1考试中，”度”（degree）、”价”（valency）和”阶”（order）这三个术语是等价的，可以互换使用。一个图中所有顶点的度数之和等于边数的两倍（握手引理，Handshaking Lemma）。

    Degree (Valency/Order): The degree of a vertex is the number of edges connected to it. In D1 exams, “degree,” “valency,” and “order” are equivalent terms and can be used interchangeably. The sum of the degrees of all vertices in a graph equals twice the number of edges (the Handshaking Lemma).

    路径（Path）：从一个顶点到另一个顶点的一系列连续的边，不重复经过任何顶点。

    Path: A sequence of consecutive edges from one vertex to another, without revisiting any vertex.

    回路（Cycle/Circuit）：起点和终点相同的路径，且路径中不重复经过其他顶点。

    Cycle (Circuit): A path that starts and ends at the same vertex, with no other vertex repeated in the path.

    树（Tree）：不包含任何回路的连通图。树在D1中非常重要，因为它是最小生成树和关键路径分析的基础。

    Tree: A connected graph that contains no cycles. Trees are crucial in D1 as they form the foundation of minimum spanning trees and critical path analysis.

    图的矩阵表示：距离矩阵与邻接矩阵 | Matrix Representations: Distance Matrix and Adjacency Matrix

    在D1考试中，图通常以两种矩阵形式呈现：(1) 距离矩阵（Distance Matrix），其中每个元素表示两个顶点之间的边的权重（如果没有直接连接，通常用”–“表示）；(2) 邻接矩阵（Adjacency Matrix），其中元素为0或1表示两个顶点之间是否存在边。距离矩阵用于Prim算法和Dijkstra算法，邻接矩阵用于分析图的连通性和度数。

    In D1 exams, graphs are typically presented in two matrix forms: (1) Distance Matrix, where each element represents the weight of the edge between two vertices (with “-” typically indicating no direct connection); (2) Adjacency Matrix, where elements are 0 or 1 indicating whether an edge exists between two vertices. Distance matrices are used in Prim’s and Dijkstra’s algorithms, while adjacency matrices are used for analyzing connectivity and degrees.

    五、最小生成树：Kruskal算法与Prim算法的对比与应用 | Minimum Spanning Trees: Kruskal’s vs. Prim’s Algorithm — Comparison and Application

    最小生成树（Minimum Spanning Tree, MST）是D1图论部分的核心考点。一个连通加权图的最小生成树是一个包含所有顶点的树（无回路的连通子图），且所有边的权重之和最小。D1要求学生掌握两种构建MST的算法：Kruskal算法和Prim算法。

    The Minimum Spanning Tree (MST) is a core examination topic in D1 graph theory. An MST of a connected weighted graph is a tree (a connected subgraph with no cycles) that includes all vertices and has the minimum possible total edge weight. D1 requires students to master two algorithms for constructing an MST: Kruskal’s algorithm and Prim’s algorithm.

    Kruskal算法：按权重排序选边 | Kruskal’s Algorithm: Selecting Edges by Weight

    Kruskal算法的步骤非常直观：(1) 将所有边按权重从小到大排序；(2) 从最小权重的边开始，依次选择不会形成回路的边加入生成树；(3) 当已经选择了V−1条边时（V为顶点数），最小生成树构建完成。

    Kruskal’s algorithm steps are straightforward: (1) Sort all edges by weight in ascending order; (2) Starting from the smallest weight, select edges that do not form a cycle and add them to the spanning tree; (3) When V−1 edges have been selected (where V is the number of vertices), the MST is complete.

    Kruskal算法的关键技巧 – 检测回路：在笔试中，判断一条新边是否会形成回路的方法是：检查该边的两个端点是否都已经通过已选边连接到了生成树中。如果两个端点已经连通（即它们属于同一个连通分量），则加入这条边会形成回路，应该跳过。

    Key Technique for Kruskal’s – Detecting Cycles: In written exams, determine whether a new edge would form a cycle by checking if both endpoints are already connected to the spanning tree through previously selected edges. If both endpoints are already connected (i.e., they belong to the same connected component), adding this edge would form a cycle – skip it.

    Prim算法：从起点逐步生长 | Prim’s Algorithm: Growing from a Starting Vertex

    Prim算法采用”生长”策略：(1) 从任意一个顶点开始（题目通常会指定起点）；(2) 在每一步中，从已连接到当前树的顶点出发，选择一条权重最小且连接到树外顶点的边；(3) 将该边和新的顶点加入树中；(4) 重复直到所有顶点都在树中。

    Prim’s algorithm uses a “growth” strategy: (1) Start from any vertex (exams usually specify a starting vertex); (2) At each step, from vertices already connected to the current tree, select the edge with the smallest weight that connects to a vertex outside the tree; (3) Add that edge and the new vertex to the tree; (4) Repeat until all vertices are in the tree.

    Prim算法的两种实现形式：在Edexcel D1考试中，Prim算法可以通过两种方式呈现：(a) 图形式（Graphical Form） – 直接在图上标注和连线，适合顶点较少的图；(b) 矩阵形式（Matrix/Table Form） – 使用距离矩阵，依次删除已选顶点的列并标注新顶点所在行的最小值。矩阵形式在顶点较多时更清晰，也是考试中最常见的出题方式。

    Two Forms of Prim’s Algorithm: In Edexcel D1 exams, Prim’s algorithm can be presented in two ways: (a) Graphical Form – directly annotating and connecting on the graph, suitable for graphs with few vertices; (b) Matrix/Table Form – using the distance matrix, sequentially deleting columns of selected vertices and marking minimum values in the new vertex’s row. The matrix form is clearer for graphs with many vertices and is the most common exam format.

    Kruskal vs. Prim对比：Kruskal算法的优势在于直观 – 只需要排序和避免回路；但需要频繁检查连通性。Prim算法在边密集的图中效率更高，且矩阵形式便于追踪和检查。两种算法在同一个图上总是产生相同的总权重（当所有边权重互不相同时，MST是唯一的），但选择的边的顺序可能不同。

    Kruskal vs. Prim Comparison: Kruskal’s advantage is its simplicity – just sort and avoid cycles – but requires frequent connectivity checks. Prim’s is more efficient in dense graphs, and the matrix form is easy to trace and verify. Both algorithms always produce the same total weight on the same graph (when all edge weights are distinct, the MST is unique), but the order of edge selection may differ.

    六、Dijkstra最短路径算法：从单源点到所有顶点的最优路线 | Dijkstra’s Shortest Path Algorithm: Optimal Routes from a Single Source to All Vertices

    Dijkstra算法是D1图论部分的另一核心算法，用于在加权图中找到从一个指定起点到所有其他顶点的最短路径。这个算法由荷兰计算机科学家Edsger Dijkstra于1956年提出，至今仍然是路径规划（如GPS导航系统）中最重要的基础算法之一。

    Dijkstra’s algorithm is another core algorithm in the D1 graph theory section, used to find the shortest path from a specified starting vertex to all other vertices in a weighted graph. Proposed by Dutch computer scientist Edsger Dijkstra in 1956, it remains one of the most important foundational algorithms in route planning today (e.g., GPS navigation systems).

    Dijkstra算法的完整步骤 | Complete Steps of Dijkstra’s Algorithm

    Dijkstra算法通过在顶点上标注”工作值”（working values）来逐步确定最短距离。每个顶点的标注包括：(1) 从起点到该顶点的当前最短距离；(2) 该距离来自哪个前驱顶点。其中永久性标注（permanent label）表示该最短距离已确认，临时性标注（temporary label）表示仍在更新中。

    Dijkstra’s algorithm progressively determines shortest distances by assigning “working values” to vertices. Each vertex’s label includes: (1) the current shortest distance from the start to that vertex; (2) which predecessor vertex that distance comes from. Permanent labels indicate confirmed shortest distances, while temporary labels are still subject to update.

    算法步骤：

    Algorithm Steps:

    步骤1：给起点永久性标注0（距离为0，无前驱）。所有其他顶点标注临时距离∞。

    Step 1: Give the start vertex a permanent label of 0 (distance 0, no predecessor). Label all other vertices with temporary distance ∞.

    步骤2：从最新获得永久标注的顶点出发，更新其所有相邻顶点的临时距离：新距离 = 当前永久标注顶点的距离 + 边的权重。如果新距离小于该顶点当前的临时距离，则更新标注（同时更新前驱顶点）。

    Step 2: From the most recently permanently labelled vertex, update the temporary distances of all its adjacent vertices: new distance = distance of current permanent vertex + edge weight. If the new distance is smaller than the vertex’s current temporary distance, update the label (and predecessor).

    步骤3：在所有临时标注的顶点中，选择距离最小的那个，将其标注变为永久性。

    Step 3: Among all temporarily labelled vertices, select the one with the smallest distance and make its label permanent.

    步骤4：重复步骤2和3，直到所有顶点都获得永久标注。从终点回溯前驱顶点即可得到最短路径。

    Step 4: Repeat Steps 2 and 3 until all vertices have permanent labels. Trace back from the destination through predecessors to obtain the shortest path.

    重要注意事项：Dijkstra算法要求所有边的权重必须为非负数。如果图中存在负权重边，需要使用其他算法（如Bellman-Ford算法）。此外，在Edexcel D1考试中，算法追踪通常以表格形式呈现 – 每一行代表处理一个顶点，列包括：顶点、从起点的最短距离、前驱顶点、以及是否已永久标注。

    Important Note: Dijkstra’s algorithm requires all edge weights to be non-negative. If the graph contains negative-weight edges, other algorithms (such as Bellman-Ford) must be used. Additionally, in Edexcel D1 exams, algorithm traces are typically presented in table form – each row represents processing one vertex, with columns for: vertex, shortest distance from start, predecessor vertex, and whether it is permanently labelled.

    七、关键路径分析：活动网络图、最早开始时间与浮动时间 | Critical Path Analysis: Activity Networks, Earliest Start Times, and Float

    关键路径分析（Critical Path Analysis, CPA）是D1中最具实际应用价值的主题之一。它用于项目规划和管理，帮助确定一个项目完成的最短时间，并识别哪些活动的延迟会影响整体项目完成时间（关键活动），哪些活动有一定的灵活空间（浮动时间）。

    Critical Path Analysis (CPA) is one of the most practically valuable topics in D1. It is used in project planning and management to determine the minimum time to complete a project and identify which activities, if delayed, would affect the overall project completion time (critical activities) and which activities have some flexibility (float).

    活动网络图的构建 | Constructing Activity Network Diagrams

    活动网络图（Activity Network / Precedence Network）由节点和边组成。在D1考试中，通常使用”节点表示活动”（Activity-on-Node）的表示方法。每个活动用一个节点表示，节点内标注活动名称（或编号）和持续时间。边（箭头）表示活动之间的先后依赖关系（precedence）。

    An activity network (also called a precedence network) consists of nodes and edges. In D1 exams, the “Activity-on-Node” representation is typically used. Each activity is represented by a node containing the activity name (or number) and its duration. Edges (arrows) represent precedence relationships between activities.

    每个活动节点需要计算和标注两个关键时间值：

    Each activity node requires the calculation and annotation of two key time values:

    最早开始时间（Earliest Start Time, EST）：在不违反前置活动约束的前提下，一个活动可以开始的最早时间。对于没有前置活动的起始活动，EST = 0。对于有前置活动的活动，EST = 所有前置活动最早完成时间的最大值。

    Earliest Start Time (EST): The earliest time an activity can begin without violating the precedence constraints of preceding activities. For a starting activity with no predecessors, EST = 0. For activities with predecessors, EST = the maximum of all predecessors’ earliest finish times.

    最晚完成时间（Latest Finish Time, LFT）：在不延迟整个项目的前提下，一个活动必须完成的最晚时间。对于项目的最后一个活动（终点活动），LFT = 项目的最短完成时间（即该活动的EFT）。对于其他活动，LFT = 所有后继活动最晚开始时间的最小值。

    Latest Finish Time (LFT): The latest time an activity must finish without delaying the entire project. For the final activity (end activity), LFT = the project’s minimum completion time (i.e., the activity’s EFT). For other activities, LFT = the minimum of all successors’ latest start times.

    浮动时间：总浮动与自由浮动 | Float: Total Float and Free Float

    总浮动时间（Total Float）：一个活动可以延迟的最大时间，而不会延迟整个项目的完成时间。计算公式：总浮动 = LFT − EFT（或 = LST − EST）。总浮动为0的活动构成关键路径。

    Total Float: The maximum amount of time an activity can be delayed without delaying the overall project completion time. Formula: Total Float = LFT − EFT (or = LST − EST). Activities with total float of 0 form the critical path.

    关键路径（Critical Path）：网络中总浮动时间为0的活动序列。关键路径决定了项目的最短完成时间，任何一个关键活动的延迟都会直接导致整个项目的延迟。一个项目可能有多条关键路径。

    Critical Path: The sequence of activities in the network with total float of 0. The critical path determines the minimum project completion time – any delay in a critical activity directly delays the entire project. A project may have multiple critical paths.

    考试中的关键路径分析：Edexcel D1考试中的CPA题目通常包括：根据前置关系表构建活动网络图、正向计算EST和EFT、反向计算LFT和LST、计算每个活动的总浮动时间、识别关键路径。在答题时，务必清晰标注算法步骤 – 即使最终答案正确，缺少中间步骤也会失分。

    CPA in Exams: Edexcel D1 exam questions on CPA typically include: constructing the activity network from a precedence table, forward pass to calculate EST and EFT, backward pass to calculate LFT and LST, calculating total float for each activity, and identifying the critical path(s). When answering, always show working clearly – even if the final answer is correct, missing intermediate steps will lose marks.

    资源直方图与资源平滑 | Resource Histograms and Resource Levelling

    在更复杂的D1问题中，还需要考虑资源约束 – 即某些活动需要共享有限的资源（如工人、机器）。资源直方图（Resource Histogram / Gantt Chart）展示了在每个时间单位内各项活动对资源的需求量。当资源需求超过供给时，需要对非关键活动进行调度 – 利用浮动时间推迟某些活动，使资源需求在时间上分布更均匀。这个过程称为资源平滑（Resource Levelling）。

    In more complex D1 problems, resource constraints must also be considered – certain activities share limited resources (e.g., workers, machines). A resource histogram (Gantt chart) shows the resource demand of each activity per time unit. When demand exceeds supply, non-critical activities must be rescheduled – using float to delay some activities so resource demand is more evenly distributed over time. This process is called resource levelling.

    调度（Scheduling）与甘特图（Gantt Chart）：甘特图（或称级联图，Cascade Chart）是D1中展示项目调度的标准工具。横轴表示时间，纵轴列出活动（通常按照EST排序）。每个活动用一个水平条形表示，条形的长度代表持续时间。甘特图能够直观地显示活动的时间安排、资源使用情况以及浮动时间。

    Scheduling and Gantt Charts (Cascade Charts): Gantt charts (also called cascade charts in D1) are the standard tool for displaying project schedules. The horizontal axis represents time, and the vertical axis lists activities (usually sorted by EST). Each activity is shown as a horizontal bar whose length represents its duration. Gantt charts visually display activity timing, resource usage, and float.

    八、线性规划：约束条件下的最优决策与图解法 | Linear Programming: Optimal Decisions Under Constraints via Graphical Methods

    线性规划（Linear Programming, LP）是D1的最后一个重要主题，也是运筹学中最基础的优化工具。线性规划问题通常涉及在多个线性约束条件下，最大化或最小化一个线性目标函数。在D1级别，学生只需要掌握二元变量的图解法。

    Linear Programming (LP) is the final major topic in D1 and the most fundamental optimization tool in operations research. An LP problem typically involves maximizing or minimizing a linear objective function subject to multiple linear constraints. At the D1 level, students only need to master the graphical method for two-variable problems.

    线性规划的标准形式与图解法步骤 | Standard Form and Graphical Solution Steps

    一个典型的D1线性规划问题包含以下要素：

    A typical D1 linear programming problem includes the following elements:

    决策变量（Decision Variables）：需要确定其最优值的变量。在Edexcel D1中，通常用x和y表示两种产品的生产数量或其他可以连续变化的量。

    Decision Variables: The variables whose optimal values need to be determined. In Edexcel D1, x and y typically represent the production quantities of two products or other continuously variable quantities.

    目标函数（Objective Function）：需要最大化或最小化的线性表达式，如”最大化利润 P = 3x + 2y”。

    Objective Function: The linear expression to be maximized or minimized, e.g., “Maximize profit P = 3x + 2y.”

    约束条件（Constraints）：决策变量必须满足的线性不等式组。通常包括资源限制（如时间、原材料）、需求限制和非负约束（x ≥ 0, y ≥ 0）。

    Constraints: The system of linear inequalities the decision variables must satisfy. Typically includes resource limitations (e.g., time, raw materials), demand constraints, and non-negativity constraints (x ≥ 0, y ≥ 0).

    图解法的完整步骤：

    Complete Steps of the Graphical Method:

    步骤1：将每个约束不等式画在坐标平面上。将不等式替换为等式，画出对应的直线，然后根据不等号方向确定区域（通常用箭头或阴影标注可行侧）。

    Step 1: Draw each constraint inequality on the coordinate plane. Replace the inequality with an equality, draw the corresponding line, then determine the feasible side based on the inequality direction (typically annotating with arrows or shading the feasible side).

    步骤2：确定可行域（Feasible Region）。可行域是所有约束条件同时满足的区域，即所有阴影或箭头交集形成的多边形区域。务必清晰地标注可行域（通常标记为大写字母R）。

    Step 2: Identify the feasible region. This is the region that satisfies all constraints simultaneously – the polygonal area formed by the intersection of all shaded regions or arrows. Always clearly label the feasible region (typically with a capital R).

    步骤3：画出目标函数线。用目标函数绘制一条”目标线”（profit line / objective line），通常选择一条方便计算的值（如令 P = 某个常数值）。目标函数线是一组平行的直线，目标函数值越大（对于最大化问题），直线距离原点越远。

    Step 3: Draw the objective function line. Plot a “profit line” (objective line) using the objective function, typically choosing a convenient value (e.g., set P = some constant). The objective function lines form a family of parallel lines – for a maximization problem, the farther the line is from the origin, the larger the objective value.

    步骤4：通过平行移动目标函数线找到最优解。将目标线平行移动，保持其在可行域内，直到它刚好经过可行域的最后一个顶点（对于最大化问题）或第一个顶点（对于最小化问题）。这个顶点就是最优解所在位置。

    Step 4: Find the optimal solution by sliding the objective line parallel to itself. Keeping it within the feasible region, slide the objective line until it just passes through the last vertex of the feasible region (for maximization) or the first vertex (for minimization). This vertex is the location of the optimal solution.

    步骤5：计算最优解。准确读取最优顶点的坐标（如果坐标不是整数，可能需要求解两条约束直线的交点），代入目标函数计算最优值。

    Step 5: Calculate the optimal solution. Read the coordinates of the optimal vertex precisely (if coordinates are not integers, solve the intersection of the two constraint lines), then substitute into the objective function to calculate the optimal value.

    整数解与目标函数系数的解释 | Integer Solutions and Interpreting Objective Function Coefficients

    整数约束：在D1考试中，题目可能要求决策变量为整数（例如不能生产半台机器）。如果线性规划的最优解是非整数，而问题要求整数解，则需要测试最优顶点附近的整数点（使用”尝试法”检验所有在可行域内的整数坐标对）。

    Integer Constraints: In D1 exams, questions may require decision variables to be integers (e.g., you can’t produce half a machine). If the LP’s optimal solution is non-integer and the problem requires integer solutions, test integer points near the optimal vertex (use “trial and error” to check all integer coordinate pairs within the feasible region).

    目标函数系数的意义：目标函数中的系数反映了各决策变量对总目标的贡献。例如，如果P = 3x + 2y，那么每增加一单位x，P增加3；每增加一单位y，P增加2。理解这些系数对于在考试中解释最优解的经济意义非常重要。

    Meaning of Objective Function Coefficients: The coefficients in the objective function reflect each decision variable’s contribution to the overall objective. For example, if P = 3x + 2y, then increasing x by one unit increases P by 3; increasing y by one unit increases P by 2. Understanding these coefficients is important for interpreting the economic significance of the optimal solution in exam questions.

    常见考试陷阱：(1) 忘记画非负约束x ≥ 0和y ≥ 0的边界；(2) 目标函数线画得太粗略以至于无法精确判断最优顶点；(3) 在整数解问题中忽略了位于可行域内部但目标值更高的整数点。这三个陷阱是Edexcel D1线性规划题目中失分最常见的原因。

    Common Exam Pitfalls: (1) Forgetting to draw the boundaries for non-negativity constraints x ≥ 0 and y ≥ 0; (2) Drawing the objective function line too roughly to accurately identify the optimal vertex; (3) In integer solution problems, overlooking integer points inside the feasible region that yield a higher objective value. These three pitfalls are the most common causes of lost marks in Edexcel D1 linear programming questions.

    九、D1考试策略与常见题型分析 | D1 Exam Strategy and Common Question-Type Analysis

    Edexcel D1考试的时间一般为1小时30分钟，满分75分。题目形式通常是6到8道问题，涵盖上述所有主要主题。以下是取得高分的关键策略：

    The Edexcel D1 exam is typically 1 hour 30 minutes, worth 75 marks. Questions usually number 6 to 8, covering all the major topics above. Here are key strategies for achieving a high score:

    1. 算法追踪务必展示完整步骤：D1的评分标准非常注重过程。对于排序、装箱、图论和线性规划问题，务必按步骤清晰展示算法执行过程。追踪表格（trace table）是展示过程的最佳方式。

    1. Always Show Full Algorithm Traces: D1 mark schemes heavily reward process. For sorting, bin packing, graph theory, and linear programming problems, always show each step of the algorithm execution clearly. Trace tables are the best way to present the process.

    2. 使用正确的术语：D1有其独特的术语体系。使用”顶点”而非”点”，”边”而非”线”，”度数/价/阶”而非”连接数”。在关键路径分析中使用EST、LFT、总浮动等标准缩写。这些术语的准确使用在评分中是隐形加分项。

    2. Use Correct Terminology: D1 has its own terminology system. Use “vertex” not “point,” “edge” not “line,” “degree/valency/order” not “number of connections.” Use standard abbreviations like EST, LFT, and total float in critical path analysis. Accurate use of these terms is an implicit scoring advantage.

    3. Kruskal vs. Prim的选择策略：如果题目没有指定使用哪种算法，且图是矩阵形式给出的，优先选择Prim算法（矩阵形式），因为它更不容易出错。如果图是以列表形式给出边及其权重，则Kruskal算法更方便。

    3. Choosing Between Kruskal and Prim: If the question doesn’t specify which algorithm to use and the graph is given in matrix form, prefer Prim’s algorithm (matrix form) as it is less error-prone. If the graph is given as a list of edges with weights, Kruskal’s is more convenient.

    4. 线性规划的画图精度：在画约束直线和可行域时，使用清晰的坐标系和标签。即使画图不是100%精确，清晰的标注（R表示可行域、箭头指示可行侧、顶点坐标标注）能够帮助考官理解你的思路。在最优解附近画一条清晰的目标函数线并标注其值。

    4. Drawing Precision in Linear Programming: Use clear axes and labels when drawing constraint lines and feasible regions. Even if the drawing isn’t 100% precise, clear annotations (R for feasible region, arrows indicating the feasible side, vertex coordinate labels) help examiners follow your reasoning. Draw a clean objective function line near the optimal solution and label its value.

    5. 时间管理：D1题目的难度通常是递增的。前几题（排序、装箱算法）相对简单，应该快速完成以留出时间给最后几题（Dijkstra、CPA线性规划）。建议的时间分配：排序与装箱（15分钟），最小生成树（15分钟），Dijkstra最短路径（20分钟），关键路径分析（20分钟），线性规划（20分钟）。

    5. Time Management: D1 questions typically increase in difficulty. The early questions (sorting, bin packing) are relatively straightforward and should be completed quickly to leave time for the later questions (Dijkstra, CPA, linear programming). Suggested time allocation: Sorting and Bin Packing (15 min), Minimum Spanning Tree (15 min), Dijkstra’s Shortest Path (20 min), Critical Path Analysis (20 min), Linear Programming (20 min).

    Summary | 总结

    Edexcel D1 Decision Mathematics 1是一门独特而富有实用价值的A-Level进阶数学模块。它与纯数学、力学和统计学形成鲜明互补，培养学生的计算思维和结构化问题解决能力。D1涵盖的四大主题 – 排序与装箱算法、图论（最小生成树与最短路径）、关键路径分析和线性规划 – 构成了运筹学和计算机科学的基础。掌握这些主题不仅有助于在A-Level考试中取得高分，也为大学阶段的计算机科学、工程管理和经济学学习奠定了坚实的基础。D1的核心思想 – 在约束条件下寻找最优解 – 是一种适用于所有学科和职业的普适思维方式。

    Edexcel D1 Decision Mathematics 1 is a unique and practically valuable A-Level Further Mathematics module. It complements Pure Mathematics, Mechanics, and Statistics, cultivating students’ computational thinking and structured problem-solving abilities. The four major topic areas covered in D1 – sorting and bin packing algorithms, graph theory (minimum spanning trees and shortest paths), critical path analysis, and linear programming – form the foundations of operations research and computer science. Mastering these topics not only helps achieve high scores in A-Level exams but also establishes a solid foundation for university-level studies in computer science, engineering management, and economics. The core idea of D1 – finding optimal solutions under constraints – is a universal mindset applicable across all disciplines and careers.

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