Interdisciplinary Problem-Solving in AQA Further Maths | AQA进阶数学跨学科综合题型训练

📚 Interdisciplinary Problem-Solving in AQA Further Maths | AQA进阶数学跨学科综合题型训练

Year 9 AQA Further Mathematics builds a bridge between pure mathematical techniques and real-world applications across physics, economics, computer science, biology, and engineering. This article presents a series of cross-disciplinary problem-solving exercises that mirror the integrated reasoning demanded by the curriculum. Each section pairs an English explanation with a Chinese translation, walks through a typical scenario, and highlights how algebraic, geometric, or numerical tools transfer to other subjects. Use these models to sharpen both your mathematical fluency and your ability to recognise opportunities for mathematical thinking wherever they appear.

AQA九年级进阶数学在纯数学技巧与物理、经济、计算机科学、生物和工程等现实应用之间架起了一座桥梁。本文提供一系列跨学科问题训练，模拟课程所要求的综合推理。每一节均配以英文说明与中文译文，带领你穿越一个典型情境，并突出代数、几何或数值工具如何迁移到其他学科。请利用这些范例提升你的数学流畅度，同时锻炼在任意场景中捕捉数学思维机会的能力。

---

1. Kinematics and Quadratic Models | 运动学与二次模型

.8 t². Explain why this is a quadratic function, determine the time to reach maximum height, and find the total time before it hits the ground. In physics, negative displacement indicates direction; here h = 0 at launch and impact.

一个球以20 m/s的初速度从地面竖直向上抛出。t秒后的高度h（米）由模型 h = 20t - ½ × 9.8 t² 给出。请解释为什么这是一个二次函数，求出达到最大高度的时间，以及球落地前的总时间。在物理中，负位移表示方向；这里在发射和撞击时 h = 0。

x, t = -b/(2a) = -20/(2×(-4.9)) ≈ 2.04 s. The ball returns to the ground when h = 0: -4.9t² + 20t = 0 → t(-4.9t + 20) = 0, giving t = 0 or t ≈ 4.08 s. Quadratic models are fundamental in mechanics because uniform acceleration produces a second-degree relationship between displacement and time.

表达式 h = -4.9t² + 20t 是一个二次函数，t²的系数为负，因此图像是开口向下的抛物线。最大值出现在顶点，t = -b/(2a) = -20/(2×(-4.9)) ≈ 2.04 秒。球回到地面时 h = 0：-4.9t² + 20t = 0 → t(-4.9t + 20) = 0，得 t = 0 或 t ≈ 4.08 秒。二次模型在力学中至关重要，因为匀加速运动使得位移与时间呈二次关系。

---

2. Supply and Demand Equilibrium | 供需平衡分析

Find the equilibrium price p* for which S = D. Then calculate the maximum possible revenue R = p × D(p) and discuss the domain where p makes sense (p ≥ 4 for non-negative supply).

在经济学中，设某产品的供给为 S(p) = 50p - 200，需求为 D(p) = 1000 - 30p，其中 p 为价格（英镑），数量以件计。求出使 S = D 的均衡价格 p*。然后计算最大可能收入 R = p × D(p)，并讨论 p 的有效范围（p ≥ 4 以使供给非负）。

Set 50p - 200 = 1000 - 30p → 80p = 1200 → p* = £ g the square or using vertex formula: p = -1000/(2×(-30)) = 1000/60 ≈ 16.67. Since p must be at least 4 and demand falls to zero at p ≈ 33.33, the realistic domain is 4 ≤ p ≤ 33.33. The maximum revenue of about £ close to the equilibrium, showing how competitive markets tend toward efficient outcomes.

令 50p - 200 = 1000 - 30p → 80p = 1200 → p* = 15 英镑。在此价格下，成交数量为 50×15 - 200 = 550 件。收入 R(p) = p(1000 - 30p) = 1000p - 30p²，这又是二次函数。通过配方或顶点公式最大化：p = -1000/(2×(-30)) = 1000/60 ≈ 16.67。由于 p 必须不小于 4 且需求在 p ≈ 33.33 时降为零，有效区间为 4 ≤ p ≤ 33.33。最大收入约 £8333.33 出现在 p ≈ 16.67，此价格接近均衡点，体现了竞争市场趋向有效结果。

---

3. Logic Gates and Boolean Algebra | 逻辑门与布尔代数

. Simplify this expression using Boolean algebra and draw the corresponding truth table. Explain how this relates to set theory where AND is intersection, OR is union, and NOT is complement.

某数字电路有三个输入 A、B、C，输出 Q = (A AND B) OR (NOT C)。用布尔代数化简该表达式，并画出相应的真值表。解释这与集合论的关联：AND 为交集，OR 为并集，NOT 为补集。

The expression cannot be reduced to a single gate, but you can apply De Morgan's laws to understand equivalent forms. Truth table: list all 8 combinations of A,B,C ∈ at is, Q = 1 if (A=1 and B=1) or (C=0). In set language, let U be the universal set; A,B,C ⊆ U. Then Q corresponds to (A ∩ B) ∪ C' tructure is common in programming conditional statements and search queries. For instance, "documents containing 'apple' AND 'orange', OR NOT 'banana'."

该表达式无法简化为单一门电路，但可以运用德摩根定律理解等价形式。真值表：列出 A,B,C ∈ {0,1} 的全部8种组合。只要 A=B=1，或者 C=0，Q 就为1。即 Q = 1 当 (A=1 且 B=1) 或 (C=0)。用集合语言，设 U 为全集，A,B,C ⊆ U，则 Q 对应 (A ∩ B) ∪ C'。这种逻辑结构常见于编程条件语句和搜索查询。例如，“包含‘apple’和‘orange’的文档，或者不包含‘banana’”。

---

4. Geometric Sequences in Computer Science | 计算机科学中的等比数列

2ᵏ. Suppose a database contains 1 million records. Estimate k and write the general term of the geometric sequence 1, ½, ¼, … tep. Derive the sum of the first m steps of work if each step examines the middle element.

在排序列表中进行二分查找每次将搜索空间减半。最大比较次数是满足 n ≤ 2ᵏ 的最小整数 k。假设一个数据库包含100万条记录，估算 k，并写出描述每一步后剩余列表比例的等比数列 1, ½, ¼, … 的通项。若每一步检查中间元素，推导前 m 步工作量的总和。

orming a geometric sequence with first term 1 and common ratio ½. The sum of the first m terms of the work (if we count one comparison per step) is a geometric series: Sₘ = 1 + ½ + ¼ + … s m grows, the total work approaches 2 units of time, illustrating logarithmic efficiency.

对于 n = 1,000,000，需要满足 2ᵏ ≥ 1,000,000。2¹⁰ = 1024，2²⁰ ≈ 104.8万，因此 k = 20 次比较足够。t 步后剩余的比例为 (½)ᵗ，构成等比数列，首项为1，公比为½。若每步计算一次比较的工作量，前 m 步总和为等比级数：Sₘ = 1 + ½ + ¼ + … + (½)ᵐ⁻¹ = (1 - (½)ᵐ)/(1 - ½) = 2(1 - (½)ᵐ)。随着 m 增大，总工作量趋近于2单位时间，展示了对数效率。

---

5. Optimization with Linear Programming | 线性规划优化

A craft workshop produces two types of boxes, A and B. Each box A requires 3 hours of cutting and 4 hours of assembly; each box B requires 6 hours of cutting and 2 hours of assembly. The workshop has 60 hours for cutting and 40 hours for assembly per week. Profit per box A is £10 and per box B is £8. Formulate the constraints as inequalities and find the production mix that maximizes weekly profit.

某手工车间生产两种盒子 A 和 B。每个 A 盒需要3小时切割和4小时组装；每个 B 盒需要6小时切割和2小时组装。车间每周切割工时上限为60小时，组装工时上限为40小时。每个 A 盒利润 £10，每个 B 盒利润 £8。将约束表示为不等式，并找出使每周利润最大化的产品组合。

le region is a quadrilateral with vertices at (0,0), (0,10), (8,4), (10,0). Profit P = 10x + 8y. Evaluate at each vertex: at (0,10) P = 80; at (10,0) P = 100; at (8,4) P = 10×8 + 8×4 = 80 + 32 = 112. Maximum profit is £112 per week, achieved by making 8 boxes A and 4 boxes B.

设 x = A 盒数量，y = B 盒数量。约束条件：3x + 6y ≤ 60（切割），4x + 2y ≤ 40（组装），x ≥ 0, y ≥ 0。化简得：x + 2y ≤ 20，2x + y ≤ 20。可行域是一个四边形，顶点为 (0,0)、(0,10)、(8,4)、(10,0)。利润 P = 10x + 8y。计算各顶点值：在 (0,10) P = 80；(10,0) P = 100；(8,4) P = 10×8 + 8×4 = 80 + 32 = 112。每周最大利润为 £112，通过生产8个A盒和4个B盒实现。

---

广告 / Sponsored

6. Force Vectors and Trigonometry | 力的矢量与三角学

al. Resolve each force into horizontal and vertical components. Determine the magnitude and direction of the resultant force. In physics, the resultant determines the net acceleration.

有两个力作用在一个物体上：F₁ = 10 N，与水平线夹角30°；F₂ = 14 N，与水平线夹角120°。将每个力分解为水平和垂直分量。求出合力的大小和方向。在物理中，合力决定了净加速度。

F₁ horizontal = 10 cos 30° = 10 × (√3 ° = 5 N. F₂ horizontal = 14 cos 120° = 14 × (-0.5) = -7 N, vertical = 14 sin 120° = 14 × (√3 2 N. Resultant horizontal = 8.66 - 7 = 1.66 N, vertical = 5 + 12.12 = 17.12 N. Magnitude = √1.66² + 17.12² ≈ √2.76 + 293.1 tal. Vector resolution links directly to trigonometric ratios and Pythagoras, and is essential for analysing structures in engineering.

F₁ 水平分量 = 10 cos 30° = 10 × (√3)/2 ≈ 8.66 N，垂直分量 = 10 sin 30° = 5 N。F₂ 水平分量 = 14 cos 120° = 14 × (-0.5) = -7 N，垂直分量 = 14 sin 120° = 14 × (√3)/2 ≈ 12.12 N。合力水平分量 = 8.66 - 7 = 1.66 N，垂直分量 = 5 + 12.12 = 17.12 N。合力大小 = √1.66² + 17.12² ≈ √2.76 + 293.1 ≈ √295.86 ≈ 17.2 N。方向 θ = arctan(17.12/1.66) ≈ 84.5°（与水平线夹角）。矢量的分解直接关联三角比与勾股定理，在工程结构分析中至关重要。

---

7. Exponential Growth in Biology | 生物中的指数增长

A bacterial culture starts with 500 cells and doubles every 3 hours. Write an equation for the number N(t) after t hours. Determine the population after 10 hours, and find the time needed to exceed 1 million cells. Exponential models appear in population dynamics, radioactive decay, and virus spread.

某细菌培养初始有500个细胞，每3小时翻一番。写出 t 小时后的数量 N(t) 的方程。计算10小时后的数量，并求出超过100万个细胞所需的时间。指数模型出现在种群动态、放射性衰变和病毒传播中。

ctor every 3 hours is 2. Number of doubling periods in t hours is t/3. Thus N(t) = 500 × 2^t/3. After 10 hours, N(10) = 500 × 2^10/3 ≈ 500 × 2³.333... = 500 × 10.079 ≈ 5040 cells. For N(t) > 1,000,000: 500 × 2^t/3 > 1,000,000 → 2^t/3 hours. Exponential equations require logarithmic reasoning, a key skill in further maths.

翻倍时间为3小时，因此每3小时的增长因子为2。t 小时内的翻倍次数为 t/3。因此 N(t) = 500 × 2^t/3。10 小时后，N(10) = 500 × 2^10/3 ≈ 500 × 2³.333... = 500 × 10.079 ≈ 5040 个细胞。要求 N(t) > 1,000,000：500 × 2^t/3 > 1,000,000 → 2^t/3 > 2000。取对数：(t/3) log 2 > log 2000。使用 log₁₀：log 2000 ≈ 3.301，log 2 ≈ 0.301。则 t/3 > 3.301/0.301 ≈ 10.97，即 t > 32.9 小时。指数方程需要运用对数推理，这是进阶数学中的关键技能。

---

8. Data Encryption with Modular Arithmetic | 模运算与数据加密

The Caesar cipher shifts letters by a fixed number. Using a shift of 3 (A→D, B→E, …, Z→C), encrypt the word "MATHS" th shift -3 recovers the original. Modular arithmetic wraps around: letter positions are 0– mod 26. This introduces the concept of modulo operation used in cryptography and hashing.

凯撒密码将字母移动固定位数。使用移位3（A→D, B→E, …, Z→C），加密单词 "MATHS"。然后验证使用移位 -3 解密是否恢复原文。模运算使字母位置在0–25之间循环，加密规则为 C = (P + 3) mod 26。这引入了密码学与哈希中使用的模运算概念。

Assign numbers: A=0, B=1, … V. Decrypt: P=15, (15-3) mod 26 = 12 → M; D=3→0=A; etc. Modulo arithmetic ensures the alphabet loops correctly. Modern RSA encryption relies on modular exponentiation with large primes, building directly on these foundations.

赋值：A=0, B=1, …, Z=25。M=12, A=0, T=19, H=7, S=18。加密：M→ (12+3) mod 26 = 15 → P；A→ (0+3)=3 → D；T→ (19+3)=22 → W；H→ (7+3)=10 → K；S→ (18+3)=21 → V。密文：PDWKV。解密：P=15，(15-3) mod 26 = 12 → M；D=3→0=A；以此类推。模运算确保字母表正确循环。现代 RSA 加密依赖大素数的模幂运算，正是构建在这些基础之上。

---

9. Financial Mathematics: Compound Interest | 金融数学：复利计算

An investment of £2000 earns 4% w long it takes for the investment to double. The compound interest formula A = P(1 + r/n)^nt models many savings and loan products.

一笔 £2000 的投资，年利率4%，按季度复利。求5年后的本利和，并确定投资翻倍所需时间。复利公式 A = P(1 + r/n)^nt 模拟了众多储蓄和贷款产品。

Here P = 2000, r = 0.04, n = 4, t = 5. A = 2000(1 + 0.04/4)^4×5 = 2000(1.01)²⁰. Using a calculator, (1.01)²⁰ ≈ 1.22019, so A ≈ £2440.38. To double: 4000 = 2000(1.01)^4t → 2 = (1.01)^4t 17.4 years. If the interest were compounded continuously, the doubling time would follow the 'rule of 70', an approximation widely used in economics.

此处 P = 2000, r = 0.04, n = 4, t = 5。A = 2000(1 + 0.04/4)^4×5 = 2000(1.01)²⁰。使用计算器，(1.01)²⁰ ≈ 1.22019，因此 A ≈ £2440.38。翻倍要求：4000 = 2000(1.01)^4t → 2 = (1.01)^4t。取自然对数：ln 2 = 4t ln (1.01)。ln 2 ≈ 0.6931，ln 1.01 ≈ 0.00995。因此 4t = 0.6931/0.00995 ≈ 69.66，得 t ≈ 17.4 年。若连续复利，翻倍时间将遵循“70法则”，经济学中广泛使用的近似计算。

---

10. Graph Theory and Network Analysis | 图论与网络分析

A small delivery network has four towns connected by roads with distances (in miles): A-B: 5, A-C: 8, B-C: 2, B-D: 7, C-D: 4. Use Dijkstra's algorithm to find the shortest path from A to D. Graph theory underpins GPS routing, social networks, and circuit design.

一个小型配送网络有四座城镇，由道路相连，距离（英里）如下：A-B:5, A-C:8, B-C:2, B-D:7, C-D:4。使用 Dijkstra 算法找出从 A 到 D 的最短路径。图论是 GPS 路径规划、社交网络和电路设计的基础。

=12. Then visit C (7). From C, update D = min(12, 7+4=11) → 11. Finally visit D. Shortest distance is 11 miles, path A→B→C→D or A→C→D? nderstanding shortest path algorithms allows efficient logistics and network data routing.

初始化距离：A=0，其他=∞。从 A 出发，更新 B=5，C=8。下一个最近的未访问节点为 B（5）。从 B 更新 C = min(8, 5+2=7) → 7；更新 D = 5+7=12。然后访问 C（7）。从 C 更新 D = min(12, 7+4=11) → 11。最后访问 D。最短距离为11英里，路径为 A→B→C→D。重建：D 经 C 到达（11），C 经 B（7），B 经 A（5）。因此 A-B-C-D 是最短的。另一条 A-C-D 为 8+4=12，更长。理解最短路径算法可以实现高效的物流和网络数据路由。

---

Published by TutorHao | Further Maths Revision Series | aleveler.com

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