📚 Mastering Prime Factorisation, HCF and LCM for IGCSE Edexcel Maths | 掌握IGCSE Edexcel数学：质因数分解、最大公因数和最小公倍数
Prime factorisation, highest common factor (HCF), and lowest common multiple (LCM) form the bedrock of number theory in the IGCSE Edexcel Mathematics syllabus. A confident grasp of these topics is essential not only for standalone questions but also for manipulating fractions, solving real-life problems, and tackling higher-level algebraic expressions. This guide unpacks every key concept, method, and common pitfall, ensuring you walk into the exam hall fully prepared.
质因数分解、最大公因数（HCF）和最小公倍数（LCM）是IGCSE Edexcel数学教学大纲中数论的基础。熟练掌握这些概念不仅对单独考查的题目至关重要，而且对于分数的运算、解决现实问题以及处理更高阶的代数表达式也同样关键。本指南将逐一拆解每个关键概念、方法和常见误区，确保你自信满满地走进考场。
1. Prime Numbers and Composite Numbers | 质数与合数
A prime number is a natural number greater than 1 that has exactly two distinct positive factors: 1 and itself. For instance, 2, 3, 5, 7, 11 are prime. The number 1 is neither prime nor composite. Composite numbers, such as 4, 6, 8, 9, 10, have more than two factors. Recognising primes quickly is vital when building factor trees, and you are expected to know all primes up to at least 20 by heart.
质数是大于1的自然数，且只有两个互不相同的正因数：1和它本身。例如，2、3、5、7、11都是质数。数字1既不是质数也不是合数。合数，如4、6、8、9、10，拥有两个以上的因数。在构建因数树时快速识别质数至关重要，你应至少熟记到20的所有质数。
- Remember: 2 is the only even prime number. | 记住：2是唯一的偶质数。
- Primes up to 20: 2, 3, 5, 7, 11, 13, 17, 19. | 到20的质数：2, 3, 5, 7, 11, 13, 17, 19。
2. Foundations of Prime Factorisation | 质因数分解的基础
ndex notation: 2² × 3. Mastering this concept allows you to unlock the structure of any integer.
质因数分解是指将一个合数表示为其质因数的乘积。算术基本定理保证了每一个大于1的数都可以唯一地表示为质数的乘积（不计因数的顺序）。例如，12 = 2 × 2 × 3，或更简洁地用指数记法表示为 2² × 3。掌握这一概念能让你揭示任何整数的内在结构。
3. Factor Trees: The Visual Method | 因数树：直观的方法
: 72 → 8 × 9 → (2 × 4) and (3 × 3) → 2 × 2 × 2 × 3 × 3 = 2³ × 3². There are many valid trees, but the final primes are always the same.
因数树将数字逐步分解，直到所有分支末端都是质数。使用因数树时，从原数开始，将其拆分为任意两个因数，重复操作直至只剩下质数。圈出的质数相乘就得到质因数分解式。以72为例，一种可能的树为：72 → 8 × 9 → (2 × 4) 和 (3 × 3) → 2 × 2 × 2 × 3 × 3 = 2³ × 3²。可行的树有很多种，但最终质因数总是一致的。
| Step 1: 72 = 8 × 9 | 第1步：72 = 8 × 9 |
| Step 2: 8 = 2 × 4, 9 = 3 × 3 | 第2步：8 = 2 × 4，9 = 3 × 3 |
| Step 3: 4 = 2 × 2 | 第3步：4 = 2 × 2 |
| Primes: 2, 2, 2, 3, 3 | 质数：2, 2, 2, 3, 3 |
4. Product of Prime Factors in Index Form | 用指数形式表示质因数积
t and makes subsequent HCF and LCM calculations much easier. Always double-check by multiplying back to the original number.
IGCSE考试答案通常要求用指数记法按升序写出质因数。在从因数树列出所有质数后，将相同底数分组并统计出现次数。对于120，我们得到 2 × 2 × 2 × 3 × 5 = 2³ × 3 × 5。指数形式简洁紧凑，能让后续的HCF和LCM计算轻松许多。一定要通过乘回原数进行验算。
Example: 300 = 2² × 3 × 5²
示例：300 = 2² × 3 × 5²
5. Finding the Highest Common Factor (HCF) | 求最大公因数 (HCF)
. Their product, 2² × 3 = 12, is the HCF. This method works perfectly for three numbers as well: 24 (2³ × 3), 36 (2² × 3²), 60 (2² × 3 × 5) have common primes 2 and 3 with lowest powers 2² and 3¹, giving HCF = 12.
两个或更多数的HCF是能整除所有这些数的最大的数。利用质因数分解，找出公共质因数，再取每个公共质数的最低次幂。对于 48 = 2⁴ × 3 和 60 = 2² × 3 × 5，公共质因数是2和3。2的最低次幂是2²，3的最低次幂是3¹。它们的乘积 2² × 3 = 12 就是HCF。这个方法对三个数同样适用：24 (2³ × 3)，36 (2² × 3²)，60 (2² × 3 × 5) 的公共质因数是2和3，最低次幂分别为2²和3¹，得出 HCF = 12。
- If numbers share no common prime factors, the HCF is 1. | 如果数字没有公共质因数，则HCF为1。
- Always express HCF as an integer, not in index form. | 始终将HCF表示为整数，而非指数形式。
6. Determining the Lowest Common Multiple (LCM) | 确定最小公倍数 (LCM)
2⁴ × 3 × 5 = 240. For three numbers, say 24, 36, 60, the full set of primes is 2, 3, 5; highest powers: 2³ (from 24), 3² (from 36), 5¹ (from 60). LCM = 2³ × 3² × 5 = 360.
LCM是能同时被所有给定数整除的最小的数。用质因数分解时，取出现在任意数字中的每个质因数，并升至其最高次幂。对于 48 = 2⁴ × 3 和 60 = 2² × 3 × 5，收集所有不同的质数：2, 3, 5。最高次幂分别是2⁴、3¹、5¹。相乘：2⁴ × 3 × 5 = 240。对于三个数，比如24、36、60，质数全集为2, 3, 5，最高次幂：2³（来自24）、3²（来自36）、5¹（来自60）。LCM = 2³ × 3² × 5 = 360。
7. HCF and LCM Using Venn Diagrams | 用维恩图求HCF和LCM
iant visual shortcut, especially when working with two or three numbers. Write each number' 7, the intersection contains 2 and 3; HCF = 6. The union gives LCM = 2² × 3² × 5 × 7 = 1260.
维恩图提供了一种出色的可视化捷径，尤其适用于两到三个数。将每个数的质因数写在各自的圆圈内，然后将公共质数放入重叠区域。绘制完毕后，HCF就是所有圆圈交集（中心）中的质因数之积，LCM则是维恩图中任何地方出现的所有质因数之积。对于 90 = 2 × 3² × 5 和 84 = 2² × 3 × 7，交集包含2和3，HCF = 6。并集给出 LCM = 2² × 3² × 5 × 7 = 1260。
nship between HCF and LCM. Remember the relationship: HCF × LCM = a × b (for two numbers).
这种方法能减少算术错误，并有助于直观理解HCF与LCM的关系。记住这一关系：HCF × LCM = a × b（针对两个数）。
8. Real-Life Applications of HCF and LCM | HCF和LCM的实际应用
Edexcel IGCSE frequently embeds HCF and LCM within practical contexts. HCF problems typically involve dividing items equally, such as cutting ribbons into equal maximum lengths or packing items into identical boxes with no leftovers. LCM appears when events repeat at regular intervals, like two buses arriving at a stop or machines beeping simultaneously. Always identify what the question demands: the greatest equal grouping (HCF) or the next time things coincide (LCM).
Edexcel IGCSE经常将HCF和LCM嵌入实际情景中。HCF问题通常涉及将物品均分，例如把丝带剪成相等的最大长度，或将物品装入完全相同的盒子里且无剩余。LCM则出现在事件以固定间隔重复发生时，比如两辆公交车同时到达车站，或机器同时发出哔哔声。始终需要判断题目要求的是：最大等分量（HCF）还是下一次同时发生的时间（LCM）。
| wo lighthouses flash every 12 s and 18 s. LCM(12,18) = 36 s until next simultaneous flash. | 示例：两座灯塔每12秒和18秒闪烁一次。LCM(12,18) = 36秒后再次同时闪烁。 |
9. Working with Three or More Numbers | 处理三个或更多数字
When finding HCF and LCM for three numbers, the logic extends naturally. List all numbers' process with all numbers simultaneously. For 20 = 2² × 5, 30 = 2 × 3 × 5, 50 = 2 × 5², the common prime is 2 and 5 with exponents 1 and 1, so HCF = 10. LCM = 2² × 3 × 5² = 300.
当求三个数的HCF和LCM时，逻辑自然延伸。列出所有数的质因数分解式，对HCF只取三者共有的质数，使用最小指数。对LCM取任何数中出现的所有质数，使用最大指数。一个常见错误是假定三个数的HCF等于前两个数的HCF再与第三个数结合；务必对所有数字同时操作。对于 20 = 2² × 5，30 = 2 × 3 × 5，50 = 2 × 5²，公共质数为2和5，指数均为1，因此 HCF = 10。LCM = 2² × 3 × 5² = 300。
10. Common Pitfalls and How to Avoid Them | 常见误区及如何避免
rap is incomplete factorisation: stopping too early, leaving composite factors. Always continue until every factor is prime. When using index form, forgetting to take the correct power (lowest for HCF, highest for LCM) leads to wrong answers. Finally, in word problems, misinterpreting the scenario often causes a reversal; practise translating 'greatest', 'largest possible' into HCF, and 'repeating', 'next time' into LCM.
许多学生混淆HCF和LCM。记住：HCF ≤ 原数 ≤ LCM。另一个陷阱是分解不完全：过早停止，留下合数因数。务必继续分解直到每个因数都是质数。使用指数形式时，忘记取正确的次幂（HCF取最低，LCM取最高）会导致答案错误。最后，在文字问题中，错误解读情景常常导致用法颠倒；练习将“最大的”、“可能的最大”转换为HCF，将“重复”、“下一次”转换为LCM。
- Double-check with the formula: HCF(a,b) × LCM(a,b) = a × b. | 用公式复核：HCF(a,b) × LCM(a,b) = a × b。
- Never leave a factor tree containing a 1. | 绝不要让因数树中含有1。
11. Exam-Style Questions and Techniques | 考试型题目与应考技巧
IGCSE Edexcel often asks: "Write 252 as a product of prime factors in index form" or "Find the HCF and LCM of 72 and 108" for HCF/LCM. Marks are awarded for working, so present each step neatly. If a problem says "find the smallest number that has exactly these prime factors...", think of the number that uses all primes to the given powers—that's the number itself. For "find the integer z such that 2³×3×z is a perfect square", ensure all indices are even.
IGCSE Edexcel经常提问：“将252写成质因数的指数形式”或“求72和108的HCF和LCM”。处理这类题目要有条不紊：展示清晰的因数树或短除法，给出指数形式，然后使用维恩图或幂次规则求HCF/LCM。解题步骤占分，因此每一步都要工整呈现。如果题目要求“找出恰好具有以下质因数的最小数……”，想到的使用所有给定次幂的质数的乘积就是该数本身。对于“求整数z使2³×3×z为完全平方数”，要确保所有指数为偶数。
Example: 180 = 2² × 3² × 5; to make a square, multiply by 5 → 2² × 3² × 5².
示例：180 = 2² × 3² × 5；要成为平方数，乘以5 → 2² × 3² × 5²。
12. Summary and Key Takeaways | 总结与关键要点
Prime factorisation is a cornerstone skill that directly feeds into HCF, LCM, and beyond into fractions, surds, and algebra. Always aim for complete factorisation, use index form to stay organised, and apply the correct power rule: lowest for HCF, highest for LCM. Practise with a mix of pure number problems and contextual word problems. Consistent practice makes these concepts second nature, saving you valuable time in the exam. Remember that no IGCSE question on these topics is meant to be tricky—they reward a clear, systematic approach.
质因数分解是一项基础技能，直接关系到HCF、LCM，乃至分数、根式、代数等更高级内容。始终力求分解彻底，使用指数形式保持条理，并应用正确的幂次规则：HCF取最低，LCM取最高。混合练习纯数字题和情景型文字题。持续练习会使这些概念成为你的第二天性，为考试节省宝贵时间。请记住，IGCSE中关于这些主题的任何题目都不以刁难为目的——它们奖励清晰、系统的方法。
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图