Blog

📚 Organic Reaction Types and Mechanisms | 有机反应类型与机理梳理

Organic chemistry can look like a long list of unrelated reactions. In fact, almost every transformation belongs to a small number of reaction types, and each type follows a recognisable mechanism. Mastering these patterns helps you predict products, choose the correct reagents, and explain exam mechanisms clearly.

有机化学表面上像是许多互不相关的反应，但几乎所有转化都属于有限的几种反应类型，而且每种类型都有清晰的机理规律。掌握这些规律，可以帮助你预测产物、选择合适的试剂，并在考试中清楚地解释反应机理。

1. Why Reaction Types and Mechanisms Matter | 为什么需要梳理反应类型与机理

A mechanism describes the step-by-step movement of electrons during a reaction. It tells you which bonds break, which bonds form, and which species donate or accept electron pairs.

机理描述反应中电子一步步移动的过程，它告诉你哪些键断裂、哪些键形成，以及哪种物种提供或接受电子对。

• Curly arrows show electron movement. A full-headed arrow means a pair of electrons moves; a half-headed arrow means one electron moves in a radical step.

  弯箭头表示电子移动：完整箭头表示一对电子移动，半箭头表示自由基步骤中单个电子移动。

• Exam answers must include charges, lone pairs, and correct arrow positions. An arrow always starts from an electron-rich region and points to an electron-poor region.

  考试答案必须包含电荷、孤对电子和正确的箭头位置。箭头总是从电子富集区域出发，指向电子缺乏区域。

• If you can identify the reaction type, you can often predict the mechanism and therefore the product.

  如果你能判断反应类型，通常就能推测出反应机理，从而预测产物。

---

2. Electrophiles, Nucleophiles and Radicals | 亲电试剂、亲核试剂与自由基

Organic mechanisms are easier to follow when you understand the main attacking species.

理解主要的进攻物种之后，有机机理会变得更容易掌握。

• An electrophile is an electron-pair acceptor. It is often positively charged or polarised, for example H⁺, NO₂⁺, or the δ+ end of Br–Br.

  亲电试剂是电子对的接受体，通常带正电或具有极性，例如 H⁺、NO₂⁺，或 Br–Br 中带 δ+ 的一端。

• A nucleophile is an electron-pair donor. It carries a lone pair, for example OH⁻, CN⁻, NH₃, or H₂O.

  亲核试剂是电子对的提供者，带有孤对电子，例如 OH⁻、CN⁻、NH₃ 或 H₂O。

• A radical is a species with an unpaired electron, such as Cl· or ·CH₃. Radicals are usually formed by homolytic fission.

  自由基是含有未成对电子的物种，例如 Cl· 或 ·CH₃。自由基通常由均裂产生。

• In heterolytic fission, a covalent bond breaks unequally and forms ions. In homolytic fission, each atom keeps one electron and radicals form.

  在异裂中，共价键不均匀断裂并生成离子；在均裂中，每个原子各保留一个电子，从而生成自由基。

---

3. Free Radical Substitution | 自由基取代反应

Alkanes are relatively unreactive, but they react with halogens in the presence of ultraviolet light by free radical substitution.

烷烃相对不活泼，但在紫外光作用下可与卤素发生自由基取代反应。

Example: CH₄ + Cl₂ → CH₃Cl + HCl under hν.

例如：CH₄ + Cl₂ → CH₃Cl + HCl，条件为光照 hν。

• Initiation: Cl–Cl → 2Cl·. The chlorine–chlorine bond breaks homolytically.

  链引发：Cl–Cl → 2Cl·。氯氯键发生均裂。

• Propagation: Cl· + CH₄ → ·CH₃ + HCl, then ·CH₃ + Cl₂ → CH₃Cl + Cl·. These two steps repeat.

  链增长：Cl· + CH₄ → ·CH₃ + HCl，然后 ·CH₃ + Cl₂ → CH₃Cl + Cl·。这两步不断重复。

• Termination: any two radicals combine, for example ·CH₃ +

  Published by TutorHao | Chemistry Revision Series | aleveler.com

  Find Physics Textbooks on eBay UK

  New, used and second-hand copies of textbooks and revision guides are often much cheaper than retail — check current listings and prices before you buy.

  Browse on eBay UK →

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

  Share this:

  • Email
  • More

  • LinkedIn
  • X
  • Facebook
  • Tumblr
  • Reddit
  • Pinterest
  • Telegram
  • WhatsApp

  Like this:

  Like Loading…

📚 Calculus Core Concepts and Problem-Solving Techniques | 微积分核心概念与解题技巧

Calculus is the mathematical study of continuous change, and it forms the backbone of advanced mathematics in the A-Level syllabus. This article provides a comprehensive review of core calculus concepts and essential problem-solving techniques that students must master for examinations.

微积分是研究连续变化的数学学科，是 A-Level 数学大纲中高级数学内容的核心基础。本文系统梳理微积分核心概念与考试必备解题技巧，帮助学生高效复习、精准提分。

---

1. Limits and Continuity | 极限与连续性

The concept of a limit describes the value that a function approaches as the input approaches a certain point. We write: lim(x→a) f(x) = L, meaning that as x gets arbitrarily close to a, f(x) gets arbitrarily close to L.

极限描述的是当自变量趋近于某一点时，函数值所趋近的数值。记作：lim(x→a) f(x) = L，表示当 x 无限接近 a 时，f(x) 无限接近 L。

For a function to be continuous at a point x = a, three conditions must hold: f(a) must be defined, lim(x→a) f(x) must exist, and lim(x→a) f(x) = f(a). If any condition fails, the function is discontinuous at that point.

函数在 x = a 处连续必须满足三个条件：f(a) 有定义、lim(x→a) f(x) 存在，且 lim(x→a) f(x) = f(a)。任一条件不满足，则函数在该点不连续。

When evaluating limits, common techniques include direct substitution, factoring and cancelling, rationalising, and using standard limits such as lim(x→0) sin x / x = 1.

求极限的常用方法包括：直接代入、因式分解约分、有理化处理，以及运用标准极限，例如 lim(x→0) sin x / x = 1。

---

2. The Derivative: Definition and Geometric Meaning | 导数的定义与几何意义

The derivative of a function f at a point x is defined as the limit of the difference quotient: f'(x) = lim(h→0) [f(x+h) – f(x)] / h. This represents the instantaneous rate of change of f at x.

函数 f 在点 x 处的导数定义为差商的极限：f'(x) = lim(h→0) [f(x+h) – f(x)] / h。它表示 f 在 x 处的瞬时变化率。

Geometrically, the derivative f'(a) gives the slope of the tangent line to the curve y = f(x) at the point (a, f(a)). The equation of this tangent line is y – f(a) = f'(a)(x – a).

在几何意义上，导数 f'(a) 表示曲线 y = f(x) 在点 (a, f(a)) 处切线的斜率。切线方程为 y – f(a) = f'(a)(x – a)。

It is essential to distinguish between average rate of change over an interval [x₁, x₂] and instantaneous rate of change. The average rate is [f(x₂) – f(x₁)] / (x₂ – x₁), while the instantaneous rate is the limit as the interval shrinks to zero.

务必区分区间 [x₁, x₂] 上的平均变化率与瞬时变化率。平均变化率为 [f(x₂) – f(x₁)] / (x₂ – x₁)，而瞬时变化率是区间长度趋近于零时的极限。

---

3. Differentiation Rules | 求导法则

The power rule states that if f(x) = xⁿ, then f'(x) = nxⁿ⁻¹. This rule applies to all real exponents n, including negative and fractional powers.

幂法则指出：若 f(x) = xⁿ，则 f'(x) = nxⁿ⁻¹。该法则适用于一切实数指数 n，包括负指数与分数指数。

The product rule states that if y = uv, then dy/dx = u(dv/dx) + v(du/dx). The quotient rule states that if y = u/v, then dy/dx = [v(du/dx) – u(dv/dx)] / v².

乘积法则：若 y = uv，则 dy/dx = u(dv/dx) + v(du/dx)。商法则：若 y = u/v，则 dy/dx = [v(du/dx) – u(dv/dx)] / v²。

Students should memorise the derivatives of standard functions: d/dx(sin x) = cos x, d/dx(cos x) = -sin x, d/dx(eˣ) = eˣ, and d/dx(ln x) = 1/x.

学生需要熟记基本函数的导数：d/dx(sin x) = cos x，d/dx(cos x) = -sin x，d/dx(eˣ) = eˣ，d/dx(ln x) = 1/x。

---

4. The Chain Rule | 链式法则

The chain rule is used to differentiate composite functions. If y = f(g(x)), then dy/dx = f'(g(x)) · g'(x), or equivalently, dy/dx = dy/du · du/dx where u = g(x).

链式法则用于求复合函数的导数。若 y = f(g(x))，则 dy/dx = f'(g(x)) · g'(x)，等价地可写成 dy/dx = dy/du · du/dx，其中 u = g(x)。

For example, to differentiate y = (3x² + 1)⁵, let u = 3x² + 1, then y = u⁵. We have dy/du = 5u⁴ and du/dx = 6x, so dy/dx = 5(3x² + 1)⁴ × 6x = 30x(3x² + 1)⁴.

例如，对 y = (3x² + 1)⁵ 求导，令 u = 3x² + 1，则 y = u⁵。dy/du = 5u⁴，du/dx = 6x，因此 dy/dx = 5(3x² + 1)⁴ × 6x = 30x(3x² + 1)⁴。

A common mnemonic is “differentiate the outside, keep the inside, multiply by the derivative of the inside.” This helps avoid the frequent error of forgetting to multiply by the inner derivative.

口诀是”外层求导、内层照写、乘以内层导数”。这有助于避免常见的错误——忘记乘以内层函数的导数。

---

5. Implicit Differentiation | 隐函数求导

When y is defined implicitly as a function of x through an equation such as x² + y² = 25, we differentiate both sides with respect to x, treating y as a function of x and applying the chain rule whenever we differentiate a term involving y.

当 y 通过方程（如 x² + y² = 25）隐式地由 x 定义时，我们对方程两边关于 x 求导，将 y 视为 x 的函数，并在对含 y 的项求导时运用链式法则。

For the equation x² + y² = 25, differentiating both sides gives 2x + 2y(dy/dx) = 0. Solving for dy/dx yields dy/dx = -x/y.

对于 x² + y² = 25，两边求导得 2x + 2y(dy/dx) = 0。解出 dy/dx = -x/y。

Implicit differentiation is particularly useful for finding derivatives of curves that cannot be easily written as y = f(x), such as circles, ellipses, and more complex relations.

隐函数求导尤其适用于那些不易写成 y = f(x) 形式的曲线，例如圆、椭圆以及更复杂的关系式。

---

6. Parametric Differentiation | 参数方程求导

When a curve is defined parametrically by x = f(t) and y = g(t), the derivative dy/dx is found using: dy/dx = (dy/dt) / (dx/dt), provided that dx/dt ≠ 0.

当曲线由参数方程 x = f(t)、y = g(t) 定义时，导数 dy/dx 通过下式求得：dy/dx = (dy/dt) / (dx/dt)，前提是 dx/dt ≠ 0。

For example, if x = t² and y = t³, then dx/dt = 2t and dy/dt = 3t², giving dy/dx = (3t²)/(2t) = 3t/2.

例如，若 x = t²、y = t³，则 dx/dt = 2t，dy/dt = 3t²，因此 dy/dx = (3t²)/(2t) = 3t/2。

The second derivative in parametric form is d²y/dx² = [d/dt(dy/dx)] / (dx/dt). This requires differentiating dy/dx with respect to t and then dividing by dx/dt.

参数形式的二阶导数为 d²y/dx² = [d/dt(dy/dx)] / (dx/dt)。即先对 dy/dx 关于 t 求导，再除以 dx/dt。

---

7. Increasing, Decreasing, and Stationary Points | 增减性与驻点

If dy/dx > 0 on an interval, the function is increasing; if dy/dx < 0, it is decreasing. Stationary points occur where dy/dx = 0.

若区间内 dy/dx > 0，函数递增；若 dy/dx < 0，函数递减。驻点出现在 dy/dx = 0 处。

To classify stationary points, use the second derivative test: if d²y/dx² > 0 at a stationary point, it is a local minimum; if d²y/dx² < 0, it is a local maximum. If d²y/dx² = 0, the test is inconclusive, and one should examine the sign of dy/dx on either side.

使用二阶导数判别驻点类型：若驻点处 d²y/dx² > 0，则为局部极小值；若 d²y/dx² < 0，则为局部极大值。若 d²y/dx² = 0，判别法失效，需考察 dy/dx 两侧的符号变化。

An inflection point is where the curve changes concavity, which occurs where d²y/dx² = 0 and the sign of d²y/dx² changes. Not all points with zero second derivative are inflection points.

拐点是曲线凹凸性发生改变的点，出现在 d²y/dx² = 0 且 d²y/dx² 符号发生变化处。并非所有二阶导数为零的点都是拐点。

---

8. Indefinite Integration | 不定积分

Integration is the reverse process of differentiation. The indefinite integral of f(x) with respect to x is written as ∫ f(x) dx = F(x) + C, where F'(x) = f(x) and C is the constant of integration.

积分是求导的逆运算。函数 f(x) 关于 x 的不定积分记作 ∫ f(x) dx = F(x) + C，其中 F'(x) = f(x)，C 为积分常数。

The power rule for integration states that ∫ xⁿ dx = xⁿ⁺¹ / (n+1) + C for n ≠ -1. For n = -1, we have ∫ x⁻¹ dx = ∫ (1/x) dx = ln|x| + C.

幂函数积分法则：∫ xⁿ dx = xⁿ⁺¹ / (n+1) + C（n ≠ -1）。当 n = -1 时，∫ x⁻¹ dx = ∫ (1/x) dx = ln|x| + C。

Standard integrals include: ∫ sin x dx = -cos x + C, ∫ cos x dx = sin x + C, ∫ eˣ dx = eˣ + C. For linear arguments, remember the factor 1/a: ∫ e^(ax) dx = (1/a)e^(ax) + C.

常用积分公式包括：∫ sin x dx = -cos x + C，∫ cos x dx = sin x + C，∫ eˣ dx = eˣ + C。对于线性函数作为自变量的情况，注意系数因子 1/a：∫ e^(ax) dx = (1/a)e^(ax) + C。

---

9. Integration by Substitution | 换元积分法

Integration by substitution is the reverse of the chain rule. If we let u = g(x), then du = g'(x) dx, and the integral ∫ f(g(x))g'(x) dx becomes ∫ f(u) du.

换元积分法是链式法则的逆运算。令 u = g(x)，则 du = g'(x) dx，于是积分 ∫ f(g(x))g'(x) dx 化为 ∫ f(u) du。

For definite integrals, the limits must also be changed when a substitution is made. If x = a corresponds to u = g(a) and x = b corresponds to u = g(b), then:

对于定积分，作换元时必须同步更换积分上下限。若 x = a 对应 u = g(a)，x = b 对应 u = g(b)，则：

∫ₐᵇ f(g(x))g'(x) dx = ∫₍g(a)₎ᵍ⁽ᵇ⁾ f(u) du

When the integrand involves √(a² – x²), the substitution x = a sin θ is often effective. For √(a² + x²), try x = a tan θ. Recognising these patterns comes with practice.

当被积函数含有 √(a² – x²) 时，常令 x = a sin θ。对于 √(a² + x²)，可尝试 x = a tan θ。熟悉这些模式需要大量练习。

---

10. Integration by Parts | 分部积分法

Integration by parts is derived from the product rule for differentiation. The formula is: ∫ u dv = uv – ∫ v du. Choose u and dv so that ∫ v du is simpler than the original integral.

分部积分法由乘积法则推导而来，公式为：∫ u dv = uv – ∫ v du。选择合适的 u 和 dv，使得 ∫ v du 比原积分更简单。

A helpful ordering rule for choosing u is “LIATE”: Logarithmic functions, Inverse trigonometric functions, Algebraic functions, Trigonometric functions, and Exponential functions. Functions higher on the list should generally be chosen as u.

选择 u 的常用优先顺序是”LIATE”法则：对数函数、反三角函数、代数函数、三角函数、指数函数。在列表中越靠前的函数，通常越应选作 u。

For example, to compute ∫ x·eˣ dx, let u = x and dv = eˣ dx. Then du = dx and v = eˣ, giving ∫ x·eˣ dx = x·eˣ – ∫ eˣ dx = x·eˣ – eˣ + C = eˣ(x – 1) + C.

例如，计算 ∫ x·eˣ dx 时，令 u = x，dv = eˣ dx，则 du = dx，v = eˣ，于是 ∫ x·eˣ dx = x·eˣ – ∫ eˣ dx = x·eˣ – eˣ + C = eˣ(x – 1) + C。

---

11. Definite Integrals and Areas | 定积分与面积

The definite integral ∫ₐᵇ f(x) dx = F(b) – F(a), where F is any antiderivative of f. This is known as the Fundamental Theorem of Calculus.

定积分 ∫ₐᵇ f(x) dx = F(b) – F(a)，其中 F 是 f 的任意一个原函数。这就是微积分基本定理。

The area bounded by the curve y = f(x), the x-axis, and the vertical lines x = a and x = b is given by ∫ₐᵇ |f(x)| dx. If f(x) ≥ 0 on [a, b], the area is simply ∫ₐᵇ f(x) dx.

由曲线 y = f(x)、x 轴以及直线 x = a 和 x = b 围成的面积为 ∫ₐᵇ |f(x)| dx。若 f(x) ≥ 0，则面积即为 ∫ₐᵇ f(x) dx。

To find the area between two curves y = f(x) and y = g(x), we integrate the difference of the upper and lower functions: Area = ∫ₐᵇ |f(x) – g(x)| dx, where a and b are the x-coordinates of their intersection points.

求两条曲线 y = f(x) 与 y = g(x) 之间的面积时，积分上下函数之差：面积 = ∫ₐᵇ |f(x) – g(x)| dx，其中 a、b 为两曲线交点的横坐标。

---

12. First-Order Differential Equations | 一阶微分方程

A first-order differential equation involves the first derivative dy/dx and may be solved by separation of variables when it can be written in the form dy/dx = f(x)g(y). Rearranging gives ∫ (1/g(y)) dy = ∫ f(x) dx.

一阶微分方程涉及一阶导数 dy/dx。当方程可写成 dy/dx = f(x)g(y) 的形式时，可用分离变量法求解。整理后得到 ∫ (1/g(y)) dy = ∫ f(x) dx。

For example, to solve dy/dx = 2xy, separate variables: ∫ (1/y) dy = ∫ 2x dx, giving ln|y| = x² + C. Exponentiating both sides yields y = Ae^(x²), where A = ±eᶜ.

例如，解 dy/dx = 2xy，分离变量得 ∫ (1/y) dy = ∫ 2x dx，即 ln|y| = x² + C。两边取指数得 y = Ae^(x²)，其中 A = ±eᶜ。

Initial conditions are used to determine the arbitrary constant. For instance, if y(0) = 3, then 3 = A·e⁰ = A, so the particular solution is y = 3e^(x²).

利用初始条件确定任意常数。例如，若 y(0) = 3，则 3 = A·e⁰ = A，因此特解为 y = 3e^(x²)。

---

Published by TutorHao | Mathematics Revision Series | aleveler.com

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

📚 Machine Learning for Parkinson’s Disease Diagnosis | 机器学习与帕金森病诊断模型

Machine learning (ML) has emerged as a powerful tool in medical diagnosis, enabling computers to learn patterns from patient data and support clinical decision-making. Among its many applications, diagnosing Parkinson’s disease—a progressive neurological disorder affecting over 10 million people worldwide—stands out as a compelling case study. This article explores how ML models analyse voice recordings and other biomarkers to distinguish Parkinson’s patients from healthy individuals, and how these techniques fit within the A-Level Computer Science curriculum.

机器学习（ML）已成为医学诊断领域中的强大工具，它让计算机能够从患者数据中学习模式并辅助临床决策。在其众多应用场景中，诊断帕金森病——一种影响全球超过一千万人的进行性神经系统疾病——作为一个引人注目的案例脱颖而出。本文将探讨机器学习模型如何分析嗓音录音及其他生物标志物，以区分帕金森患者与健康个体，以及这些技术如何融入A-Level计算机科学课程体系。

---

1. Understanding Parkinson’s Disease | 认识帕金森病

Parkinson’s disease is a neurodegenerative condition characterised by the progressive loss of dopamine-producing neurons in the substantia nigra region of the brain. Common symptoms include tremors, rigidity, bradykinesia (slowness of movement), and postural instability. Notably, approximately 90% of Parkinson’s patients exhibit some form of vocal impairment, making voice analysis a promising non-invasive diagnostic pathway.

帕金森病是一种神经退行性疾病，其特征是大脑黑质区域中产生多巴胺的神经元逐渐丧失。常见症状包括震颤、肌肉强直、运动迟缓（动作缓慢）和姿势不稳。值得注意的是，大约90%的帕金森患者表现出某种形式的发声障碍，这使得嗓音分析成为一种前景广阔的无创诊断途径。

Traditional diagnosis relies on clinical observation and neurological examinations, which can be subjective and may miss early-stage cases. By the time motor symptoms become apparent, significant neural damage has already occurred. This motivates the use of computational methods that can detect subtle patterns in biological signals before overt symptoms emerge.

传统诊断依赖临床观察和神经学检查，这往往带有主观性，且可能遗漏早期病例。当运动症状变得明显时，显著的神经损伤已经发生。这促使我们使用计算方法在明显症状出现之前检测生物信号中的细微模式。

---

2. Machine Learning Fundamentals | 机器学习基础概念

Machine learning is a branch of artificial intelligence that enables systems to learn from data without being explicitly programmed. In supervised learning, the algorithm receives labelled training data—input-output pairs—and learns a mapping function from inputs to outputs. For Parkinson’s diagnosis, the input is a set of voice measurement features, and the output is a binary label: ‘patient’ (1) or ‘healthy’ (0).

机器学习是人工智能的一个分支，它使系统无需显式编程即可从数据中学习。在监督学习中，算法接收带标签的训练数据——即输入-输出对——并学习从输入到输出的映射函数。对于帕金森诊断而言，输入是一组嗓音测量特征，输出是二分类标签：“患者”（1）或“健康”（0）。

Classification problems such as this can be tackled using a variety of algorithms, including decision trees, support vector machines (SVM), k-nearest neighbours (k-NN), and artificial neural networks (ANN). Each algorithm has different strengths regarding interpretability, handling of non-linear relationships, and resistance to overfitting.

诸如此类的分类问题可以使用多种算法来解决，包括决策树、支持向量机（SVM）、k近邻（k-NN）和人工神经网络（ANN）。每种算法在可解释性、处理非线性关系的能力以及抗过拟合性能方面各有优势。

---

3. The Dataset: Voice Biomarkers | 数据集：嗓音生物标志物

A widely studied resource for Parkinson’s diagnosis is the UCI Parkinson’s Disease Classification dataset. It contains 195 sustained vowel phonations from 31 subjects, of whom 23 have Parkinson’s disease. Each recording is represented by 22 voice features plus a binary status label. These features fall into several categories: frequency measures, jitter, shimmer, and harmonic-to-noise ratios.

帕金森诊断研究中使用广泛的一个资源是UCI帕金森病分类数据集。该数据集包含31名受试者（其中23人患有帕金森病）的195次持续元音发声记录。每条录音由22个嗓音特征加一个二分类状态标签表示。这些特征分为几个类别：频率测量、抖动（jitter）、光泽度（shimmer）和谐波噪声比。

Frequency features include the average fundamental frequency (MDVP:Fo), the maximum (Fhi) and minimum (Flo) frequencies. Jitter measures capture cycle-to-cycle variations in pitch period, such as Jitter(%) and Jitter:RAP, while shimmer measures quantify amplitude instability across consecutive voice cycles. Additional features such as the noise-to-harmonics ratio (NHR) and recurrence period density entropy (RPDE) provide insights into the breathiness and complexity of the voice signal.

频率特征包括平均基频（MDVP:Fo）、最大频率（Fhi）和最小频率（Flo）。抖动参数捕捉基音周期的逐周期变异，如Jitter(%)和Jitter:RAP；而光泽度参数量化连续嗓音周期之间的振幅不稳定程度。其他特征如噪声谐波比（NHR）和复发周期密度熵（RPDE）则提供关于嗓音气息度和复杂度的深层信息。

---

4. Feature Engineering and Selection | 特征工程与特征选择

Raw voice recordings are high-dimensional and noisy. Feature engineering transforms these raw signals into meaningful numerical representations. The 22 features in the UCI dataset were extracted using the Praat acoustic analysis software and MDVP. Once extracted, feature selection helps identify which attributes contribute most to accurate classification, reducing dimensionality and computational cost.

原始嗓音录音是高维度且含噪的。特征工程将这些原始信号转化为有意义的数值表示。UCI数据集中的22个特征是通过Praat声学分析软件和MDVP工具提取的。提取完成后，特征选择有助于识别哪些属性对准确分类贡献最大，从而降低维度并减少计算成本。

Common feature selection techniques include correlation analysis, mutual information, and feature importance ranking from tree-based models. For instance, if two features such as MDVP:Fo and Jitter(%) are highly correlated, one may be redundant and can be removed without significant loss of information.

常用的特征选择技术包括相关分析、互信息法以及基于树模型的特征重要性排序。例如，如果MDVP:Fo和Jitter(%)两个特征高度相关，其中一个可能冗余，可以在不显著损失信息的情况下将其移除。

A useful mathematical framework for scoring features is the Fisher discriminant ratio, which measures the separation between two classes relative to within-class variance. A higher score indicates a more discriminative feature.

一个实用的特征评分数学框架是Fisher判别比，它衡量两个类别之间的分离程度相对于类内方差的大小。分数越高，表明特征的判别能力越强。

---

5. Model Selection: Decision Trees, SVM, and Neural Networks | 模型选择：决策树、支持向量机与神经网络

Three classic algorithms are frequently applied to this problem. A decision tree partitions the feature space using a series of if-then-else rules. At each node, the algorithm selects the attribute that best splits the data according to criteria such as information gain or Gini impurity. Decision trees are highly interpretable—clinicians can trace exactly how a prediction was made—but they tend to overfit unless pruned or limited in depth.

三种经典算法常被用于此类问题。决策树通过一系列“如果-那么-否则”规则来划分特征空间。在每个节点，算法根据信息增益或基尼不纯度等准则，选择最能有效分割数据的属性。决策树具有高度的可解释性——临床医生可以精确追踪预测的生成过程——但除非进行剪枝或限制深度，否则容易过拟合。

Support vector machines aim to find a hyperplane that maximises the margin between the two classes. For non-linearly separable data, the kernel trick maps inputs into a higher-dimensional space where a linear separator exists. A radial basis function (RBF) kernel is commonly used for voice data, as the relationship between acoustic features and disease status is inherently non-linear.

支持向量机的目标是找到一个使两个类别之间间隔最大化的超平面。对于非线性可分的数据，核技巧将输入映射到更高维空间中，在该空间中存在线性分隔面。径向基函数（RBF）核常被用于嗓音数据，因为声学特征与疾病状态之间的关系本质上是非线性的。

Artificial neural networks, particularly feedforward networks with hidden layers, can model complex non-linear functions. A typical architecture for this task might have an input layer of 22 neurons, one or two hidden layers with 8-16 neurons each using ReLU activation, and an output layer with sigmoid activation producing a probability between 0 and 1. The network learns weights via backpropagation and gradient descent.

人工神经网络，特别是带隐藏层的前馈网络，能够建模复杂的非线性函数。此任务的典型架构可以是：输入层22个神经元，一个或两个隐藏层每层8-16个神经元并使用ReLU激活函数，输出层使用Sigmoid激活函数生成0到1之间的概率。网络通过反向传播和梯度下降学习权重。

---

6. Training and Testing Splits | 训练集与测试集划分

A fundamental principle in supervised learning is that a model must be evaluated on data it has never seen during training. The dataset is typically partitioned into a training set (e.g., 80% of instances) and a test set (e.g., 20%). The model learns its parameters from the training set only, after which its generalisation ability is measured on the test set.

监督学习的一个基本原则是：模型必须在训练期间从未见过的数据上进行评估。数据集通常被划分为训练集（例如80%的样本）和测试集（例如20%的样本）。模型仅从训练集学习参数，然后通过在测试集上的表现来衡量其泛化能力。

For small datasets—the UCI Parkinson dataset contains only 195 instances—this simple split can be unstable. If the test set happens to be unrepresentative, reported accuracy might be misleading. To mitigate this, k-fold cross-validation is used: the data is divided into k folds, and the model is trained k times, each time using k−1 folds for training and the remaining fold for validation. The final performance is the average across all k validation runs.

对于小型数据集——UCI帕金森数据集仅包含195条样本——简单划分可能不稳定。如果测试集恰好不具有代表性，报告的准确率可能具有误导性。为缓解这一问题，可使用k折交叉验证：将数据划分为k折，模型训练k次，每次使用k−1折进行训练、剩余一折用于验证。最终性能为所有k次验证结果的平均值。

Formally, if the dataset is D = {d₁, d₂, …, dₙ}, then D is shuffled and split into k equal-sized subsets D₁, D₂, …, Dₖ. For iteration i, the model trains on D Dᵢ and validates on Dᵢ.

形式化地说，如果数据集为 D = {d₁, d₂, …, dₙ}，则将其打乱并划分为k个大小相等的子集 D₁, D₂, …, Dₖ。在第i次迭代中，模型在 D Dᵢ 上训练并在 Dᵢ 上验证。

---

7. Evaluation Metrics: Accuracy and Beyond | 评估指标：准确率及其局限

Accuracy is the most intuitive metric: it is the proportion of correctly classified instances among all instances. However, accuracy alone is insufficient when class distributions are imbalanced—for example, when 74% of the dataset belongs to the positive class, a naive classifier that always predicts ‘patient’ would achieve 74% accuracy without learning anything.

准确率是最直观的指标：它是所有样本中被正确分类样本所占的比例。然而，当类别分布不平衡时，仅靠准确率是不够的——例如，当74%的数据属于正类时，一个总是预测“患者”的朴素分类器就能达到74%的准确率，而实际上它什么也没学到。

We therefore consider the confusion matrix, a 2 × 2 table containing true positives (TP), true negatives (TN), false positives (FP), and false negatives (FN). From this matrix we derive three key metrics:

因此我们需要引入混淆矩阵，它是一个2 × 2表格，包含真正例（TP）、真负例（TN）、假正例（FP）和假负例（FN）。由此矩阵可以推导出三个关键指标：

• Precision（精确率）= TP / (TP + FP) — the proportion of positive predictions that are actually correct.
• Recall or sensitivity（召回率/敏感度）= TP / (TP + FN) — the proportion of actual positives that are correctly identified.
• F1-score（F1分数）= 2 × (Precision × Recall) / (Precision + Recall) — the harmonic mean of precision and recall.

The overall accuracy is:

总体准确率为：

Accuracy = (TP + TN) / (TP + TN + FP + FN)

In medical diagnosis, recall is especially critical: a false negative means a sick patient is sent home untreated. Meanwhile, precision matters for avoiding unnecessary treatment and patient anxiety caused by false alarms.

在医学诊断中，召回率尤为关键：漏诊意味着一位真正的患者被当作健康人而未得到治疗。同时，精确率对于避免因误报导致不必要的治疗和患者焦虑也极为重要。

---

8. The ROC Curve and AUC | ROC曲线与AUC

For models that output probabilities rather than hard labels, the receiver operating characteristic (ROC) curve visualises the trade-off between true positive rate (sensitivity) and false positive rate (1 − specificity) across all possible classification thresholds. Each threshold yields a different point on the curve.

对于输出概率而非硬标签的模型，接收者操作特征（ROC）曲线在全部可能的分类阈值下，可视化真正例率（敏感度）与假正例率（1 − 特异度）之间的权衡。每个阈值对应曲线上的不同点。

The area under the ROC curve (AUC) summarises overall model quality as a single number between 0.5 (random guessing) and 1.0 (perfect discrimination). An AUC of 0.95, commonly reported for SVM models on Parkinson’s voice data, means that given a random pair of one patient and one healthy control, the model correctly ranks the patient as more likely to have the disease 95% of the time.

ROC曲线下面积（AUC）将模型的整体质量综合为一个介于0.5（随机猜测）和1.0（完美判别）之间的数值。帕金森嗓音数据上的SVM模型通常报告的AUC为0.95，这意味着随机抽取一个患者和一个健康对照，模型在95%的情况下能正确判定患者更可能患有该疾病。

---

9. Overfitting and Regularisation | 过拟合与正则化

Overfitting occurs when a model learns the training data too well, capturing noise rather than underlying patterns. Symptoms include high training accuracy but poor test accuracy. In the Parkinson’s context, an overfitted model might memorise the specific voice idiosyncrasies of the 23 patients in the dataset, failing to generalise to new patients.

过拟合发生在模型对训练数据学习得过好时，捕获的是噪声而非潜在模式。其症状表现为训练准确率很高但测试准确率很差。在帕金森诊断语境下，过拟合的模型可能记住了数据集中23位患者的具体嗓音特征，而无法泛化到新患者。

Several strategies combat overfitting. First, regularisation adds a penalty term to the loss function, discouraging large weights. For example, L2 regularisation modifies the loss function to include λ∑wᵢ², where λ controls the strength of penalisation. Second, decision trees can be pruned or constrained by maximum depth. Third, dropout in neural networks randomly deactivates neurons during training, forcing the network to learn more robust features.

有几种策略可以对抗过拟合。首先，正则化在损失函数中加入惩罚项，抑制过大的权重。例如，L2正则化将损失函数修改为包含 λ∑wᵢ² 的形式，其中λ控制惩罚的强度。其次，决策树可以通过剪枝或限制最大深度来约束。第三，神经网络中的Dropout在训练时随机停用神经元，迫使网络学习更稳健的特征。

---

10. Challenges in Real-World Deployment | 实际部署中的挑战

Despite promising laboratory results, deploying ML models for Parkinson’s diagnosis in clinical settings faces significant hurdles. Data quality is a primary concern: voice recordings collected in noisy clinic environments differ from quiet laboratory conditions, degrading model performance. The UCI dataset is also limited—195 samples from only 31 subjects mean the model may not capture the full demographic and linguistic diversity of Parkinson’s patients.

尽管实验室结果令人振奋，但在临床环境中部署用于帕金森诊断的机器学习模型仍面临重大障碍。数据质量是首要关切：在嘈杂的诊所环境中采集的嗓音录音与安静的实验室条件不同，会导致模型性能下降。UCI数据集也很有限——仅来自31位受试者的195条样本意味着模型可能无法涵盖帕金森患者完整的年龄人口统计和语言多样性。

Model interpretability poses another challenge. A clinician cannot prescribe deep-brain stimulation or dopamine replacement therapy based on a black-box neural network output alone. Explainable AI techniques such as SHAP (SHapley Additive exPlanations) values help identify which voice features most influenced a model’s prediction, providing a bridge between computational output and clinical judgement.

模型的可解释性构成另一个挑战。临床医生不能仅凭黑箱神经网络的输出就决定实施脑深部刺激或多巴胺替代疗法。可解释人工智能技术，如SHAP（SHapley加性解释）值，可以识别出哪些嗓音特征对模型的预测影响最大，从而在计算输出与临床判断之间架起桥梁。

---

11. Ethical Considerations and Data Privacy | 伦理考量与数据隐私

Medical machine learning carries profound ethical responsibilities. Training data often contain sensitive health information, and regulations such as the UK GDPR and the Data Protection Act 2018 impose strict requirements on data storage, anonymisation, and consent. Researchers must ensure that patient identities cannot be re-identified from de-identified datasets.

医学机器学习承担着深远的伦理责任。训练数据通常包含敏感的健康信息，英国GDPR和《2018年数据保护法》等法规对数据存储、匿名化和知情同意提出了严格要求。研究人员必须确保无法从去标识化数据集中重新识别患者身份。

Bias is equally concerning. If a model is trained predominantly on male voices, it may underperform on female patients, whose fundamental frequency is typically higher. Models must be validated on diverse populations to avoid exacerbating existing health inequalities. Furthermore, algorithmic diagnosis should serve as a decision-support tool, not a replacement for qualified medical professionals.

偏差同样令人担忧。如果模型主要基于男性嗓音训练，可能在女性患者——其基频通常更高——身上表现不佳。模型必须在多样化的人群中验证，避免加剧现有的健康不平等。此外，算法诊断应作为决策支持工具，而非取代合格医疗专业人员的角色。

---

12. Future Directions and AI Ethics | 未来方向与人工智能伦理

The future of ML in Parkinson’s diagnosis lies in richer data modalities and more sophisticated architectures. Wearable sensors can continuously collect movement data, enabling models to detect subtle gait abnormalities. Longitudinal studies can track disease progression, turning a binary classification problem into a regression problem that predicts UPDRS (Unified Parkinson’s Disease Rating Scale) scores over time. Deep learning models, including convolutional neural networks applied directly to raw audio spectrograms, may eliminate the need for manually engineered features.

机器学习在帕金森诊断中的未来在于更丰富的数据模态和更先进的架构。可穿戴传感器可以持续采集运动数据，使模型能够检测细微的步态异常。纵向研究可以追踪疾病进展，将二分类问题转化为预测UPDRS（统一帕金森病评定量表）评分随时间变化的回归问题。深度学习模型，包括直接应用于原始音频频谱图的卷积神经网络，可能消除对人工设计特征的需求。

For A-Level Computer Science students, this application area exemplifies the complete data science pipeline: data collection, cleaning, feature engineering, model selection, training, evaluation, and ethical reflection. It demonstrates how abstract concepts such as information gain, gradient descent, and confusion matrices translate into technologies that can potentially transform patient lives. As ML models become more accurate and interpretable, their integration into clinical workflows promises earlier detection, better treatment monitoring, and ultimately, improved quality of life for millions living with Parkinson’s disease.

对于A-Level计算机科学学生而言，这一应用领域展示了完整的数据科学流程：数据采集、清洗、特征工程、模型选择、训练、评估和伦理反思。它展示了信息增益、梯度下降和混淆矩阵等抽象概念如何转化为有可能改变患者生活的技术。随着机器学习模型变得更加准确和可解释，它们与临床工作流程的融合预示着更早的诊断、更好的治疗监测，并最终改善数百万帕金森病患者的生活质量。

Published by TutorHao | Computer Science Revision Series | aleveler.com

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

📚 Probability Models and Their Applications | 概率模型及其应用

Probability models are mathematical frameworks that describe random phenomena and quantify uncertainty. They are essential in statistics, science, engineering, finance, and everyday decision-making.

概率模型是描述随机现象并量化不确定性的数学框架。它们在统计、科学、工程、金融以及日常决策中至关重要。

---

1. Random Experiments and Sample Spaces | 随机试验与样本空间

A random experiment is a procedure whose outcome cannot be predicted with certainty. The set of all possible outcomes is called the sample space, usually denoted by Ω (omega).

随机试验是结果无法确定预测的过程。所有可能结果的集合称为样本空间，通常用Ω表示。

For example, tossing a fair coin gives Ω = {H, T}. Rolling a fair six-sided die gives Ω = {1, 2, 3, 4, 5, 6}. Each outcome in a fair setting is equally likely.

例如，抛一枚公平的硬币得到Ω = {H, T}。掷一枚公平的六面骰子得到Ω = {1, 2, 3, 4, 5, 6}。在公平情况下，每个结果等可能发生。

An event is any subset of the sample space. Events can be combined using set operations:

事件是样本空间的任意子集。事件可以通过集合运算组合：

• A ∪ B means “A or B occurs” (union).
• A ∪ B表示”A或B发生”（并）。
• A ∩ B means “A and B occur” (intersection).
• A ∩ B表示”A与B都发生”（交）。
• Aᶜ means “A does not occur” (complement).
• Aᶜ表示”A不发生”（补）。

For equally likely outcomes, the probability of event A is P(A) = |A| / |Ω|, where |A| is the number of outcomes in A.

对于等可能结果，事件A的概率为P(A) = |A| / |Ω|，其中|A|是A中结果的个数。

---

2. Probability Axioms and Basic Rules | 概率公理与基本规则

The three axioms of probability form the foundation of all probability models:

概率的三条公理构成了所有概率模型的基础：

• Axiom 1: For any event A, 0 ≤ P(A) ≤ 1.
• 公理1：对任何事件A，有0 ≤ P(A) ≤ 1。
• Axiom 2: The probability of the sample space is 1, i.e. P(Ω) = 1.
• 公理2：样本空间的概率为1，即P(Ω) = 1。
• Axiom 3: For mutually exclusive events A₁, A₂, …, P(A₁ ∪ A₂ ∪ …) = Σ P(Aᵢ).
• 公理3：对于互斥事件A₁、A₂、…，有P(A₁ ∪ A₂ ∪ …) = Σ P(Aᵢ)。

From these axioms we derive the addition rule:

由这些公理我们推导出加法规则：

P(A ∪ B) = P(A) + P(B) − P(A ∩ B)

For mutually exclusive events, P(A ∩ B) = 0, so P(A ∪ B) = P(A) + P(B). Also, the complement rule states P(Aᶜ) = 1 − P(A).

对于互斥事件，P(A ∩ B) = 0，因此P(A ∪ B) = P(A) + P(B)。此外，补事件规则表明P(Aᶜ) = 1 − P(A)。

---

3. Conditional Probability and Independence | 条件概率与独立性

Conditional probability measures the probability of an event A given that another event B has already occurred:

条件概率衡量在事件B已经发生的条件下事件A发生的概率：

P(A|B) = P(A ∩ B) / P(B), provided P(B) > 0

Rearranging gives the multiplication rule:

重新整理得到乘法规则：

P(A ∩ B) = P(A|B) × P(B)

Two events A and B are independent if P(A|B) = P(A), equivalently:

如果P(A|B) = P(A)，则事件A与B独立，等价于：

P(A ∩ B) = P(A) × P(B)

Independence means the occurrence of B does not change the probability of A.

独立性意味着B的发生不会改变A的概率。

---

4. Bayes’ Theorem | 贝叶斯定理

Bayes’ theorem links a conditional probability to its inverse. Suppose events B₁, B₂, …, Bₙ form a partition of Ω, and A is any event. Then the law of total probability states:

贝叶斯定理将条件概率与其逆概率联系起来。假设事件B₁、B₂、…、Bₙ构成Ω的一个划分，且A是任意事件。那么全概率公式表明：

P(A) = Σ P(A|Bᵢ) P(Bᵢ)

Bayes’ theorem gives the posterior probability of Bᵢ given A:

贝叶斯定理给出在A发生条件下Bᵢ的后验概率：

P(Bᵢ|A) = [P(A|Bᵢ) P(Bᵢ)] / Σ P(A|Bⱼ) P(Bⱼ)

Example: A test for a disease is 99% accurate. If 1% of the population has the disease, Bayes’ theorem shows the probability that a person with a positive test actually has the disease is about 50%—surprisingly low, illustrating the importance of base rates.

例如：某项疾病检测的准确率为99%。如果人群中患病率为1%，贝叶斯定理显示检测呈阳性者实际患病的概率约为50%——出乎意料地低，这说明了基础概率的重要性。

---

5. Discrete Random Variables | 离散随机变量

A discrete random variable X takes values in a countable set with a probability mass function (PMF), p(x) = P(X = x).

离散随机变量X在一个可数集合上取值，其概率质量函数（PMF）为p(x) = P(X = x)。

The conditions for a valid PMF are p(x) ≥ 0 and Σₓ p(x) = 1.

有效PMF的条件是p(x) ≥ 0且Σₓ p(x) = 1。

Example: Let X be the sum when two fair dice are rolled. The PMF can be displayed as:

例如：设X为掷两枚公平骰子的点数之和。其PMF可表示为：

x	2	3	4	5	6	7	8	9	10	11	12
P(X=x)	1/36	2/36	3/36	4/36	5/36	6/36	5/36	4/36	3/36	2/36	1/36

The cumulative distribution function is F(x) = P(X ≤ x), and it increases stepwise for discrete variables.

累积分布函数为F(x) = P(X ≤ x)，对于离散变量它是阶梯式递增的。

---

6. Expected Value and Variance | 期望与方差

The expected value (mean) of a discrete random variable is a weighted average of its possible values:

离散随机变量的期望（均值）是其可能取值的加权平均值：

E(X) = Σₓ x p(x)

The variance measures the spread of the distribution:

方差衡量分布的离散程度：

Var(X) = E(X²) − [E(X)]²

where E(X²) = Σₓ x² p(x). The standard deviation is the square root of the variance.

其中E(X²) = Σₓ x² p(x)。标准差是方差的正平方根。

Properties: For constants a and b, E(aX + b) = aE(X) + b and Var(aX + b) = a² Var(X).

性质：对于常数a和b，有E(aX + b) = aE(X) + b，且Var(aX + b) = a² Var(X)。

---

7. Binomial Distribution | 二项分布

The binomial model applies when there are n independent trials, each with two outcomes (success/failure) and constant success probability p. Let X be the number of successes.

二项模型适用于n次独立试验，每次试验只有两种结果（成功/失败），且成功概率p恒定。设X为成功次数。

The probability of exactly r successes is:

恰好r次成功的概率为：

P(X = r) = C(n, r) pʳ (1−p)ⁿ⁻ʳ

for r = 0, 1, …, n, where C(n, r) = n! / [r!(n−r)!].

其中r = 0, 1, …, n，且C(n, r) = n! / [r!(n−r)!]。

Its mean and variance are:

其均值和方差为：

E(X) = np, Var(X) = np(1−p)

Example: If 10 independent shots each have a 70% chance of hitting a target, the probability of exactly 8 hits is C(10,8)(0.7)⁸(0.3)² ≈ 0.233.

例如：如果10次独立射击每次命中目标的概率为70%，那么恰好命中8次的概率为C(10,8)(0.7)⁸(0.3)² ≈ 0.233。

---

8. Poisson Distribution | 泊松分布

The Poisson distribution models the number of rare events occurring in a fixed interval of time or space. It has a single parameter λ, the average rate of occurrence.

泊松分布用于模拟在固定时间或空间间隔内稀有事件发生的次数。它有一个参数λ，即平均发生率。

The PMF is:

其PMF为：

P(X = r) = e^(−λ) λʳ / r!

for r = 0, 1, 2, …, with λ > 0.

其中r = 0, 1, 2, …，λ > 0。

A remarkable property is that the mean and variance are both equal to λ:

一个显著性质是均值与方差都等于λ：

E(X) = λ, Var(X) = λ

Poisson models are used for arrival times, telephone calls, defects in materials, and radioactive decays.

泊松模型用于到达时间、电话呼叫、材料缺陷和放射性衰变等。

---

9. Geometric Distribution | 几何分布

The geometric distribution models the number of trials needed to obtain the first success in repeated independent trials with success probability p.

几何分布模拟在成功概率为p的重复独立试验中，获得首次成功所需的试验次数。

If X is the number of trials until the first success, then:

设X为直到首次成功所需的试验次数，则：

P(X = r) = (1−p)ʳ⁻¹ p

for r = 1, 2, 3, …

其中r = 1, 2, 3, …

The mean and variance are:

其均值和方差为：

E(X) = 1/p, Var(X) = (1−p)/p²

Example: If the probability of rolling a 6 is 1/6, the expected number of rolls to get the first 6 is 6.

例如：如果掷出6的概率是1/6，那么首次掷出6的期望试验次数为6。

---

10. Applications of Probability Models | 概率模型的应用

Probability models are used in risk assessment, insurance pricing, quality control, and decision theory. For example, an

Published by TutorHao | Mathematics Revision Series | aleveler.com

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

📚 Mastering Optimisation Problems | 优化问题的求解方法

Optimisation is one of the most powerful applications of differentiation in A-Level Mathematics. It asks a simple question: among all possible choices, which one gives the largest or smallest value? Whether you are maximising profit, minimising material cost, or finding the fastest route, the underlying calculus is the same.

优化问题是A-Level数学中微分学最强大的应用之一。它提出一个简单的问题：在所有可能的选择中，哪一个能产生最大值或最小值？无论是最大化利润、最小化材料成本，还是寻找最快路线，其背后的微积分原理都是相同的。

---

1. What Is Optimisation? | 什么是优化问题

An optimisation problem involves finding the maximum or minimum value of a function, usually subject to a constraint. The function being optimised is called the objective function, and the constraint links the variables together. For example, you may need to maximise the volume of a box made from a fixed sheet of cardboard, or minimise the cost of fencing a rectangular field of given area.

优化问题涉及寻找函数的最大值或最小值，通常受某个约束条件的限制。被优化的函数称为目标函数，而约束条件将各个变量联系在一起。例如，你可能需要用一张固定大小的纸板制作一个盒子并最大化其体积，或者用给定面积的矩形围栏最小化围栏成本。

In mathematical terms, if the objective function is (y = f(x)), we seek values of (x) where (f'(x) = 0) or where the derivative does not exist, provided these lie within the feasible domain. These points are called critical points or stationary points.

用数学语言表达，如果目标函数为 (y = f(x))，我们寻找使 (f'(x) = 0) 或导数不存在的 (x) 值，前提是这些值位于可行定义域内。这些点称为临界点或驻点。

---

2. Setting Up the Problem | 建立问题模型

The hardest part of optimisation is often translating a word problem into mathematics. A structured approach begins with three steps: draw a diagram, define variables clearly, and identify the quantity to be maximised or minimised.

优化问题中最困难的部分往往是将文字题转化为数学表达式。结构化的方法从三个步骤开始：画示意图、明确定义变量、识别需要最大化或最小化的量。

Suppose you are asked to find the maximum area of a rectangle with a fixed perimeter of 40 m. Let the length be (x) and the width be (y). The constraint is (2x + 2y = 40), so (y = 20 – x). The objective function (area) is (A = xy = x(20 – x) = 20x – x²).

假设要求找到周长为40米的矩形的最大面积。设长为 (x)，宽为 (y)。约束条件为 (2x + 2y = 40)，因此 (y = 20 – x)。目标函数（面积）为 (A = xy = x(20 – x) = 20x – x²)。

Once the objective is expressed as a single-variable function, the domain must be stated. Here, (0 < x < 20), since lengths must be positive. This domain will be important when checking endpoints.

一旦目标被表示为单变量函数，就必须明确定义域。此处 (0 < x < 20)，因为长度必须为正。这个定义域在检查端点时非常重要。

---

3. Finding Critical Points | 寻找临界点

To locate potential maxima and minima, we differentiate the objective function with respect to (x) and set the derivative equal to zero. These solutions are the stationary points.

为了找到可能的最大值和最小值，我们对目标函数关于 (x) 求导，并令导数等于零。这些解就是驻点。

For (A = 20x – x²), we have (frac{dA}{dx} = 20 – 2x). Setting (20 – 2x = 0) gives (x = 10). This is the only critical point in the interval.

对于 (A = 20x – x²)，我们有 (frac{dA}{dx} = 20 – 2x)。令 (20 – 2x = 0) 得 (x = 10)。这是区间内唯一的临界点。

It is essential to check whether the derivative exists everywhere in the domain. For polynomial and most rational functions encountered in A-Level, this is true. However, for functions involving absolute values or roots, extra care is needed.

必须检查导数在定义域内是否处处存在。对于A-Level中遇到的多项式和大多数有理函数，这通常是成立的。然而，对于涉及绝对值或根号的函数，需要格外小心。

---

4. Determining the Nature of Critical Points | 判断临界点的性质

Once a critical point is found, we must decide whether it corresponds to a maximum, a minimum, or a point of inflection. The first derivative test and the second derivative test are the two standard methods.

找到临界点后，我们必须判断它对应最大值、最小值还是拐点。一阶导数检验法和二阶导数检验法是两种标准方法。

First derivative test: Examine the sign of (f'(x)) just to the left and right of the critical point. If the sign changes from positive to negative, it is a local maximum; from negative to positive, it is a local minimum; if there is no sign change, it is a point of inflection.

一阶导数检验法：观察临界点左右两侧 (f'(x)) 的符号。如果符号从正变为负，则为局部最大值；从负变为正，则为局部最小值；如果没有符号变化，则为拐点。

Second derivative test: Compute (f”(x)) at the critical point (x = c). If (f”(c) < 0), the function is concave down, indicating a local maximum. If (f''(c) > 0), the function is concave up, indicating a local minimum. If (f”(c) = 0), the test is inconclusive.

二阶导数检验法：计算临界点 (x = c) 处的 (f”(x))。如果 (f”(c) < 0)，函数为凹向下，表明是局部最大值。如果 (f''(c) > 0)，函数为凹向上，表明是局部最小值。如果 (f”(c) = 0)，则检验法无效。

For the area example, (frac{d²A}{dx²} = -2 < 0), so (x = 10) gives a maximum. The maximum area is (A = 10(20 - 10) = 100) m².

对于面积示例，(frac{d²A}{dx²} = -2 < 0)，因此 (x = 10) 给出最大值。最大面积为 (A = 10(20 - 10) = 100) 平方米。

---

5. Global Extrema on a Closed Interval | 闭区间上的全局最值

When the domain is a closed interval ([a, b]), the global maximum or minimum may occur at a critical point inside the interval or at one of the endpoints. The Extreme Value Theorem guarantees that a continuous function on a closed interval attains both a maximum and a minimum.

当定义域为闭区间 ([a, b]) 时，全局最大值或最小值可能出现在区间内部的临界点，也可能出现在端点处。极值定理保证闭区间上的连续函数一定能取得最大值和最小值。

The procedure is straightforward: list all critical points in ((a, b)), evaluate the function at these points and at (x = a) and (x = b), and compare the values. The largest is the global maximum; the smallest is the global minimum.

求解步骤很直接：列出 ((a, b)) 内所有临界点，计算这些点以及 (x = a) 和 (x = b) 处的函数值，然后进行比较。最大值为全局最大值，最小值为全局最小值。

For example, consider (f(x) = x³ – 3x + 2) on ([0, 2]). The derivative (f'(x) = 3x² – 3 = 3(x – 1)(x + 1)) gives a critical point at (x = 1) (since (x = -1) is outside the interval). Evaluating: (f(0) = 2), (f(1) = 0), (f(2) = 4). Therefore, the global maximum is 4 at (x = 2), and the global minimum is 0 at (x = 1).

例如，考虑 ([0, 2]) 上的函数 (f(x) = x³ – 3x + 2)。导数 (f'(x) = 3x² – 3 = 3(x – 1)(x + 1)) 给出临界点 (x = 1)（因为 (x = -1) 在区间外）。计算函数值：(f(0) = 2)，(f(1) = 0)，(f(2) = 4)。因此，全局最大值为 4（在 (x = 2) 处），全局最小值为 0（在 (x = 1) 处）。

---

6. Optimisation with Geometric Constraints | 带几何约束的优化问题

Many optimisation problems involve geometric shapes—cylinders, cones, spheres, or boxes—where the constraint is a fixed surface area or volume. The key is to use the constraint to eliminate one variable.

许多优化问题涉及几何形状——圆柱体、圆锥体、球体或盒子——此时约束条件是固定的表面积或体积。关键在于使用约束条件消去一个变量。

Worked example: A cylindrical tin has a fixed surface area of (S = 600pi) cm². Find the radius and height that maximise the volume (V = pi r² h).

例题：一个圆柱形罐头具有固定的表面积 (S = 600pi) cm²。求使体积 (V = pi r² h) 最大的半径和高度。

The surface area is the sum of the two circular ends and the curved surface: (S = 2pi r² + 2pi r h = 600pi). Dividing by (2pi): (r² + rh = 300), so (h = frac{300 – r²}{r}).

表面积等于两个圆形底面与侧面的面积之和：(S = 2pi r² + 2pi r h = 600pi)。两边除以 (2pi)：(r² + rh = 300)，因此 (h = frac{300 – r²}{r})。

Substitute into the volume formula:

将 (h) 代入体积公式：

(V(r) = pi r² cdot frac{300 – r²}{r} = pi(300r – r³))

Differentiate: (frac{dV}{dr} = pi(300 – 3r²) = 3pi(100 – r²)). Setting this equal to zero gives (r = 10) cm (since (r > 0)). Then (h = frac{300 – 100}{10} = 20) cm.

求导：(frac{dV}{dr} = pi(300 – 3r²) = 3pi(100 – r²))。令其等于零得 (r = 10) cm（因为 (r > 0)）。则 (h = frac{300 – 100}{10} = 20) cm。

To confirm this is a maximum, compute the second derivative: (frac{d²V}{dr²} = -6pi r). At (r = 10), this is (-60pi < 0), confirming a maximum. The maximum volume is (V = pi(300 times 10 - 1000) = 2000pi) cm³.

为了确认这是最大值，计算二阶导数：(frac{d²V}{dr²} = -6pi r)。在 (r = 10) 处，其值为 (-60pi < 0)，确认是最大值。最大体积为 (V = pi(300 times 10 - 1000) = 2000pi) cm³。

---

7. Optimisation in Economics: Cost and Profit | 经济学中的优化：成本与利润

In economics, firms aim to minimise average cost or maximise profit. These problems follow the same calculus rules, but the functions often arise from given revenue and cost models.

在经济学中，企业追求平均成本最小化或利润最大化。这些问题遵循相同的微积分规则，但函数通常来自给定的收益和成本模型。

A typical model: total revenue is (R(x) = p(x) cdot x), where (p(x)) is the price per unit and (x) is the number of units sold. Total cost (C(x)) includes fixed and variable costs. Profit is defined as (P(x) = R(x) – C(x)).

典型模型：总收入为 (R(x) = p(x) cdot x)，其中 (p(x)) 是每单位价格，(x) 是销售数量。总成本 (C(x)) 包括固定成本和可变成本。利润定义为 (P(x) = R(x) – C(x))。

To maximise profit, set (P'(x) = 0), which is equivalent to (R'(x) = C'(x)). This is the famous condition “marginal revenue equals marginal cost.” The second derivative (P”(x) < 0) ensures we have a maximum.

要使利润最大化，令 (P'(x) = 0)，这等价于 (R'(x) = C'(x))。这就是著名的条件“边际收益等于边际成本”。二阶导数 (P”(x) < 0) 确保我们得到的是最大值。

Worked example: A company finds that the profit from producing (x) units is (P(x) = -2x² + 80x – 500). Find the production level that maximises profit.

例题：一家公司发现生产 (x) 件产品时的利润为 (P(x) = -2x² + 80x – 500)。求使利润最大的生产水平。

Differentiate: (P'(x) = -4x + 80). Setting to zero gives (x = 20). Since (P”(x) = -4 < 0), this is a maximum. The maximum profit is (P(20) = -2(400) + 80(20) - 500 = 300) units of currency.

求导：(P'(x) = -4x + 80)。令其等于零得 (x = 20)。由于 (P”(x) = -4 < 0)，这是最大值。最大利润为 (P(20) = -2(400) + 80(20) - 500 = 300) 货币单位。

---

8. Optimisation Involving Rates of Change | 涉及变化率的优化问题

Some optimisation problems require the use of related rates, especially when multiple quantities change over time. The key is to write the objective function in terms of a single variable before differentiating.

有些优化问题需要使用相关变化率，尤其是当多个量随时间变化时。关键在于先将要优化的函数写成单变量的形式，然后再求导。

A classic example involves a ladder sliding down a wall. If the bottom slides away at a constant rate, find the angle at which the area of the triangle formed by the ladder, wall, and ground is maximised.

经典例子是梯子沿墙滑落。如果梯子底部以恒定速率滑离墙壁，求梯子、墙壁和地面构成的三角形面积最大时的角度。

However, in exam questions, the time variable is usually eliminated before differentiation. For instance, if the ladder has length (L), let the bottom be (x) from the wall and the top be (y) above the ground. The constraint is (x² + y² = L²), and the area is (A = frac{1}{2}xy). Using the constraint to express (y = sqrt{L² – x²}), the area becomes (A = frac{1}{2}xsqrt{L² – x²}).

然而，在考试题中，通常会在求导之前消去时间变量。例如，如果梯子长度为 (L)，设底部距墙壁为 (x)，顶部距地面为 (y)。约束条件为 (x² + y² = L²)，面积为 (A = frac{1}{2}xy)。利用约束条件将 (y = sqrt{L² – x²}) 代入，面积变为 (A = frac{1}{2}xsqrt{L² – x²})。

Rather than solving this directly, note that maximising (A) is equivalent to maximising (A² = frac{1}{4}x²(L² – x²)), which is easier to differentiate. This “square trick” is very useful for functions involving square roots.

不过，与其直接求解，不如注意到最大化 (A) 等价于最大化 (A² = frac{1}{4}x²(L² – x²))，这样求导更容易。这种“平方技巧”对于涉及平方根的函数非常有用。

---

9. Common Mistakes and Pitfalls | 常见错误与易错点

Optimisation problems are notorious for small errors that lead to incorrect answers. Being aware of these common pitfalls can save valuable marks in the exam.

优化问题因小错误导致错误答案而闻名。了解这些常见陷阱可以在考试中保住宝贵的分数。

• Forgetting the domain: Always state the feasible range of the variable. A critical point outside the domain is invalid, and endpoints may be the true extrema.

  忘记定义域：始终明确变量的可行范围。定义域外的临界点是无效的，而端点可能是真正的最值。

• Using the second derivative test when it fails: If (f”(c) = 0), the test is inconclusive. Use the first derivative test or examine the sign of (f’) around the point.

  在二阶导数检验失效时仍使用它：如果 (f”(c) = 0)，检验法无效。应使用一阶导数检验法或观察 (f’) 在该点附近的符号。

• Confusing local and global extrema: On a closed interval, always check endpoints. A local maximum is not necessarily the global maximum.

  混淆局部最值和全局最值：在闭区间上，始终检查端点。局部最大值不一定是全局最大值。

• Not simplifying before differentiating: Products and quotients can be simplified first to make differentiation easier and reduce errors.

  求导前不化简：乘积和商可以先化简再进行求导，这样更容易且可以减少错误。

• Neglecting units: In applied problems, always include units in the final answer, such as cm², m, or monetary units.

  忽略单位：在应用题中，最终答案务必包含单位，如 cm²、m 或货币单位。

---

10. Step-by-Step Solution Strategy | 分步解题策略

When facing any optimisation problem, following a consistent strategy reduces errors and saves time. Use this checklist as a guide during the exam.

面对任何优化问题时，遵循一致的策略可以减少错误并节省时间。考试时可以将此检查清单作为指导。

Step / 步骤	Action / 行动
1	Read the problem and identify the quantity to be maximised or minimised. 阅读题目，确定要最大化或最小化的量。
2	Draw a diagram if possible; label variables clearly. 如果可能，画出示意图；清楚标注变量。
3	Write the constraint equation and use it to express the objective in terms of one variable. 写出约束方程，并用它把目标函数表示为单变量形式。
4	State the domain of the variable. 指明变量的定义域。
5	Differentiate the objective function; find critical points by setting (f'(x) = 0). 对目标函数求导；通过令 (f'(x) = 0) 寻找临界点。
6	Use the first or second derivative test to confirm whether each critical point is a max or min. 使用一阶或二阶导数检验法确认每个临界点是最大还是最小。
7	If the domain is closed, compare function values at critical points and endpoints. 如果定义域是闭区间，比较临界点和端点处的函数值。
8	Write the final answer in a sentence, including units and justifying that it is indeed the optimum. 用完整句子写出最终答案，包括单位，并说明它确实是最优值。

---

11. Worked Exam-Style Problem | 考试风格例题精讲

Let us apply the full strategy to a classic exam-style question: an open-top box is made by cutting equal squares of side (x) from each corner of a 30 cm by 20 cm rectangular sheet, then folding up the sides. Find the maximum volume.

让我们将完整策略应用于一道经典考试风格题目：从一块 30 cm × 20 cm 的矩形纸板的四个角各剪去边长为 (x) 的正方形，然后折起四周，制成一个无盖盒子。求最大体积。

Step 1 – Objective: The volume is (V = text{length} times text{width} times text{height}). After cutting and folding, the dimensions are ((30 – 2x)), ((20 – 2x)), and (x). Thus:

步骤1——目标：体积为 (V = text{长} times text{宽} times text{高})。剪去并折叠后，尺寸为 ((30 – 2x))、((20 – 2x)) 和 (x)。因此：

(V(x) = x(30 – 2x)(20 – 2x) = 4x³ – 100x² + 600x)

Step 2 – Domain: The cut-out length must satisfy (0 < x < 10), because the smaller dimension is 20 cm, so (20 - 2x > 0).

步骤2——定义域：剪去的边长必须满足 (0 < x < 10)，因为较短边为 20 cm，所以 (20 - 2x > 0)。

Step 3 – Differentiate: (frac{dV}{dx} = 12x² – 200x + 600). Set equal to zero: (12x² – 200x + 600 = 0), which simplifies to (3x² – 50x + 150 = 0).

步骤3——求导：(frac{dV}{dx} = 12x² – 200x + 600)。令其等于零：(12x² – 200x + 600 = 0)，化简得 (3x² – 50x + 150 = 0)。

Solve using the quadratic formula:

使用二次公式求解：

(x = frac{50 pm sqrt{2500 – 1800}}{6} = frac{50 pm sqrt{700}}{6} = frac{50 pm 10sqrt{7}}{6})

This gives (x approx 12.74) or (x approx 3.93). Only (x approx 3.93) lies in the domain (0 < x < 10).

得到 (x approx 12.74) 或 (x approx 3.93)。只有 (x approx 3.93) 在定义域 (0 < x < 10) 内。

Step 4 – Confirm maximum: (frac{d²V}{dx²} = 24x – 200). At (x approx 3.93), (frac{d²V}{dx²} approx 94.3 – 200 = -105.7 < 0), confirming a maximum.

步骤4——确认最大值：(frac{d²V}{dx²} = 24x – 200)。在 (x approx 3.93) 处，(frac{d²V}{dx²} approx 94.3 – 200 = -105.7 < 0)，确认为最大值。

Step 5 – Final answer: (V_{text{max}} approx 3.93(30 – 7.86)(20 – 7.86) approx 3.93 times 22.14 times 12.14 approx 1056) cm³.

步骤5——最终答案：(V_{text{max}} approx 3.93(30 – 7.86)(20 – 7.86) approx 3.93 times 22.14 times 12.14 approx 1056) cm³。

---

12. Summary of Key Results | 核心结论总结

The table below summarises the essential techniques and their purposes:

下表总结了关键技术及其用途：

Technique / 技巧	Purpose / 用途
(f'(x) = 0)	Find critical points / 寻找临界点
Sign test of (f'(x))	Classify maxima, minima, inflection / 分类最大值、最小值、拐点
(f”(x) > 0) or (< 0)	Confirm minimum or maximum / 确认最小值或最大值
Endpoint evaluation	Find global extrema on closed intervals / 在闭区间上寻找全局最值
Substitute constraint	Reduce to one variable / 化为一元函数
Squaring trick	Simplify square-root objectives / 化简含平方根的目标函数

Mastering optimisation requires practice. With a systematic approach—setting up the model, finding critical points, confirming their nature, and checking endpoints—you can confidently solve any optimisation problem in the A-Level syllabus.

掌握优化问题需要练习。通过系统化的方法——建立模型、寻找临界点、确认其性质并检查端点——你可以自信地解决A-Level考纲中的任何优化问题。

---

Published by TutorHao | Mathematics Revision Series | aleveler.com

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

📚 Mendelian Genetics & Laws of Inheritance | 遗传规律与孟德尔定律

Mendel’s experiments with garden peas laid the foundation of classical genetics. Understanding the laws of segregation and independent assortment is essential for solving inheritance problems in A Level biology.

孟德尔以豌豆为材料进行的实验奠定了经典遗传学的基础。掌握分离定律与自由组合定律，是解决 A Level 生物考试中遗传题目的关键。

---

1. The Historical Context and Mendel’s Experimental Design | 历史背景与孟德尔的实验设计

Gregor Mendel (1822–1884) worked with Pisum sativum, the garden pea, selecting seven contrasting traits that exhibited clear alternative forms such as tall versus dwarf stems and round versus wrinkled seeds.

孟德尔（1822–1884）以豌豆（Pisum sativum）为材料，选取了七对具有鲜明相对性状的特征，例如高茎对矮茎、圆粒对皱粒等。

The pea plant was ideal because it was self-fertilising, cheap to cultivate, and had a short generation time, and Mendel could strictly control crosses by emasculation and artificial pollination.

豌豆是理想的实验材料，因为它自花传粉、便于种植、世代周期短，孟德尔可以通过去雄和人工授粉严格控制杂交组合。

By counting large numbers of offspring and applying mathematics, Mendel was able to detect discrete ratios rather than blending inheritance.

通过对大量后代进行计数并运用数学分析，孟德尔观察到的不是融合遗传，而是彼此离散的比例。

---

2. Key Terminology: Genes, Alleles and Phenotype | 关键术语：基因、等位基因与表型

Alleles are alternative versions of the same gene that occupy the same locus on homologous chromosomes.

等位基因是位于同源染色体相同位点上的同一基因的不同版本。

An organism’s genotype describes its allelic constitution, while phenotype is the observable expression of the genotype interacting with the environment.

基因型描述生物的等位基因组成，而表型是基因型与环境共同作用后表现出的可观察特征。

English Term 英文术语	中文翻译	Definition 定义
Gene	基因	A DNA segment coding for a specific polypeptide or functional RNA.
Allele	等位基因	An alternative version of a gene at the same locus.
Dominant	显性	An allele that is expressed in the heterozygote; shown by a capital letter.
Recessive	隐性	An allele whose effect is masked in the heterozygote; shown by a lower-case letter.
Homozygous	纯合	Carrying two identical alleles of a gene.
Heterozygous	杂合	Carrying two different alleles of a gene.
Phenotype	表型	The observable physical or biochemical expression of a trait.
Genotype	基因型	The allelic constitution of an organism at one or more loci.

---

3. The Law of Segregation | 分离定律

The law of segregation states that for any given characteristic, the two alleles carried by a diploid parent separate equally into gametes, so each gamete receives only one allele.

分离定律指出：对于任何给定性状，二倍体亲本携带的两个等位基因在形成配子时彼此分离、均等分配，因此每个配子只携带一个等位基因。

That separation is based on the behaviour of homologous chromosomes during meiosis I, when homologous pairs segregate to opposite poles.

这种分离基于减数第一次分裂过程中同源染色体分别移向细胞两极的行为。

In a monohybrid cross between two heterozygous plants (Rr × Rr), Mendel predicted a 3:1 phenotypic ratio in the F₂ generation.

在杂合植株（Rr × Rr）之间的单因子杂交中，孟德尔预测 F₂ 代会呈现 3:1 的表型分离比。

Rr × Rr → 配子各为 ½ R 与 ½ r → F₂ 基因型比 1 : 2 : 1，表型比 3 : 1

---

4. Monohybrid Cross Diagrams | 单因子杂交遗传图解

The Punnett square shows all possible gamete fusions for a single gene. For a cross of Rr × Rr, the square has four cells.

庞纳特方格展示单个基因所有可能的配子结合方式。对于 Rr × Rr 杂交，方格共有四格。

配子	R	r
R	RR 圆粒	Rr 圆粒
r	Rr 圆粒	rr 皱粒

The genotypic ratio among F₂ offspring is 1 RR : 2 Rr : 1 rr, whereas the phenotypic ratio is 3 round : 1 wrinkled.

F₂ 群体的基因型比例为 1 RR : 2 Rr : 1 rr，而表型比例为 3 圆粒 : 1 皱粒。

Importantly, the 3:1 ratio only appears when large numbers of offspring are counted and when both sexes contribute equally.

值得注意的是，3:1 的表型比只有在后代数量足够大、且双亲贡献均等时才能稳定显现。

---

5. Test Crosses | 测交

Because dominant phenotypes may be homozygous (RR) or heterozygous (Rr), a test cross with a homozygous recessive parent distinguishes the two genotypes.

由于显性表型可能来自纯合体（RR）或杂合体（Rr），因此需要与隐性纯合体测交来区分这两种基因型。

If the unknown plant is RR, all offspring show the dominant phenotype. If it is Rr, the offspring will show a 1:1 ratio of dominant to recessive phenotypes.

若未知植株为 RR，则全部后代均为显性表型；若为 Rr，则后代表现为显性:隐性接近 1:1。

Rr × rr → ½ Rr（显性） : ½ rr（隐性），即 1 : 1

---

6. The Law of Independent Assortment | 自由组合定律

The law of independent assortment holds that alleles of genes on different chromosomes segregate independently during gamete formation.

自由组合定律指出，位于不同染色体上的等位基因在配子形成过程中彼此独立分离。

This applies only to unlinked genes; genes on the same chromosome tend to be inherited together and may require linkage analysis.

该定律仅适用于不连锁的基因；同一染色体上的基因往往倾向于一同遗传，需要通过连锁分析来研究。

The gametes produced by a double heterozygote AaBb are therefore AB, Ab, aB and ab in equal frequencies, provided the two loci are on different chromosomes.

因此，双杂合体 AaBb 产生的配子为 AB、Ab、aB、ab，频率相等——前提是这两个基因座位于不同染色体上。

---

7. Dihybrid Crosses and the 9:3:3:1 Ratio | 双因子杂交与 9:3:3:1 比例

In a dihybrid cross such as RrYy × RrYy, where R = round, r = wrinkled, Y = yellow and y = green, the two traits assort independently.

在双因子杂交 RrYy × RrYy 中，R 代表圆粒、r 代表皱粒，Y 代表黄色、y 代表绿色，两对性状独立分配。

Each parent produces four gamete types in equal proportions: RY, Ry, rY, ry.

每个亲本产生四种数量相等的配子类型：RY、Ry、rY、ry。

配子	RY	Ry	rY	ry
RY	RRYY 圆黄	RRYy 圆黄	RrYY 圆黄	RrYy 圆黄
Ry	RRYy 圆黄	RRyy 圆绿	RrYy 圆黄	Rryy 圆绿
rY	RrYY 圆黄	RrYy 圆黄	rrYY 皱黄	rrYy 皱黄
ry	RrYy 圆黄	Rryy 圆绿	rrYy 皱黄	rryy 皱绿

The F₂ phenotype ratio is 9 round-yellow : 3 round-green : 3 wrinkled-yellow : 1 wrinkled-green.

F₂ 的表型比为 9 圆黄 : 3 圆绿 : 3 皱黄 : 1 皱绿。

---

8. Modifications to Mendelian Ratios: Incomplete Dominance and Codominance | 孟德尔比例的扩展：不完全显性与共显性

Not all genes display complete dominance. In incomplete dominance, the heterozygote has an intermediate phenotype, giving a 1:2:1 F₂ ratio.

并非所有基因都表现完全显性。在不完全显性中，杂合子呈现中间表型，F₂ 表现为 1:2:1。

In codominance, both alleles are fully expressed in the heterozygote, as in the ABO blood group system where A and B alleles both appear.

在共显性中，两个等位基因在杂合子中都会完全表达，例如 ABO 血型系统中 A 和 B 等位基因同时表现。

Codominance does not change the genotype ratio, but it changes the phenotype count because the heterozygote is a distinct class.

共显性并不改变基因型比例，但因杂合子成为独立可区分的类别，因此表型数目相应改变。

例：红色花 RR × 白色花 rr → F₁ 全部为粉色花 Rr（不完全显性）

---

9. Gene Interaction and Epistasis | 基因互作与上位效应

Epistasis occurs when one gene masks the effect of another non-allelic gene. Such interactions modify the classic 9:3:3:1 ratio.

上位效应指一个基因掩盖另一个非等位基因的表型效应。这类

Published by TutorHao | Biology Revision Series | aleveler.com

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

📚 Bayes’ Theorem and Its Applications | 贝叶斯公式及其应用

Bayes’ Theorem is one of the most powerful and counter-intuitive results in probability. It allows us to update our beliefs about a hypothesis when new evidence arrives, and it forms the mathematical backbone of fields as diverse as medical diagnosis, spam filtering, machine learning, and even legal reasoning.

贝叶斯公式是概率论中最强大且最反直觉的结果之一。它允许我们在新证据出现时更新对某个假设的信念，并且构成了医学诊断、垃圾邮件过滤、机器学习乃至法律推理等领域的关键数学基础。

---

1. Conditional Probability: A Quick Review | 条件概率：快速回顾

Before we dive into Bayes’ Theorem, we must recall the definition of conditional probability. The probability that event A occurs given that event B has already occurred is written P(A|B), and is defined by the formula:

在深入贝叶斯公式之前，我们必须回顾条件概率的定义。在事件 B 已经发生的前提下，事件 A 发生的概率记为 P(A|B)，其定义公式为：

P(A|B) = P(A ∩ B) / P(B), provided P(B) > 0

This formula tells us that the conditional probability is the fraction of B that also belongs to A. It is not the same as P(B|A), a distinction that lies at the heart of Bayes’ Theorem.

这个公式告诉我们，条件概率是 B 中同时也属于 A 的那部分所占的比例。它并不等于 P(B|A)，而正是这一区别构成了贝叶斯公式的核心。

For example, suppose a bag contains 3 red marbles and 2 blue marbles. If one marble is drawn at random, the probability it is red is 3/5. But if we are told that the drawn marble is not blue, then the probability it is red becomes 1. The information changes the probability.

例如，假设一个袋子里有 3 个红球和 2 个蓝球。如果随机抽取一个球，它是红球的概率是 3/5。但如果我们被告知抽出的球不是蓝色的，那么它是红球的概率就变成了 1。信息改变了概率。

---

2. The Law of Total Probability | 全概率公式

Bayes’ Theorem relies on the Law of Total Probability. If events B₁, B₂, …, Bₙ form a partition of the sample space (they are mutually exclusive and exhaustive), then for any event A:

贝叶斯公式依赖于全概率公式。如果事件 B₁, B₂, …, Bₙ 构成样本空间的一个划分（即它们互斥且完备），那么对于任意事件 A：

P(A) = P(A|B₁)P(B₁) + P(A|B₂)P(B₂) + … + P(A|Bₙ)P(Bₙ)

Intuitively, we split the sample space into disjoint pieces, calculate the probability of A within each piece, and then add these weighted contributions together.

直观上，我们将样本空间分割成互不相交的部分，计算 A 在每个部分中的概率，然后将这些加权贡献相加。

In the simplest case with two complementary events B and Bᶜ, the law becomes P(A) = P(A|B)P(B) + P(A|Bᶜ)P(Bᶜ). This form is used constantly in Bayes’ Theorem problems.

在只有两个互补事件 B 和 Bᶜ 的最简单情形下，全概率公式变为 P(A) = P(A|B)P(B) + P(A|Bᶜ)P(Bᶜ)。在贝叶斯公式问题中这种形式经常被使用。

---

3. Statement of Bayes’ Theorem | 贝叶斯公式的表述

Bayes’ Theorem connects P(B|A) to P(A|B). For two events A and B, the theorem states:

贝叶斯公式将 P(B|A) 与 P(A|B) 联系起来。对于两个事件 A 和 B，公式表述为：

P(B|A) = [P(A|B) × P(B)] / P(A)

Using the Law of Total Probability to expand the denominator, we get the more complete version:

使用全概率公式展开分母，我们得到更完整的版本：

P(B|A) = [P(A|B) × P(B)] / [P(A|B)P(B) + P(A|Bᶜ)P(Bᶜ)]

Here, P(B) is called the prior probability (our belief before seeing the evidence), P(B|A) is the posterior probability (our updated belief after seeing evidence A), and P(A|B) is the likelihood.

其中，P(B) 称为先验概率（我们在看到证据之前的信念），P(B|A) 是后验概率（看到证据 A 之后更新的信念），而 P(A|B) 是似然度。

---

4. A Simple Derivation | 简单推导

The derivation is short. Start with the definition of conditional probability applied twice:

推导过程很短。我们从条件概率的定义出发，分别对两个方向应用：

P(A ∩ B) = P(A|B) × P(B) = P(B|A) × P(A)

Equating the two expressions for P(A ∩ B) gives P(B|A) × P(A) = P(A|B) × P(B). Dividing both sides by P(A) yields Bayes’ Theorem immediately.

将 P(A ∩ B) 的两种表达式相等，得到 P(B|A) × P(A) = P(A|B) × P(B)。两边同时除以 P(A) 即可立刻得到贝叶斯公式。

This derivation shows that Bayes’ Theorem is not a mysterious black box; it is just a rearrangement of the definition of conditional probability. What makes it useful is the interpretation: we can “reverse” the direction of conditioning.

这个推导表明贝叶斯公式并不是神秘的黑箱；它只是条件概率定义的重新排列。它的有用之处在于其解释：我们可以“反转”条件的方向。

---

5. Worked Example: Medical Testing | 实例演练：医学检测

A classic application involves diagnostic tests. Suppose a disease affects 1% of a population (P(D) = 0.01). A test for the disease has a 95% sensitivity: P(positive | disease) = 0.95. It also has a 90% specificity: P(negative | no disease) = 0.90. If a person tests positive, what is the probability they actually have the disease?

一个经典应用涉及诊断检测。假设某种疾病影响 1% 的人口（P(D) = 0.01）。针对这种疾病的检测具有 95% 的灵敏度：P(阳性 | 患病) = 0.95。它还有 90% 的特异度：P(阴性 | 未患病) = 0.90。如果一个人检测结果为阳性，他真正患病的概率是多少？

First, compute the probability of a positive test result using the Law of Total Probability:

首先，使用全概率公式计算检测结果为阳性的概率：

P(positive) = 0.95 × 0.01 + 0.10 × 0.99 = 0.0095 + 0.099 = 0.1085

Note that P(positive | no disease) = 1 − 0.90 = 0.10. Now apply Bayes’ Theorem:

注意 P(阳性 | 未患病) = 1 − 0.90 = 0.10。现在应用贝叶斯公式：

P(D|positive) = [0.95 × 0.01] / 0.1085 ≈ 0.0876

Surprisingly, even with a positive test, the probability of actually having the disease is only about 8.8%. Because the disease is rare, most positive results are false positives.

令人惊讶的是，即使检测结果为阳性，真正患病的概率也只有大约 8.8%。由于该疾病罕见，大多数阳性结果都是假阳性。

---

6. Worked Example: Spam Filtering | 实例演练：垃圾邮件过滤

Email spam filters use Bayes’ Theorem to classify messages. Suppose 20% of all emails are spam (P(spam) = 0.20). The word “win” appears in 5% of spam emails and in 0.5% of non-spam emails. If an email contains the word “win”, what is the probability it is spam?

电子邮件垃圾过滤器使用贝叶斯公式对邮件进行分类。假设 20% 的邮件是垃圾邮件（P(spam) = 0.20）。单词“win”出现在 5% 的垃圾邮件中，出现在 0.5% 的非垃圾邮件中。如果一封邮件包含“win”这个词，它是垃圾邮件的概率是多少？

Define events: S = spam, W = contains “win”. We want P(S|W). First compute P(W):

定义事件：S = 垃圾邮件，W = 包含“win”。我们要求 P(S|W)。首先计算 P(W)：

P(W) = P(W|S)P(S) + P(W|Sᶜ)P(Sᶜ) = 0.05 × 0.20 + 0.005 × 0.80 = 0.01 + 0.004 = 0.014

Then apply Bayes’ Theorem:

然后应用贝叶斯公式：

P(S|W) = [0.05 × 0.20] / 0.014 ≈ 0.714

So the probability is about 71.4%. If we also see the word “free”, we can update further, which is how filters combine evidence from multiple words.

所以概率约为 71.4%。如果我们还看到“free”这个词，可以进一步更新，这正是过滤器综合多个单词证据的方式。

---

7. Tree Diagrams and Bayes’ Theorem | 树状图与贝叶斯公式

In A-Level exams, Bayes’ Theorem problems are often best visualised using a tree diagram. Draw the first branch for the prior events (e.g., disease or no disease), then the second branch for the test result (positive or negative). Each path probability is the product of the branch probabilities.

在 A-Level 考试中，贝叶斯公式问题通常最好用树状图来直观呈现。先画出先验事件的第一层分支（例如患病或不患病），然后画出检测结果的第二层分支（阳性或阴性）。每条路径的概率是各分支概率的乘积。

To find P(B|A), locate all paths that end in A, take the path that also includes B, and divide by the sum of all paths ending in A. This is exactly what Bayes’ Theorem computes.

为了求 P(B|A)，找出所有以 A 结束的路径，取其中也包含 B 的路径，并除以所有以 A 结束的路径之和。这正是贝叶斯公式所计算的。

For example, in the medical test scenario, the relevant paths are: (disease, positive) with probability 0.0095, and (no disease, positive) with probability 0.099. The first path divided by the sum gives the posterior probability 0.0095 / 0.1085 ≈ 0.0876.

例如，在医学检测场景中，相关路径是：(患病，阳性) 的概率为 0.0095，以及 (未患病，阳性) 的概率为 0.099。第一条路径除以总和得到后验概率 0.0095 / 0.1085 ≈ 0.0876。

---

8. Common Mistakes and Pitfalls | 常见错误与陷阱

One frequent error is confusing P(A|B) with P(B|A). In the medical example, P(positive | disease) = 0.95, but P(disease | positive) ≈ 0.088. A student who writes 0.95 as the answer has completely missed the point of Bayes’ Theorem.

一个常见错误是混淆 P(A|B) 与 P(B|A)。在医学例子中，P(阳性 | 患病) = 0.95，但 P(患病 | 阳性) ≈ 0.088。写出 0.95 作为答案的学生完全没有理解贝叶斯公式的要旨。

Another mistake is forgetting to use the Law of Total Probability to calculate P(A) when it is not given directly. Always check whether you are given P(A) explicitly or whether you must compute it from the partition.

另一个错误是当 P(A) 没有直接给出时，忘记使用全概率公式来计算它。始终检查你是否被直接告知 P(A)，还是必须从划分中计算得出。

Finally, be careful with probabilities that are given in percentages or words like “twice as likely”. Convert these correctly to decimals or fractions before substituting into the formula.

最后，小心以百分比或“可能性是两倍”等文字给出的概率。在代入公式之前，务必将它们正确转换为小数或分数。

---

9. Bayes’ Theorem in Real-World Contexts | 贝叶斯公式在实际情境中的应用

Beyond textbook problems, Bayes’ Theorem appears in many real-world decision-making processes.

除了教科书问题之外，贝叶斯公式还出现在许多现实世界的决策过程中。

• Medical screening: determining the probability of disease after a positive test, as demonstrated above.

  医学筛查：在检测阳性后确定患病的概率，如上所示。

• Criminal justice: interpreting forensic evidence. The probability that a piece of evidence would appear if the defendant is innocent is not the same as the probability of innocence given the evidence.

  刑事司法：解释法医证据。如果被告无辜，某项证据会出现的概率并不等于在给定证据下被告无辜的概率。

• Machine learning: Naive Bayes classifiers power many spam filters and sentiment analysis systems.

  机器学习：朴素贝叶斯分类器支撑着许多垃圾邮件过滤器和情感分析系统。

• Finance: banks use Bayesian methods to estimate the probability of loan default based on new transaction data.

  金融：银行使用贝叶斯方法基于新的交易数据来估计贷款违约的概率。

---

10. Summary and Key Formulas | 总结与关键公式

Bayes’ Theorem is a direct consequence of conditional probability. It allows us to update a prior probability P(B) into a posterior probability P(B|A) by incorporating the likelihood P(A|B).

贝叶斯公式是条件概率的直接推论。它允许我们通过结合似然度 P(A|B)，将先验概率 P(B) 更新为后验概率 P(B|A)。

P(B|A) = P(A|B) × P(B) / P(A)

When P(A) is not known directly, use the Law of Total Probability with a partition of the sample space.

当 P(A) 无法直接得知时，使用全概率公式配合样本空间的一个划分来计算。

For A-Level exams, remember to identify the prior, the likelihood, and the total probability of the evidence. Draw a tree diagram if you are unsure. Then substitute carefully into the formula, and always sanity-check your final answer: a posterior probability should make intuitive sense given the prior and the test’s accuracy.

在 A-Level 考试中，记住识别先验概率、似然度和证据的全概率。如果不确定，画出树状图。然后仔细代入公式，并始终检查最终答案的合理性：后验概率在给定先验概率和检测准确度的情况下应当符合直觉。

Published by TutorHao | Mathematics Revision Series | aleveler.com

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

📚 Newton’s Law of Universal Gravitation and Its Applications | 牛顿万有引力定律及其应用

Newton’s law of universal gravitation is a cornerstone of classical physics. It explains the motion of planets, moons, satellites, and even falling apples. This article reviews the key concepts, formulas, and applications that appear in A-level physics exams.

牛顿万有引力定律是经典物理学的基石。它解释了行星、月球、卫星乃至落下的苹果的运动。本文系统复习A-level物理中考到的核心概念、公式与应用。

---

1. Statement of Newton’s Law of Universal Gravitation | 牛顿万有引力定律的表述

Newton’s law states that every point mass attracts every other point mass with a force that is directly proportional to the product of their masses and inversely proportional to the square of the distance between their centers.

牛顿定律指出：任何两个质点之间都存在相互吸引力，引力大小与它们质量的乘积成正比，与它们质心之间距离的平方成反比。

The magnitude of this gravitational force is given by:

该引力的大小由下式给出：

F = G m₁m₂ / r²

• F is the gravitational force (N).
• G is the gravitational constant (6.674 × 10⁻¹¹ N m² kg⁻²).
• m₁, m₂ are the masses of the two objects (kg).
• r is the distance between their centers (m).

• F 为引力（N）。
• G 为万有引力常量（6.674 × 10⁻¹¹ N m² kg⁻²）。
• m₁、m₂ 为两物体质量（kg）。
• r 为两物体质心间距离（m）。

---

2. The Gravitational Constant G | 万有引力常量 G

The constant G was first measured by Henry Cavendish in 1798 using a torsion balance. Its value is extremely small, which means gravitational forces are only noticeable when at least one of the masses is large.

常量 G 由卡文迪许在1798年用扭秤首先测量。它的数值极小，这意味着只有在至少一个物体质量很大时，引力才会明显。

Quantity	Value	Unit
G	6.674 × 10⁻¹¹	N m² kg⁻²

In calculations, G is often provided in the exam, but you should know its approximate value and the fact that it is a universal constant – the same everywhere in the universe.

在计算中，G 通常会在考试中给出，但应知道其近似值，并且它是普适常量——在宇宙任何地方都一样。

---

3. Gravitational Field Strength | 引力场强度

A gravitational field is a region of space where a mass experiences a gravitational force. The gravitational field strength g is defined as the force per unit mass:

引力场是空间中对质量产生引力的区域。引力场强度 g 定义为单位质量所受的引力：

g = F / m

For a point mass M, the field strength at a distance r from its center is:

对于质点 M，在距离其中心 r 处的场强为：

g = G M / r²

This shows that gravitational field strength decreases with the square of the distance. On Earth’s surface, g ≈ 9.81 N kg⁻¹.

这说明引力场强度随距离的平方减小。在地球表面，g ≈ 9.81 N kg⁻¹。

---

4. Acceleration due to Gravity and Surface Gravity | 重力加速度与地表重力

Near the surface of a planet, the gravitational force on an object of mass m is F = mg. Equating this with Newton’s law gives:

在行星表面附近，质量为 m 的物体所受引力为 F = mg。与牛顿定律联立可得：

g = G M / R²

where M is the planet’s mass and R is its radius.

其中 M 为行星质量，R 为行星半径。

• Earth: M = 5.97 × 10²⁴ kg, R = 6.37 × 10⁶ m, g = 9.81 m s⁻².
• Moon: M = 7.35 × 10²² kg, R = 1.74 × 10⁶ m, g ≈ 1.62 m s⁻².

• 地球：M = 5.97 × 10²⁴ kg，R = 6.37 × 10⁶ m，g = 9.81 m s⁻²。
• 月球：M = 7.35 × 10²² kg，R = 1.74 × 10⁶ m，g ≈ 1.62 m s⁻²。

Note that g varies with altitude and latitude. At height h above the surface, g(h) = G M / (R + h)².

注意 g 随海拔和纬度变化。在地表上方高度 h 处，g(h) = G M / (R + h)²。

---

5. Planetary Motion and Kepler’s Laws | 行星运动与开普勒定律

Newton’s universal gravitation explains Kepler’s laws of planetary motion. Kepler’s third law can be derived for circular orbits by equating gravitational force to centripetal force.

牛顿万有引力定律解释了开普勒行星运动定律。对于圆轨道，将引力与向心力相等即可推导出开普勒第三定律。

For a planet of mass m orbiting a star of mass M in a circular orbit of radius r:

对于质量为 m 的行星绕质量为 M 的恒星在半径为 r 的圆轨道上运动：

G M m / r² = m v² / r

This leads to T² = (4π² / G M) r³, which is Kepler’s third law.

这导致 T² = (4π² / G M) r³，即开普勒第三定律。

• Kepler’s first law: planets move in elliptical orbits with the Sun at one focus.
• Kepler’s second law: a line joining a planet and the Sun sweeps equal areas in equal times.
• Kepler’s third law: T² ∝ r³ for orbits around the same central body.

• 开普勒第一定律：行星沿椭圆轨道运动，太阳位于一个焦点上。
• 开普勒第二定律：行星与太阳的连线在相等时间内扫过相等的面积。
• 开普勒第三定律：绕同一中心天体运动的 T² ∝ r³。

---

6. Circular Motion of Satellites | 卫星的圆周运动

A satellite orbits the Earth because gravity provides the required centripetal force. For a satellite of mass m at a distance r from Earth’s center, moving with speed v:

卫星绕地球运动是因为引力提供了所需的向心力。对于质量为 m、距地心 r、速度为 v 的卫星：

G M m / r² = m v² / r

Therefore the orbital speed is:

因此轨道速度为：

v = √(G M / r)

The orbital period is:

轨道周期为：

T = 2π √(r³ / G M)

Notice that orbital speed is independent of satellite mass. A lower orbit means higher speed and shorter period.

注意轨道速度与卫星质量无关。轨道越低，速度越快，周期越短。

---

7. Geostationary Satellites | 同步卫星

A geostationary satellite appears stationary over a fixed point on Earth’s equator. It has the same angular velocity as Earth’s rotation.

同步卫星在地球赤道某一点上方看起来是静止的。它的角速度与地球自转角度相同。

Conditions for a geostationary orbit:

同步轨道的条件：

• Orbit lies in the plane of the equator.
• Direction of revolution is the same as Earth’s rotation.
• Orbital period equals Earth’s sidereal day: T = 24 h = 86 400 s.
• Orbital radius is approximately 42,200 km from Earth’s center (about 35,800 km above the surface).

• 轨道位于赤道平面内。
• 公转方向与地球自转方向相同。
• 轨道周期等于地球恒星日：T = 24 h = 86 400 s。
• 轨道半径约为42,200 km（距地心），即地表上方约35,800 km。

Geostationary satellites are used for communication, weather monitoring, and broadcasting.

同步卫星用于通信、天气预报和广播。

---

8. Weightlessness and Apparent Weight | 失重与视重

In a freely falling satellite or spacecraft, the only force acting is gravity. Objects inside appear weightless because the normal reaction force is zero.

在自由下落的卫星或航天器中，唯一作用的力是引力。由于支持力为零，内部物体看起来失重。

True weight is the gravitational force mg. Apparent weight is the normal force. In orbit, both satellite and astronaut accelerate toward Earth at the same rate, so the astronaut feels weightless.

真实重量是引力 mg，视重是支持力。在轨道上，卫星和宇航员以相同加速度朝向地球，因此宇航员感觉失重。

N = m(g – a)

When a = g, N = 0, hence weightlessness.

当 a = g 时，N = 0，即失重。

---

9. Gravitational Potential Energy | 引力势能

For a point mass m at a distance r from a mass M, the gravitational potential energy is:

对于距离质量 M 为 r 处的质点 m，引力势能为：

Eₚ = – G M m / r

The negative sign means the potential energy is zero at infinity and decreases (becomes more negative) as r decreases. This is because gravity is attractive.

负号表示在无穷远处势能为零，随着 r 减小，势能减小（更负）。这是因为引力是吸引力。

Gravitational potential V is the potential energy per unit mass:

引力势 V 是单位质量的势能：

V = – G M / r

At Earth’s surface, V ≈ -6.25 × 10⁷ J kg⁻¹.

在地球表面，V ≈ -6.25 × 10⁷ J kg⁻¹。

---

10. Escape Velocity | 逃逸速度

The escape velocity is the minimum speed an object must have at a given point to escape a planet’s gravitational field without further propulsion. It is found by equating kinetic energy to the gravitational potential energy:

逃逸速度是物体在某一位置为逃出行星引力场而不再推进所需的最小速度。令动能等于引力势能可得：

½ m v² = G M m / R

Thus:

因此：

v = √(2 G M / R) = √(2 g R)

For Earth, v ≈ 11.2 km s⁻¹. Note that escape velocity does not depend on the mass or direction of the object (as long as it path avoids the planet).

对地球，v ≈ 11.2 km s⁻¹。注意逃逸速度与物体质量或方向无关（只要路径不撞上行星）。

---

11. Applications of Universal Gravitation | 万有引力的实际应用

Universal gravitation is essential for many real-world technologies and discoveries:

万有引力在许多现实技术和发现中至关重要：

• Global Positioning System (GPS): Relies on precise orbital mechanics of satellites; gravitational time dilation corrections also involve gravity.
• Spacecraft trajectories: Slingshot maneuvers use the gravity of planets to change a probe’s velocity.
• Tides: The Moon’s and Sun’s gravitational pulls cause ocean tides.
• Mass determination: The mass of celestial bodies can be found using orbital periods and radii.

• 全球定位系统（GPS）：依赖卫星的精确轨道力学；引力时间膨胀修正也涉及引力。
• 航天器轨道：引力弹弓利用行星引力改变探测器速度。
• 潮汐：月球和太阳的引力引起海洋潮汐。
• 质量测定：通过轨道周期和半径可以求出天体质量。

Example: If a moon orbits a planet with period T and radius r, the planet’s mass is M = 4π²r³ / (G T²).

示例：若卫星以周期 T 和半径 r 绕行星运动，则行星质量 M = 4π²r³ / (G T²)。

---

12. Common Exam Points and Pitfalls | 常考考点与易错点

When solving gravitational problems, watch out for the following:

在解决引力问题时，注意以下几点：

Key Idea	Common Mistake
Use r as the distance between centers, not surface-to-surface.	Using height above surface instead of distance from center.
g is a vector pointing toward the center of mass.	Treating g as scalar in vector problems.
Gravitational potential energy is negative.	Forgetting the negative sign.
Orbital speed is slower for higher orbits.	Thinking speed increases with distance.

核心要点	常见错误
r 是质心间距，不是表面距离。	误将离地高度当作地心距离。
g 是指向质心的矢量。	在矢量题中将 g 当标量。
引力势能是负值。	遗漏负号。
轨道越高，速度越慢。	误以为距离越远速度越快。

Always write down the formula before substituting numbers, and check units carefully. For multi-step problems, clearly identify which law or principle applies.

代入数值前先写出公式，并仔细检查单位。对于多步问题，明确用哪条定律或原理。

---

Published by TutorHao | Physics Revision Series | aleveler.com

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