Mathematical Competition Techniques and Problem Types | 数学竞赛常用技巧与题型分析

📚 Mathematical Competition Techniques and Problem Types | 数学竞赛常用技巧与题型分析

Mathematical competitions reward students who can move beyond routine textbook exercises and apply core ideas in creative, unexpected ways. This article surveys the most frequently tested techniques and question types in A-Level mathematics competitions, including number theory, inequalities, combinatorics, geometry, functional equations, and sequences. Each section pairs an explanation of the underlying method with worked examples and examination tips.

数学竞赛所青睐的，不仅是教材中的常规训练，更是对核心思想进行创造性、灵活性运用的能力。本文系统梳理 A-Level 数学竞赛中最高频的技巧与题型，涵盖数论、不等式、组合数学、几何、函数方程与数列等模块。每一节都将方法讲解与实例演练配对呈现，并附上应试建议。

---

1. Algebraic Manipulation and Identities | 代数变形与恒等式

Algebraic manipulation is the foundation upon which all competition mathematics is built. Mastery of key identities gives you an immediate advantage: the difference of squares a² – b² = (a – b)(a + b), the perfect square (a ± b)² = a² ± 2ab + b², the sum of cubes a³ + b³ = (a + b)(a² – ab + b²), and the difference of cubes a³ – b³ = (a – b)(a² + ab + b²).

代数变形是一切竞赛数学的地基。熟练掌握核心恒等式能让你即刻占据先机：平方差公式 a² – b² = (a – b)(a + b)、完全平方公式 (a ± b)² = a² ± 2ab + b²、立方和公式 a³ + b³ = (a + b)(a² – ab + b²)，以及立方差公式 a³ – b³ = (a – b)(a² + ab + b²)。

Another essential skill is completing the square. Any quadratic ax² + bx + c can be rewritten as a(x – h)² + k, revealing its vertex, axis of symmetry, and extremal value at a glance. This technique appears in optimisation problems, circle equations, and even integration.

配方法是另一项必备技能。任意二次式 ax² + bx + c 均可改写为 a(x – h)² + k，从而一目了然地看出顶点、对称轴与极值。这一技巧广泛出现在优化问题、圆的方程乃至积分计算中。

Consider the problem: find the minimum value of x² + 4x + 7. Completing the square gives (x + 2)² + 3, so the minimum is 3, attained at x = -2.

例如：求 x² + 4x + 7 的最小值。配方得 (x + 2)² + 3，因此最小值在 x = -2 处取得，为 3。

x² + 4x + 7 = (x + 2)² + 3 ≥ 3

Symmetry also plays a subtle role in algebra. Expressions such as a + b, ab, and a² + b² are connected by (a + b)² = a² + 2ab + b², so if two are known, the third can be found. Competition problems frequently ask you to exploit these pairwise relationships.

对称性在代数中有微妙的作用。a + b、ab 与 a² + b² 之间由 (a + b)² = a² + 2ab + b² 相互联系，若已知其中两个，第三个立即可求。竞赛题常要求你巧妙利用这些两两关系。

---

2. Number Theory: Modular Arithmetic | 数论：模运算

Modular arithmetic is the single most useful tool in competition number theory. It reduces enormous integers to manageable remainders and exposes cyclic patterns that are otherwise invisible.

模运算是竞赛数论中最为实用的一件工具。它将庞大的整数收缩为易于处理的余数，并揭示出平时难以察觉的循环规律。

The core idea: if a ≡ b (mod m), then a and b leave the same remainder when divided by m. Consequently, we may replace numbers by their residues to simplify products, powers, and sums. Problems on divisibility, last digits, and remainders all reduce smoothly to this framework.

核心思想：若 a ≡ b (mod m)，则 a 与 b 除以 m 的余数相同。因此，计算乘积、幂与和时，可用余数替代原来的数。凡是涉及整除性、末位数字和余数的问题，都可顺利化归到这一框架中。

a ≡ b (mod m) ⟺ m | (a – b)

Example: find the last digit of 7²⁰²⁴. Observe the cycle of powers of 7 modulo 10: 7¹ ≡ 7, 7² ≡ 9, 7³ ≡ 3, 7⁴ ≡ 1 (mod 10). The cycle length is 4. Because 2024 ≡ 0 (mod 4), the last digit is 7⁴ ≡ 1.

例：求 7²⁰²⁴ 的末位数字。观察 7 的幂对 10 取模的循环：7¹ ≡ 7，7² ≡ 9，7³ ≡ 3，7⁴ ≡ 1 (mod 10)，循环长度为 4。因为 2024 ≡ 0 (mod 4)，所以末位数字为 7⁴ ≡ 1 的末位，即 1。

Fermat’s Little Theorem is a powerful shortcut for large exponents: if p is prime and p does not divide a, then a^(p-1) ≡ 1 (mod p). For instance, to compute 3¹⁰⁰ mod 7, note that 3⁶ ≡ 1 (mod 7), and since 100 = 16 × 6 + 4, we get 3¹⁰⁰ ≡ 3⁴ ≡ 81 ≡ 4 (mod 7).

费马小定理是处理大指数问题的快捷钥匙：若 p 为素数且 p 不整除 a，则 a^(p-1) ≡ 1 (mod p)。例如，计算 3¹⁰⁰ mod 7：因为 3⁶ ≡ 1 (mod 7)，且 100 = 16 × 6 + 4，故 3¹⁰⁰ ≡ 3⁴ ≡ 81 ≡ 4 (mod 7)。

Equally important is the Euclidean algorithm for greatest common divisors, and the Chinese Remainder Theorem, which reconstructs a number from its residues modulo several pairwise coprime moduli.

同样重要的还有用于求最大公约数的欧几里得算法，以及由中国剩余定理所刻画的”从若干两两互素模数的余数反推原数”的方法。

---

3. Inequalities: AM-GM and Cauchy-Schwarz | 不等式：AM-GM 与柯西-施瓦茨

Inequalities dominate many competition papers. The most frequently invoked result is the Arithmetic Mean-Geometric Mean (AM-GM) inequality: for non-negative real numbers x₁, x₂, …, xₙ,

不等式在各类竞赛卷面中占据极高比重。最常被引用的是算术-几何平均不等式（AM-GM）：对非负实数 x₁, x₂, …, xₙ，

(x₁ + x₂ + … + xₙ) / n ≥ (x₁x₂···xₙ)^(1/n)

with equality if and only if x₁ = x₂ = … = xₙ. AM-GM is ideal for squeezing out maxima of products and minima of sums under a fixed constraint.

当且仅当 x₁ = x₂ = … = xₙ 时等号成立。AM-GM 特别适合在固定约束下挤出乘积的最大值或和的最小值。

Worked example: for positive x, y with x + y = 8, find the maximum of xy. Applying AM-GM to x and y gives (x + y)/2 ≥ √(xy), hence 4 ≥ √(xy) and xy ≤ 16. Equality occurs when x = y = 4.

实例：正数 x, y 满足 x + y = 8，求 xy 的最大值。对 x, y 应用 AM-GM，(x + y)/2 ≥ √(xy)，即 4 ≥ √(xy)，故 xy ≤ 16，当 x = y = 4 时取等。

The Cauchy-Schwarz inequality is a second indispensable weapon:

柯西-施瓦茨不等式是第二件必备武器：

(a₁² + a₂² + … + aₙ²)(b₁² + b₂² + … + bₙ²) ≥ (a₁b₁ + a₂b₂ + … + aₙbₙ)²

It is superb for bounding sums of products. For example, if a + b + c = 6, applying Cauchy-Schwarz to (1, 1, 1) and (a, b, c) yields 3(a² + b² + c²) ≥ (a + b + c)² = 36, so a² + b² + c² ≥ 12.

它在估计乘积和的上界时非常出色。例如，若 a + b + c = 6，将柯西-施瓦茨应用于 (1, 1, 1) 与 (a, b, c)，得到 3(a² + b² + c²) ≥ (a + b + c)² = 36，故 a² + b² + c² ≥ 12。

When functions are convex, Jensen’s inequality can provide rapid bounds; when sums are symmetric, the rearrangement inequality often resolves which ordering is extremal. Recognising which inequality applies is half the battle.

当函数为凸函数时，琴

Published by TutorHao | Mathematics Revision Series | aleveler.com

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