📚 Prime Factorisation, LCM and HCF: Unpacking Number 146 | 质因数分解、LCM与HCF：以146为例
Prime numbers are the building blocks of all integers. Understanding how to break a number down into its prime factors is a fundamental skill in IGCSE Mathematics. The number 146 may seem ordinary, but it provides a perfect starting point to explore prime factorisation, highest common factor (HCF) and lowest common multiple (LCM) — key concepts tested regularly in the Edexcel IGCSE exam. This article will guide you through these methods step by step, using clear examples and exam-style tips.
质数是所有整数的基本构成块。掌握如何将一个数分解为质因数是IGCSE数学的一项基本技能。数字146看似平凡，但它为探索质因数分解、最大公因数(HCF)和最小公倍数(LCM)提供了完美的切入点——这些是Edexcel IGCSE考试中经常考查的关键概念。本文将逐步带你掌握这些方法，并结合清晰的示例和考试技巧。
1. What is Prime Factorisation? | 什么是质因数分解？
r is a number greater than 1 that has only two factors: 1 and itself (e.g. 2, 3, 5, 7, 11, … oduct of primes (ignoring the order of the factors). For example, 12 = 2 × 2 × 3 = 2² × 3.
质因数分解是指将一个数表示为其质因数的乘积。质数是大于1且只有两个因数（1和它本身）的数（如2、3、5、7、11……）。算术基本定理指出，每个大于1的整数都可以唯一地表示为质数的乘积（忽略因数的顺序）。例如，12 = 2 × 2 × 3 = 2² × 3。
In the Edexcel IGCSE syllabus, you are expected to be able to find the prime factor decomposition of numbers up to 1000 or more, and to use it to solve problems involving HCF and LCM.
在Edexcel IGCSE教学大纲中，你需要能够求1000以内甚至更大数的质因数分解，并利用它来解决涉及HCF和LCM的问题。
2. Factor Trees and Repeated Division | 因子树与短除法
Two common methods for prime factorisation are the factor tree and repeated division. In a factor tree, you repeatedly split the number into two factors until all branches end with primes. For repeated division (also called the ladder method), you divide the number by the smallest possible prime successively, recording the divisors. Both lead to the same prime factor list.
质因数分解的两种常见方法是因子树和短除法。在因子树中，你不断将数拆分成两个因数，直到所有分支都以质数结束。短除法（也称阶梯法）是用最小的可能质数连续除以该数，并记录除数。两种方法都得到相同的质因数列表。
actorisation is complete. With repeated division, 146 ÷ 2 = 73, so we get the same result.
例如，对于146：使用因子树，146 = 2 × 73，而2和73都是质数，因此质因数分解完成。用短除法，146 ÷ 2 = 73，得到相同结果。
3. Prime Factorisation of 146 – A Worked Example | 146的质因数分解——范例
Let' 73 is not divisible by 2, 3, 5, 7 (73 ÷ 7 ≈ 10.428), 11 (11 × 6 = 66, 11 × 7 = 77), so it' as 146 = 2 × 73. There are no exponent forms required since each prime appears only once.
让我们逐步分解146。146是偶数，因此可以被2整除。146 ÷ 2 = 73。现在检查73是否是质数。快速测试：73不能被2、3、5、7整除（73 ÷ 7 ≈ 10.428），也不能被11整除（11 × 6 = 66，11 × 7 = 77），所以它是质数。因此，146的质因数分解为2 × 73。我们写成146 = 2 × 73。无需使用指数形式，因为每个质因数只出现一次。
This simple example highlights that some numbers only have two distinct prime factors. In exam questions, you could be asked to express a number like 146 as a product of primes, which is straightforward once you spot the initial factor.
这个简单的例子表明，有些数只有两个不同的质因数。在考试题中，你可能会被要求将像146这样的数表示为质数的乘积，一旦发现初始因数，这就很简单了。
4. Highest Common Factor (HCF) | 最大公因数 (HCF)
The highest common factor (HCF) of two or more numbers is the largest integer that divides each of them without leaving a remainder. It is also known as the greatest common divisor (GCD). For example, the HCF of 12 and 18 is 6, because 6 is the biggest number that divides both 12 and 18.
两个或多个数的最大公因数（HCF）是能同时整除它们且无余数的最大整数，也称为最大公约数（GCD）。例如，12和18的HCF是6，因为6是能同时整除12和18的最大数。
In the Edexcel IGCSE, you must be able to find the HCF using prime factorisation, not just by listing factors. This method is systematic and works for larger numbers.
在Edexcel IGCSE中，你必须能利用质因数分解来求HCF，而不仅仅是通过列举因数。这种方法系统化，适用于大数。
5. Finding HCF Using Prime Factorisation | 利用质因数分解求HCF
To find the HCF of two numbers using prime factorisation, first express each number as a product of primes. Then, identify the common prime factors (present in both factorisations). For each common prime, take the lowest power that appears. Multiply these together to get the HCF.
利用质因数分解求两个数的HCF，首先将每个数表示为质数的乘积。然后找出共同的质因数（在两者的分解式中都出现的）。对于每个共同的质因数，取出现的最低次幂。将这些相乘即得HCF。
146 = 2 × 73. The only common prime factor is 2, and the lowest power is 2¹. Thus HCF = 2.
考虑146和另一个数，比如219。219 = 3 × 73。质因数分解：146 = 2 × 73，219 = 3 × 73。共同的质因数是73（每个都出现1次）。所以HCF = 73。如果我们取146和36：36 = 2² × 3²，146 = 2 × 73。唯一的共同质因数是2，最低次幂是2¹。因此HCF = 2。
This method prevents errors when numbers are large. Always list primes clearly, using index notation where helpful.
这种方法可避免大数时出错。应始终清楚地列出质因数，必要时使用指数形式。
6. Lowest Common Multiple (LCM) | 最小公倍数 (LCM)
The lowest common multiple (LCM) of two or more numbers is the smallest positive integer that is a multiple of each of them. For example, the LCM of 4 and 6 is 12. To find the LCM using prime factors, you take all prime factors that appear in either factorisation, and for each prime, take the highest power that occurs. Multiply these together.
两个或多个数的最小公倍数（LCM）是能同时被每个数整除的最小正整数。例如，4和6的LCM是12。利用质因数求LCM时，需要取所有在任一分解式中出现的质因数，并对每个质因数取其出现的最高次幂，再相乘。
power is 2²; for 3: 3²; for 73: 73¹. So LCM = 2² × 3² × 73 = 4 × 9 × 73 = 36 × 73 = 2628.
用同样的数：146 = 2 × 73，36 = 2² × 3²。涉及的质数有2、3、73。对于2：最高次幂为2²；对于3：3²；对于73：73¹。所以LCM = 2² × 3² × 73 = 4 × 9 × 73 = 36 × 73 = 2628。
7. Finding LCM Using Prime Factorisation | 利用质因数分解求LCM
ncluding 146 and 219: primes 2,3,73; highest powers: 2¹, 3¹, 73¹ → LCM = 2 × 3 × 73 = 438.
逐步法：1) 将每个数分解为质因数。2) 列出所有不重复的质数。3) 对于每个质数，找出哪个分解式中含有最高指数，使用该指数。4) 相乘。此方法适用于任意一组数，包括146和219：质数有2、3、73；最高次幂：2¹、3¹、73¹ → LCM = 2 × 3 × 73 = 438。
In exams, you may be required to present the answer as a product of prime factors or as a single number. Always check whether to leave it in index form.
考试中可能要求将答案表示为质因数的乘积形式或一个单独的数。务必检查是否需要保留指数形式。
8. HCF and LCM of More Than Two Numbers | 三个及以上数字的HCF与LCM
he The methods generalise easily. To find the HCF of 146, 36 and 219: Prime factors: 146=2×73,
Published by TutorHao | IGCSE Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图