← 返回资讯屏轩教育 · 行业资讯

Year 12 WJEC Further Mathematics: Comprehensive Syllabus Breakdown | Year 12 WJEC 进阶数学:课程大纲全面解析

2026-07-22 01:46 · 本文部分内容由AI辅助创作

📚 Year 12 WJEC Further Mathematics: Comprehensive Syllabus Breakdown | Year 12 WJEC 进阶数学:课程大纲全面解析

Year 12 WJEC Further Mathematics marks the beginning of an advanced mathematical journey, taking students well beyond the standard A Level Mathematics curriculum. This course extends pure mathematical techniques while introducing optional applied modules that deepen understanding of mechanics, statistics, or decision mathematics. A sound grasp of the syllabus structure is essential for effective revision and exam success.

Year 12 WJEC 进阶数学标志着高阶数学之旅的开启,带领学生远远超越普通 A Level 数学课程的范围。该课程在拓展纯数学方法的同时,引入了选修的应用模块,加深对力学、统计或决策数学的理解。透彻掌握课程大纲的结构对于高效复习和取得考试成功至关重要。

1. Overview of Year 12 WJEC Further Mathematics | WJEC 进阶数学 Year 12 概述

The AS Further Mathematics qualification with WJEC consists of two units. Unit 1 is the compulsory Further Pure Mathematics A (FP1), covering core advanced topics. Unit 2 is chosen from three applications: Further Mechanics 1 (FM1), Further Statistics 1 (FS1), or Decision Mathematics 1 (D1). The entire AS content is normally taught and examined in Year 12.

WJEC 的 AS 进阶数学资格由两个单元构成。第一单元是必修的进阶纯数学 A(FP1),涵盖核心高阶课题。第二单元从三门应用学科中选取一门:进阶力学 1(FM1)、进阶统计 1(FS1)或决策数学 1(D1)。整个 AS 内容通常在 Year 12 完成教学并参加考试。

A firm foundation in the C1–C4 pure topics from the standard Mathematics A Level is assumed, and many ideas are developed much further. The course emphasises rigorous proof, algebraic confidence, and the ability to model real-world situations.

课程以普通 A Level 数学中 C1–C4 纯数课题的扎实基础为前提,许多概念得到更深入的发展。该课程强调严谨的证明、娴熟的代数能力和对现实情境的建模能力。

The table below summarises the AS unit structure:

下表概括了 AS 单元结构:

UnitTitleAssessment
Unit 1Further Pure Mathematics AWritten exam: 1 hr 30 min (80 marks)
Unit 2Further Mechanics 1 / Further Statistics 1 / Decision 1Written exam: 1 hr 30 min (80 marks)

2. Complex Numbers: Algebra and Argand Diagrams | 复数:代数与 Argand 图

A complex number is written as z = a + bi, where a and b are real numbers and i² = – al part is Re(z) = a, and the imaginary part is Im(z) = b. The complex conjugate is z* = a – bi.

复数写作 z = a + bi,其中 a 与 b 是实数且 i² = –1。实部为 Re(z) = a,虚部为 Im(z) = b。复共轭为 z* = a – bi。

ormed component-wise, while multiplication uses the distributive law and the identity i² = – er requires multiplying the numerator and denominator by the conjugate of the denominator.

加法和减法按分量进行,而乘法运用分配律以及恒等式 i² = –1。复数除法需要将分子和分母同乘以分母的共轭。

Modulus-argument form expresses a complex number as z = r(cos θ + i sin θ), where r = |z| = √a² + b² and θ = arg(z). The principal argument satisfies –π < θ ≤ π. Multiplication and division become very tidy in this polar form.

模-辐角形式将复数表示为 z = r(cos θ + i sin θ),其中 r = |z| = √a² + b²,θ = arg(z)。主辐角满足 –π < θ ≤ π。在这种极形式下,乘法和除法变得十分简洁。

Euler's relation eiθ = cos θ + i sin θ leads to the exponential form z = reiθ. De Moivre's theorem states that (cos θ + i sin θ)n . This is used to find powers and roots of complex numbers, and to derive trigonometric identities.

欧拉公式 eiθ = cos θ + i sin θ 引出了指数形式 z = reiθ。棣莫弗定理指出,对于任意整数 n,(cos θ + i sin θ)n = cos(nθ) + i sin(nθ)。该定理可用于求复数的乘幂和方根,以及推导三角恒等式。

Loci in the Argand diagram, such as |z – z₁| = r (a circle) or |z – z₁| = |z – z₂| hading regions defined by inequalities involving the argument or modulus is also required.

Argand 图中的轨迹,如 |z – z₁| = r(圆)或 |z – z₁| = |z – z₂|(垂直平分线),是常考内容。画出由辐角或模的不等式定义的区域也在考查范围内。


3. Matrices and Linear Transformations | 矩阵与线性变换

A matrix is a rectangular array of numbers. Matrix addition and subtraction are performed element-wise, while multiplication is defined only when the number of columns in the first matrix equals the number of rows in the second. The product AB generally differs from BA.

矩阵是一个数字矩形阵列。矩阵的加减法按元素进行,而乘法仅在第一个矩阵的列数等于第二个矩阵的行数时才有定义。通常 AB 不等于 BA。

The determinant of a 2 × 2 matrix M = {|a b| |c d|} is det(M) = ad – 0, and non-singular otherwise. The inverse M⁻¹ exists if det(M) ≠ 0 and is given by 1/(ad – bc) (|d –b| |–c a|).

2 × 2 矩阵 M = {|a b| |c d|} 的行列式为 det(M) = ad – bc。若行列式为 0,矩阵奇异,否则非奇异。若 det(M) ≠ 0,逆矩阵 M⁻¹ 存在,且由 1/(ad – bc) (|d –b| |–c a|) 给出。

Matrices represent linear transformations in the plane. Common transformations include rotations, reflections, stretches, enlargements, and shears. The image of a point (x, y) under a transformation is obtained by multiplying the matrix by the column vector (x y)ᵀ.

矩阵表示平面上的线性变换。常见的变换包括旋转、反射、拉伸、缩放和切变。点 (x, y) 在变换下的像由矩阵乘以列向量 (x y)ᵀ 得到。

s T₂T₁. Finding invariant lines and lines of invariant points is a key skill; an invariant line satisfies M (x y)ᵀ = λ (x y)ᵀ for some scalar λ.

复合变换对应于按照正确顺序的矩阵乘法:若变换 T₁ 之后再作 T₂,复合矩阵为 T₂T₁。求解不变直线和不变点直线是一项关键技能;不变直线满足 M (x y)ᵀ = λ (x y)ᵀ,其中 λ 为某标量。


4. Summation of Series and the Method of Differences | 级数求和与差分法

Standard results for sums of integers, squares, and cubes are essential tools:

Σᵣ₌₁ⁿ r = n(n+1)/2, Σᵣ₌₁ⁿ r² = n(n+1)(2n+1)/6, Σᵣ₌₁ⁿ r³ = [n(n+1)/2]²

整数、平方数与立方数的标准求和公式是必备工具:

Σᵣ₌₁ⁿ r = n(n+1)/2, Σᵣ₌₁ⁿ r² = n(n+1)(2n+1)/6, Σᵣ₌₁ⁿ r³ = [n(n+1)/2]²

More complex series can be manipulated using these results together with algebraic expansion. For example, Σ(ar³ + br² + c) can be split into separate sums.

更复杂的级数可通过这些结果以及代数展开进行运算。例如 Σ(ar³ + br² + c) 可拆分为独立的求和。

The method of differences applies when the general term can be expressed as uᵣ = f(r) – f(r–1) or f(r+1) – f(r). Telescoping cancellation reduces the sum to f(n) – f(0) or similar, making evaluation straightforward.

当通项可表示为 uᵣ = f(r) – f(r–1) 或 f(r+1) – f(r) 时,可采用差分法。通过累叠相消,求和归结为 f(n) – f(0) 等形式,使计算变得直接。

Typical WJEC questions involve partial fractions to create a telescoping series, such as Σ 1/(r(r+1)). The technique is also used to prove summation formulas by induction.

典型的 WJEC 考题会通过部分分式构造可累叠级数,例如 Σ 1/(r(r+1))。该技巧也常用于通过归纳法证明求和公式。


5. Hyperbolic Functions | 双曲函数

The hyperbolic functions are defined in terms of exponentials:

sinh x = (eˣ – e⁻ˣ)/2, cosh x = (eˣ + e⁻ˣ)/2, tanh x = sinh x / cosh x

双曲函数用指数函数定义:

sinh x = (eˣ – e⁻ˣ)/2, cosh x = (eˣ + e⁻ˣ)/2, tanh x = sinh x / cosh x

asymptotes y = ±1. The reciprocal functions cosech x, sech x, and coth x are also defined.

它们的图像各不相同:sinh x 是奇函数,经过原点;cosh x 是偶函数,在 (0,1) 处取极小值;tanh x 有水平渐近线 y = ±1。倒数函数 cosech x、sech x 和 coth x 也有定义。

Fundamental identities closely mirror those of trigonometric functions but with sign differences:

cosh² x – sinh² x = 1, sinh 2x = 2 sinh x cosh x, cosh 2x = cosh² x + sinh² x

基本恒等式的形式与三角函数非常相似,但符号有别:

cosh² x – sinh² x = 1, sinh 2x = 2 sinh x cosh x, cosh 2x = cosh² x + sinh² x

Inverse hyperbolic functions are logarithmic forms: arsinh x = ln(x + √x²+1), arcosh x = ln(x + √x²–1) for x ≥ 1, and artanh x = ½ ln((1+x)/(1–x)) for |x| < 1. These can be derived by solving quadratic equations in eʸ.

反双曲函数可以表达为对数形式:arsinh x = ln(x + √x²+1),arcosh x = ln(x + √x²–1)(x ≥ 1),artanh x = ½ ln((1+x)/(1–x))(|x| < 1)。这些形式可通过求解关于 eʸ 的二次方程推导得出。

x(tanh x) = sech² x. Integration results mirror these, often used in solving differential equations.

双曲函数的微分规则与三角函数的导数类似:d/dx(sinh x) = cosh x,d/dx(cosh x) = sinh x,d/dx(tanh x) = sech² x。相应的积分结果也如此,常用于求解微分方程。


广告 / Sponsored

6. Polar Coordinates | 极坐标

axis. Conversion to Cartesian coordinates uses x = r cos θ, y = r sin θ, and r² = x² + y².

极坐标 (r, θ) 通过点到原点的距离 r 以及从正 x 轴量度的角 θ 来描述点的位置。转换为直角坐标的公式为 x = r cos θ, y = r sin θ,且 r² = x² + y²。

ses (r = a sin nθ). Sketching them involves finding symmetry, key θ-values, and maximum r.

曲线由形式为 r = f(θ) 的方程定义。常见类型包括圆(r = a)、心脏线(r = a(1 + cos θ))以及玫瑰线(r = a sin nθ)。画图时需要寻找对称性、关键 θ 值以及最大 r。

The area enclosed by a polar curve between θ = α and θ = β is given by the integral:

Area = ½ ∫ₐᵝ r² dθ

极坐标曲线在 θ = α 与 θ = β 之间围成的面积由以下积分给出:

面积 = ½ ∫ₐᵝ r² dθ

Finding areas of a single loop or between two polar curves requires careful limit determination. Integration usually involves trigonometric identities to simplify r². The formula arises from summing the areas of infinitesimal circular sectors.

求单瓣面积或两条极曲线之间的面积需要仔细确定积分上下限。积分中通常要利用三角恒等式化简 r²。该公式来源于对小扇形面积的累加。


7. First and Second Order Differential Equations | 一阶与二阶微分方程

e integrating factor method applies to linear equations dy/dx + P(x) y = Q(x), where the integrating factor is e∫ P dx.

一阶微分方程常可通过变量分离求解:改写为 f(y) dy = g(x) dx 的形式并对两边积分。积分因子法适用于线性方程 dy/dx + P(x) y = Q(x),其积分因子为 e∫ P dx。

equation am² + bm + c = 0 yields the solution type: distinct real roots m₁, m₂ give y = Aem₁x + Bem₂x; repeated root m gives y = (A + Bx)emx; complex roots α ± iβ give y = eαx(A cos βx + B sin βx).

常系数齐次二阶线性微分方程的形式为 a d²y/dx² + b dy/dx + c y = 0。辅方程 am² + bm + c = 0 决定了解的类型:不同的实根 m₁, m₂ 给出 y = Aem₁x + Bem₂x;重根 m 给出 y = (A + Bx)emx;复根 α ± iβ 给出 y = eαx(A cos βx + B sin βx)。

olution is the sum of the complementary function (CF) and a particular integral (PI). The form of the PI is chosen based on f(x): polynomial, exponential, or trigonometric. Coefficients are found by substitution and equating.

对于非齐次方程 a d²y/dx² + b dy/dx + c y = f(x),通解由余函数(CF)和特积分(PI)相加而成。PI 的形式根据 f(x) 选取:多项式、指数或三角函数。通过代入并比较系数求得未知常数。


8. Further Mechanics 1 (Optional Applied Module) | 选修模块:进阶力学 1

This module extends the mechanics encountered in the standard A Level. It begins with dimensional analysis, checking the homogeneity of equations and predicting the form of relationships using base units (mass M, length L, time T).

该模块拓展了普通 A Level 力学的内容。首先引入量纲分析,检验方程的量纲一致性,并利用基本单位(质量 M、长度 L、时间 T)预测物理关系的形式。

Work, energy and power are treated more rigorously, with the work– tential energy stored in strings and springs is introduced, using Hooke’s law T = (λ/L₀)x.

功、能与功率得到更严格的处理,将功能原理应用于在斜面上运动以及受变力作用的质点。通过胡克定律 T = (λ/L₀)x 引入弹性势能的概念,储存于细绳和弹簧中的弹性势能。

Impulse and momentum in one dimension are extended to direct collisions in two dimensions using vector methods. The principle of conservation of momentum and Newton’s law of restitution are applied to oblique impacts with smooth surfaces.

一维的冲量与动量通过向量方法延伸至二维正碰撞。动量守恒定律和牛顿恢复系数定律被应用于与光滑表面的斜碰撞问题。

derive velocity and displacement from a given acceleration function a = f(t) or a = f(v).

进阶力学还涵盖变加速运动,学生利用微积分从给定的加速度函数 a = f(t) 或 a = f(v) 推导速度和位移。


9. Further Statistics 1 (Optional Applied Module) | 选修模块:进阶统计 1

Further Statistics 1 builds on the probability and statistics knowledge from the standard course. It introduces discrete random variables in greater depth, including the expected value E(X), variance Var(X), and the sum of independent random variables.

进阶统计 1 在普通课程的概率与统计知识基础上深入展开。它更深入地介绍离散随机变量,包括期望值 E(X)、方差 Var(X) 以及独立随机变量之和的性质。

The Poisson distribution is a major focus: P(X = r) = (λʳ e–λ)/r! e are both λ. The Poisson process models random events in continuous time or space, and it approximates the binomial when n is large and p is small.

泊松分布是重点内容:P(X = r) = (λʳ e–λ)/r!,r = 0,1,2,...。其均值与方差均为 λ。泊松过程用于模拟时间或空间中的随机事件,当 n 很大而 p 很小时可近似二项分布。

Geometric distributions are also covered, modelling the number of trials up to and including the first success. Hypothesis testing for the parameter p of a binomial or Poisson distribution is carried out by calculating exact probabilities and comparing with a significance level.

几何分布也在考查范围内,用于模拟直到首次成功(含首次)的试验次数。对二项分布或泊松分布的参数 p 进行假设检验时,通过计算精确概率并与显著性水平比较来得出结论。

Contingency tables and the chi-squared test for independence are introduced. Students calculate expected frequencies and test statistic Σ (O − E)²/E, comparing against critical values from chi-squared tables.

列联表与独立性卡方检验也被引入。学生需要计算期望频数和检验统计量 Σ (O − E)²/E,并与卡方分布表中的临界值进行比较。


10. Proof by Induction | 数学归纳法证明

Mathematical induction is a powerful technique threaded throughout the FP1 syllabus. It is used to prove statements involving a positive integer n, such as summation formulas, divisibility results, and matrix identities.

数学归纳法是一条贯穿 FP1 大纲的强大技术,用于证明涉及正整数 n 的命题,如求和公式、可除性结论和矩阵恒等式。

me the statement holds for n = k. Inductive step: prove that if it holds for k, then it must hold for n = k + 1. A concluding statement completes the proof.

该方法遵循清晰的结构。奠基步:验证命题对最小的 n 值(通常 n = 1)为真。归纳假设:假设命题对 n = k 成立。归纳步:证明若命题对 k 成立,则它必对 n = k + 1 也成立。最后以总结句结束证明。

induction problems in WJEC include proving Σᵣ₌₁ⁿ r(r+1) = n(n+1)(n+2)/3, showing that 3²ⁿ – 1 is divisible by 8, or proving a recurrence relation defines a certain closed form.

WJEC 的典型归纳证明问题包括证明 Σᵣ₌₁ⁿ r(r+1) = n(n+1)(n+2)/3,证明 3²ⁿ – 1 可被 8 整除,或证明某递推关系定义了一个特定的闭形式。

Rigour in setting out the proof is expected: clearly labelled steps, correct manipulation of the k+1 case, and explicit reliance on the inductive hypothesis. Marks are awarded as much for logical structure as for algebraic accuracy.

要求证明步骤条理清晰:明确标注每一步,正确处理 k+1 情形,并明确依赖归纳假设。分数的评定既看重逻辑结构,也看重代数准确性。


11. Exam Structure and Assessment | 考试结构与评估

Each of the two AS units is assessed through a 1-hour-30-minute written paper carrying 80 marks. All questions are compulsory and can be drawn from any part of the respective specification. Units are equally weighted towards the AS qualification.

两个 AS 单元各通过一份时长 1 小时 30 分钟、满分为 80 分的笔试试卷进行考核。所有题目均为必答题,可能出自相应考纲的任何部分。各单元对 AS 资格的权重相等。

Questions typically mix shorter, skills-based items with longer, problem-solving tasks. In Unit 1, a proof by induction or a full polar curve area calculation might appear as a multi-stage question. Applied units

Published by TutorHao | Year 12 进阶数学 Revision Series | aleveler.com

广告 / Sponsored
2026年秋初中实验班提优训练789年级上下册语文数学英语人教苏教北师大译林版 初中七八九教材同步随堂作业本强化习题练…
数学 备考教辅 · 正版现货 · 与本文内容相关
查看详情 / View on Taobao参考价 ¥19.9

更多咨询请联系16621398022(同微信)

备考资讯每日更新,关注不错过
考纲变化 · 科目分析 · 学习方法
扫码关注公众号 tutorhao
在微信里长按二维码识别关注
或截图后用「扫一扫 → 相册」选择本图
公众号:tutorhao