📚 Properties of Numbers: Prime Factors, HCF and LCM Using 170 | 数的性质：用170讲解质因数、最大公因数与最小公倍数
In IGCSE Edexcel Mathematics, understanding the properties of numbers is fundamental. This article uses the number 170 as a central example to explore prime factorisation, highest common factor (HCF) and lowest common multiple (LCM). We will work through clear methods, practical applications and common pitfalls, ending with a practice problem to consolidate your skills. Whether you are preparing for an exam or simply strengthening your number sense, this guide will give you the tools to handle any HCF or LCM question with confidence.
在IGCSE Edexcel数学中，理解数的性质是基础。本文以数字170为核心示例，探讨质因数分解、最大公因数（HCF）和最小公倍数（LCM）。我们将通过清晰的方法、实际应用和常见错误进行学习，最后以一道练习题巩固技能。无论你是在备考还是强化数感，本指南都会让你从容应对任何HCF或LCM问题。
1. What Are Prime Factors? | 什么是质因数？
A prime factor is a factor of a number that is also a prime number. Prime numbers have exactly two distinct positive factors: 1 and the number itself. For example, 2, 3, 5, 7, 11 and 17 are primes. When we break down a composite number like 170 into a product of prime numbers only, we are finding its prime factorisation. This process is essential for calculating HCF and LCM efficiently without listing all factors or multiples.
质因数是指一个数既是因数又是质数。质数恰好有两个不同的正因数：1和它本身。例如2、3、5、7、11和17都是质数。当我们把像170这样的合数分解成仅有质数的乘积时，就是在进行质因数分解。这个过程对于高效计算最大公因数和最小公倍数至关重要，无需列出所有因数或倍数。
nd multiplying them together returns 170. This is the simplest breakdown possible, and it is unique (up to the order of the factors).
170的质因数分解是2 × 5 × 17。它们每一个都是质数，乘起来等于170。这是可能的最简分解，并且是唯一的（仅因数的顺序可能不同）。
2. The Unique Factorisation Theorem | 唯一分解定理
The Unique Factorisation Theorem (also called the Fundamental Theorem of Arithmetic) states that every integer greater than 1 can be written uniquely as a product of prime numbers, apart from the order of the factors. This means that if you and a friend both break down 170 into primes, you will both end up with 2, 5 and 17. There is no other set of prime numbers that multiply to 170. This theorem is the theoretical backbone of why prime factorisation is such a powerful tool.
唯一分解定理（也称算术基本定理）指出，每个大于1的整数都可以唯一地写成质数的乘积，除了因数的顺序可能不同。这意味着如果你和一位朋友都将170分解为质数，你们最终都会得到2、5和17。没有其他质数集合相乘能得到170。该定理是质因数分解为何如此强大的理论支柱。
rs are 1, we simply write it as the product. With larger numbers, you might have exponents, but for 170 it is straightforward.
在IGCSE题目中，你可能需要以指数形式将数字表示为质因数的乘积。对于170，指数形式为：170 = 2 × 5 × 17。因为指数为1，直接写成乘积即可。对于更大的数，可能会出现指数，但170很直接。
3. Finding Prime Factors of 170 Using a Factor Tree | 用因子树找出170的质因数
A factor tree is a visual method to break a number down step by step until only prime numbers remain. To build a factor tree for 170, start by finding any two factors that multiply to 170, such as 10 and 17. Then break down 10 into 2 and 5, both primes. The number 17 is already prime. You can also start with 2 and 85, then split 85 into 5 and 17. Either way, the resulting primes are 2, 5 and 17.
因子树是一种逐步分解数字直至只剩质数的直观方法。要为170构建因子树，首先找出相乘等于170的任意两个因数，例如10和17。然后将10分解为2和5，两者都是质数。17已经是质数。你也可以从2和85开始，再将85分解为5和17。无论哪种方式，最终得到的质数都是2、5和17。
t the ends of the branches to avoid mistakes. This method is particularly helpful when the number is large, but for 170 it is a quick check.
写出质因数分解：170 = 2 × 5 × 17。始终在树枝末端的质数上画圈，以避免出错。当数字较大时该方法尤其有用，但对170，这只是快速验证。
4. Highest Common Factor (HCF) Explained | 最大公因数解释
The highest common factor (HCF) of two or more numbers is the largest positive integer that divides all of them without a remainder. For example, if we want the HCF of 170 and 238, we are looking for the biggest number that fits into both exactly. We can find this by comparing their prime factorisations.
两个或多个数的最大公因数（HCF）是能整除所有这些数且不留余数的最大正整数。例如，若要找170和238的HCF，我们在寻找能同时整除两者的最大数。我们可以通过比较它们的质因数分解来找到。
Therefore, HCF(170, 238) = 34. Notice that 5 and 7 are not common, so they are discarded.
238的质因数分解：238 = 2 × 7 × 17。现在列出170的质因数：2 × 5 × 17。共同的质因数是2和17。将它们相乘得到HCF：2 × 17 = 34。因此，HCF(170, 238) = 34。注意5和7不是共有的，故忽略。
5. Calculating HCF Using Prime Factors of 170 and Another Number | 用170和另一个数的质因数计算HCF
The step-by-step method for HCF using prime factors:
使用质因数求HCF的分步方法：
press each number as a product of prime factors. For 170: 2 × 5 × 17. For 130: 2 × 5 × 13.
将每个数表示为质因数的乘积。对于170：2 × 5 × 17。对于130：2 × 5 × 13。
Identify the prime factors that appear in all the numbers. Both 170 and 130 have 2 and 5.
找出所有数中都出现的质因数。170和130都有2和5。
For each common prime, take the smallest power that appears. Here powers are all 1.
对每个共有质数，取出现的最小次幂。这里所有的指数均为1。
Multiply these together to get the HCF: 2 × 5 = 10. So HCF(170, 130) = 10.
将它们相乘得到HCF：2 × 5 = 10。所以HCF(170, 130) = 10。
÷ 10 = 17, 130 ÷ 10 = 13. Both results are integers with no remainder, confirming the HCF.
你可以通过检验来验证：170 ÷ 10 = 17，130 ÷ 10 = 13。两个结果都是整数且无余数，证明了HCF。
6. Lowest Common Multiple (LCM) Explained | 最小公倍数解释
The lowest common multiple (LCM) of two numbers is the smallest positive integer that is a multiple of both. Using prime factorisation, you can find LCM without listing endless multiples. The LCM must contain every prime factor from each original number, raised to the highest power that appears.
两个数的最小公倍数（LCM）是同时为两者倍数的最小正整数。利用质因数分解，无需列出无穷多个倍数就能找到LCM。LCM必须包含每个原始数的所有质因数，并取出现过的最高次幂。
power of each (all to power 1). Multiply: 2 × 5 × 13 × 17 = 2210. So LCM(170, 130) = 2210.
要找出170（2 × 5 × 17）和130（2 × 5 × 13）的LCM：列出所有不同的质数：2、5、13、17。取每个的最高次幂（均为1次）。相乘：2 × 5 × 13 × 17 = 2210。因此LCM(170, 130) = 2210。
7. Calculating LCM Using Prime Factors of 170 and Another Number | 用170和另一个数的质因数计算LCM
his differs from the HCF of the same pair (34). The LCM includes the extra unshared primes (5 and 7).
我们来计算170和238（2 × 7 × 17）的LCM。所有不同的质数：2、5、7、17。因此LCM = 2 × 5 × 7 × 17 = 1190。注意它与相同数字对的HCF（34）不同。LCM包括了额外的非共享质数（5和7）。
A helpful relationship: for two numbers a and b, a × b = HCF(a,b) × LCM(a,b 238 = 40460. HCF × LCM = 34 × 1190 = 40460. This quick check can prevent errors in exams.
一个有用的关系：对于两个数 a 和 b，a × b = HCF(a,b) × LCM(a,b)。用170和238检验：170 × 238 = 40460。HCF × LCM = 34 × 1190 = 40460。这个快速检验可以避免考试中的失误。
8. Why HCF and LCM Are Useful | 为什么HCF和LCM有用
HCF and LCM appear in many real-world contexts. For example, if you have two pieces of string, one 170 cm long and the other 238 cm, and you want to cut both into equal lengths with no waste, the HCF (34 cm) gives the largest possible equal length. In scheduling, if two events repeat every 170 minutes and 238 minutes, the LCM (1190 minutes) tells you when both will coincide again.
HCF和LCM出现在许多现实场景中。例如，你有两段绳子，一段长170厘米，另一段长238厘米，想把它们都剪成等长且不浪费，HCF（34厘米）给出了可能的最大等长。在排程问题中，如果两个事件每隔170分钟和238分钟重复一次，LCM（1190分钟）告诉你它们将再次同时发生的时间。
In IGCSE, you may see problems about tiling a rectangle or arranging objects in rows. Recognising when to use HCF or LCM is a key skill. HCF divides things down; LCM builds things up.
在IGCSE中，你可能会遇到铺设地砖或排列物品的行列问题。识别何时使用HCF或LCM是一项关键技能。HCF用于分解；LCM用于构建。
9. Common Mistakes and Tips | 常见错误与提示
Mixing up HCF and LCM. HCF involves common factors only; LCM involves all factors at highest power. Think 'HCF smaller, LCM larger' than the original numbers.
混淆HCF和LCM。 HCF只涉及公因数；LCM以最高次幂涵盖所有因数。记住HCF比原数小，LCM比原数大。
Forgetting to use index form correctly. rrect power. For 170, all powers are 1, but with numbers like 72 (2³ × 3²), pay attention.
忘记正确使用指数形式。 如果质数带有指数，比如2³，你必须使用正确的次幂。对于170所有指数都是1，但是像72（2³ × 3²）这样的数要特别留意。
Missing a prime factor. Always double-check your factor tree, especially with large composites. Use a calculator to divide and verify.
遗漏质因数。 务必仔细核查你的因子树，特别是对于大的合数。用计算器做除法验证。
HCF of 1. If numbers share no common prime factors, the HCF is 1. Do not write 0.
HCF为1的情况。 如果两个数没有共享质因数，HCF是1，不要写成0。
10. Worked Example: HCF and LCM of 170 and 238 | 解题示例：170和238的HCF与LCM
Question: Find the highest common factor and lowest common multiple of 170 and 238. Express your answers as products of prime factors.
问题：求170和238的最大公因数和最小公倍数。将答案表示为质因数的乘积。
Step 1: Prime factorisation of 170: 170 = 2 × 5 × 17.
第1步： 170的质因数分解：170 = 2 × 5 × 17。
Step 2: Prime factorisation of 238: 238 = 2 × 7 × 17.
第2步： 238的质因数分解：238 = 2 × 7 × 17。
Step 3: HCF: Common primes are 2 and 17. HCF = 2 × 17 = 34.
第3步： HCF：共同的质数为2和17。HCF = 2 × 17 = 34。
Step 4: LCM: All distinct primes: 2, 5, 7, 17. LCM = 2 × 5 × 7 × 17 = 1190.
第4步： LCM：所有不同质数：2、5、7、17。LCM = 2 × 5 × 7 × 17 = 1190。
Verification: 170 × 238 = 34 × 1190 = 40460. Correct.
验证： 170 × 238 = 34 × 1190 = 40460。正确。
This method works even for three or more numbers, though you need to be careful with common primes across all numbers for HCF.
这种方法甚至适用于三个或更多的数，不过求HCF时要注意所有数共有的质数。
11. Using Prime Factorisation in Index Form | 使用指数形式的质因数分解
like 360 or 2025, where writing in index form saves space. For 170, index form is: 170 = 21 × 51 × 171. In practice, we omit the exponent 1, but it is implied. When finding HCF, take the smallest exponent for each common prime; for LCM, take the largest exponent.
虽然170很简单，但在IGCSE中你会遇到像360或2025这样的数，此时写成指数形式更节省空间。对于170，指数形式是：170 = 21 × 51 × 171。实践中我们省略指数1，但它隐含其中。求HCF时，对每个共有质数取 最小 的指数；求LCM时，取 最大 的指数。
Example: Find HCF and LCM of 170 and 1000. 1000 = 23 × 53. 170 = 21 × 51 × 171. HCF: common primes 2 and 5, smallest exponents: 21 × 51 = 10. LCM: all primes with largest exponents: 23 × 53 × 171 = 8 × 125 × 17 = 17000. This becomes second nature with practice.
示例：求170和1000的HCF和LCM。1000 = 23 × 53。170 = 21 × 51 × 171。HCF：共有质数2和5，取最小指数：21 × 51 = 10。LCM：所有质数，取最大指数：23 × 53 × 171 = 8 × 125 × 17 = 17000。练习多了这会变成第二天性。
12. Practice Problem and Summary | 练习题与总结
CF and LCM of 170 and 255. (Hint: 255 = 3 × 5 × 17). Check using the product relationship.
自己动手试试：求170和255的HCF和LCM。（提示：255 = 3 × 5 × 17）。用乘积关系进行检验。
170 into 2 × 5 × 17, you gain a clear view of its building blocks. Remember the core ideas – erent pairs and you will master these essential number skills for your IGCSE Edexcel exam.
总结：质因数分解是高效解决HCF和LCM问题的关键。通过将170分解为2 × 5 × 17，你能清晰地看到它的构成元素。牢记核心理念——HCF寻找最低次幂的共同质因数；LCM收集所有质因数并取最高次幂。用不同的数字对持续练习，你定能为IGCSE Edexcel考试掌握这些核心的数论技能。
Published by TutorHao | IGCSE Edexcel Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图