📚 Number Theory: Prime Factorisation of 237 and Beyond | 数论：237的质因数分解及其扩展
Welcome to this IGCSE Mathematics revision article. We will explore the essential topic of number theory, using the number 237 as a guided example. You will learn how to perform prime factorisation, find the HCF and LCM, and avoid common pitfalls in exams.
欢迎阅读本篇 IGCSE 数学复习文章。我们将以数字 237 为引导示例，深入探索数论中的核心内容。你将学会如何进行质因数分解、求最大公约数（HCF）与最小公倍数（LCM），并避免考试中的常见错误。
1. What Are Prime Numbers? | 什么是质数？
A prime number is a positive integer greater than 1 that has exactly two distinct positive factors: 1 and itself. For example, 2, 3, 5, 7, 11 and 13 are all prime numbers. The number 2 is the only even prime number.
质数是大于 1 且恰好只有两个不同正因数的正整数：1 和它本身。例如，2、3、5、7、11 和 13 都是质数。2 是唯一的偶质数。
The number 1 is not prime because it has only one factor. Composite numbers are positive integers greater than 1 that have more than two factors, such as 4, 6, 8, 9 and 237.
数字 1 不是质数，因为它只有一个因数。合数是大于 1 且具有两个以上因数的正整数，例如 4、6、8、9 和 237。
Prime numbers are the “building blocks” of all integers. Every whole number greater than 1 is either prime or can be written as a product of primes.
质数是所有整数的“构建基石”。每个大于 1 的整数要么是质数，要么可以写成质数的乘积。
2. Prime Factorisation | 质因数分解
Prime factorisation is the process of writing a composite number as a product of its prime factors. This representation is unique for each number, a result known as the Fundamental Theorem of Arithmetic.
质因数分解是将一个合数写成其质因数乘积的过程。这种表示形式对每个数字都是唯一的，这一结果称为算术基本定理。
Let us factorise 237. We start by dividing by the smallest prime number that goes into 237 exactly. Since 2 + 3 + 7 = 12, 237 is divisible by 3.
让我们来分解 237。首先用能整除 237 的最小质数试除。因为 2 + 3 + 7 = 12，所以 237 能被 3 整除。
We get 237 ÷ 3 = 79. Now 79 must be checked for primality. The square root of 79 is about 8.9, so we only test primes 2, 3, 5 and 7. None divides 79, so 79 is prime.
计算得到 237 ÷ 3 = 79。接下来需要判断 79 是否为质数。79 的平方根约为 8.9，因此只需测试 2、3、5 和 7 这些质数。它们都不能整除 79，所以 79 是质数。
Therefore, the prime factorisation of 237 is 237 = 3 × 79.
因此，237 的质因数分解为 237 = 3 × 79。
3. Factor Trees | 因子树
A factor tree is a visual method for prime factorisation. You repeatedly split a number into two factors until all branches end at prime numbers.
因子树是质因数分解的一种可视化方法。你反复将一个数拆分为两个因数，直到所有分支末端都是质数。
For 237, we can draw a two-level tree: 237 branches into 3 and 79. Since both 3 and 79 are prime, the tree ends immediately.
对于 237，我们可以画一棵两层树：237 分出 3 和 79。由于 3 和 79 都是质数，树在这里结束。
If a number has repeated prime factors, the tree will show repeated branches. For example, 72 = 2 × 36, then 36 = 2 × 18, 18 = 2 × 9, 9 = 3 × 3, so 72 = 2³ × 3².
如果一个数有重复的质因数，因子树会显示重复的分支。例如，72 = 2 × 36，然后 36 = 2 × 18，18 = 2 × 9，9 = 3 × 3，所以 72 = 2³ × 3²。
Always write the final answer in index form. This makes it easier to compare prime factors and to calculate HCF and LCM.
务必用指数形式写出最终结果。这样可以更方便地比较质因数，并更容易计算 HCF 和 LCM。
4. Index Notation and 237 | 指数记数法与 237
Index notation is a compact way to write repeated multiplication. For example, 5 × 5 × 5 is written as 5³. In prime factorisation, we use powers of primes.
指数记数法是表示重复乘法的一种紧凑方式。例如，5 × 5 × 5 写作 5³。在质因数分解中，我们使用质数的幂。
The prime factorisation of 237 is 3 × 79. Since neither prime is repeated, we write it without an exponent, but we may also write 3¹ × 79¹ to emphasise the index.
237 的质因数分解为 3 × 79。由于没有重复的质因数，我们通常不写指数，但也可以写成 3¹ × 79¹ 以突出指数。
Compare this with a number like 360. The prime factorisation of 360 is 2³ × 3² × 5. The exponents 3, 2 and 1 tell us how many times each prime is used.
与此对比，360 的质因数分解为 2³ × 3² × 5。指数 3、2 和 1 告诉我们每个质数被使用了多少次。
When finding HCF and LCM, we must compare the exponents of the same prime factor across all numbers.
在求 HCF 和 LCM 时，我们必须比较所有数字中相同质因数的指数。
5. Greatest Common Divisor (HCF) | 最大公约数（HCF）
The HCF of two or more numbers is the largest positive integer that divides each of the numbers without a remainder. It is also called the greatest common divisor (GCD).
两个或多个数字的 HCF 是能整除每个数字且没有余数的最大正整数。它也被称为最大公约数（GCD）。
Let us find the HCF of 237 and 333. First, write both numbers in prime factorised form:
让我们来求 237 和 333 的 HCF。首先，将两个数写成质因数分解形式：
237 = 3 × 79
333 = 3² × 37
Identify the common prime factors. Both have at least one factor of 3. The lowest exponent of 3 is 1, so the HCF is 3¹ = 3.
找出共同的质因数。两个数都至少有一个因数 3。3 的最低指数是 1，所以 HCF 为 3¹ = 3。
Thus, the largest number that divides both 237 and 333 is 3.
因此，能同时整除 237 和 333 的最大数是 3。
6. Lowest Common Multiple (LCM) | 最小公倍数（LCM）
The LCM of two or more numbers is the smallest positive integer that is a multiple of each of the numbers. It is sometimes called the lowest common multiple.
两个或多个数字的 LCM 是能同时被每个数字整除的最小正整数。它有时也被称为最小公倍数。
Using the same numbers 237 and 333, we find the LCM by taking every prime factor that appears in either factorisation, with the largest exponent.
使用同样的数字 237 和 333，我们通过取每个分解式中出现的所有质因数（使用最大指数）来求 LCM。
The prime factors are 3, 37 and 79. The largest exponent for 3 is 2 (from 333), so the LCM is 3² × 37 × 79.
质因数为 3、37 和 79。其中 3 的最大指数是 2（来自 333），因此 LCM 为 3² × 37 × 79。
Compute: 9 × 37 = 333, and 333 × 79 = 26307. So LCM(237, 333) = 26307.
计算：9 × 37 = 333，333 × 79 = 26307。所以 LCM(237, 333) = 26307。
This is the smallest number that both 237 and 333 divide into exactly.
这是能被 237 和 333 都整除的最小正整数。
7. HCF and LCM using Prime Factors | 利用质因数求 HCF 和 LCM
To find HCF and LCM quickly, follow this rule: for common prime factors, use the smaller exponent to get HCF; for all prime factors, use the larger exponent to get LCM.
要快速求 HCF 和 LCM，请遵循以下规则：对于共同的质因数，取较小指数得到 HCF；对于所有质因数，取较大指数得到 LCM。
A useful relationship for two positive integers a and b is: a × b = HCF(a, b) × LCM(a, b). We can check our earlier result:
对于两个正整数 a 和 b，有一个有用的关系：a × b = HCF(a, b) × LCM(a, b)。我们可以验证刚才的结果：
237 × 333 = 78921
3 × 26307 = 78921
The products match, confirming our HCF and LCM are correct.
两个乘积相等，说明我们求得的 HCF 和 LCM 是正确的。
A Venn diagram can also help: place common prime factors in the overlapping region and the remaining factors in separate regions. The HCF is the product of the intersection, and the LCM is the product of all the numbers in the diagram.
维恩图也是一种有效的辅助工具：将共同的质因数放入重叠区域，其余因数分别放入各自的区域。HCF 是交集部分的乘积，LCM 是图中所有数字的乘积。
8. Real-life Applications | 实际应用
HCF and LCM are not just abstract ideas. They appear in problems about gears, trains, tiles and scheduling.
HCF 和 LCM 并非抽象概念。它们在齿轮、火车、瓷砖和日程安排等问题中很常见。
For example, two buses leave a station. Bus A departs every 237 minutes, and bus B departs every 333 minutes. If they leave together at 8:00 am, the next time they leave together is after LCM(237, 333) = 26307 minutes.
例如，两辆公交车从车站出发。A 车每 237 分钟发一班，B 车每 333 分钟发一班。如果它们上午 8 点同时发车，那么下一次同时发车将是在 LCM(237, 333) = 26307 分钟之后。
Converting 26307 minutes to days: 26307 ÷ 60 = 438.45 hours, which is about 18 days and 6.45 hours. Exact conversion is rarely needed, but the LCM still tells us the pattern.
将 26307 分钟转换为天数：26307 ÷ 60 = 438.45 小时，约等于 18 天 6.45 小时。通常不需要精确换算，但 LCM 告诉我们周期模式。
Another application: cutting two rods of lengths 237 cm and 333 cm into equal-length pieces with no wastage. The longest possible piece length is HCF(237, 333) = 3 cm.
另一个应用：将两根长度分别为 237 厘米和 333 厘米的杆切割成等长小段且无浪费。最长的可能小段长度是 HCF(237, 333) = 3 厘米。
In both examples, remembering the meaning of HCF and LCM helps you choose the correct method.
在这两个例子中，牢记 HCF 和 LCM 的意义有助于你选择正确的方法。
9. Common Mistakes and Tips | 常见错误与技巧
One common mistake is thinking 1 is a prime number. Remember, 1 has only one factor, so it is neither prime nor composite.
一个常见错误是认为 1 是质数。请记住，1 只有一个因数，因此它既不是质数也不是合数。
Another mistake is stopping the factorisation too early. Always check that every factor in your final expression is prime. For 237, after dividing by 3, you must confirm 79 is prime before stopping.
另一个错误是过早停止分解。始终检查最终表达式中的每个因数都是质数。对于 237，除以 3 后，必须确认 79 是质数才能结束。
Students often confuse HCF with LCM. Use the clue: HCF is always smaller than or equal to each number, while LCM is always larger than or equal to each number.
学生常常混淆 HCF 和 LCM。可以使用提示：HCF 总是小于或等于每个数，而 LCM 总是大于或等于每个数。
When using the formula a × b = HCF × LCM, always check your arithmetic. A simple multiplication error can change the whole answer.
使用公式 a × b = HCF × LCM 时，一定要检查你的算术。一个简单的乘法错误可能会改变整个答案。
Finally, use divisibility rules to speed up factorisation. For example, a number is divisible by 3 if the sum of its digits is divisible by 3. We used this for 237: 2 + 3 + 7 = 12.
最后，使用整除法则可以加快分解速度。例如，如果一个数各位数字之和能被 3 整除，那么这个数就能被 3 整除。我们就是用这个规则处理 237 的：2 + 3 + 7 = 12。
10. Practice Questions | 练习
Now try some questions yourself. Write each prime factorisation in index form, then find the HCF and LCM where asked.
现在请自己尝试一些练习。将每个质因数分解写成指数形式，然后按要求求出 HCF 和 LCM。
-
1. Find the prime factorisation of 210.
1. 求 210 的质因数分解。
-
2. Find the HCF and LCM of 24 and 36.
2. 求 24 和 36 的 HCF 和 LCM。
-
3. Given A = 2³ × 3² × 5 and B = 2² × 3 × 5², find HCF(A, B) and LCM(A, B).
3. 已知 A = 2³ × 3² × 5，B = 2² × 3 × 5²，求 HCF(A, B) 和 LCM(A, B)。
-
4. A number N has prime factorisation 3 × 79. Find the smallest positive integer that must be multiplied by N to make a perfect square.
4. 一个数 N 的质因数分解为 3 × 79。求使 N 成为完全平方数所需乘上的最小正整数。
Answers: 1) 2 × 3 × 5 × 7 = 210. 2) HCF = 12, LCM = 72. 3) HCF = 2² × 3 × 5 = 60, LCM = 2³ × 3² × 5² = 1800. 4) Since 3 and 79 each appear once, we need one more 3 and one more 79; the multiplier is 3 × 79 = 237.
答案：1) 2 × 3 × 5 × 7 = 210。2) HCF = 12，LCM = 72。3) HCF = 2² × 3 × 5 = 60，LCM = 2³ × 3² × 5² = 1800。4) 因为 3 和 79 各出现一次，所以需要各乘一次，即乘数为 3 × 79 = 237。
Prime factorisation is a fundamental skill in IGCSE Mathematics. Mastering it will help you tackle questions on factors, multiples, fractions, surds and even algebraic expressions. Keep practising with regular numbers and with numbers like 237 that have a simple but non-obvious factorisation.
质因数分解是 IGCSE 数学中的基本技能。掌握它将帮助你应对因数、倍数、分数、根式甚至代数表达式相关的问题。请坚持练习，包括像 237 这样分解简单但不够明显的数字。
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导