Exploring Number 136: Prime Factors, HCF, LCM and Beyond | 探索数字136：质因数、最大公约数、最小公倍数及其应用

📚 Exploring Number 136: Prime Factors, HCF, LCM and Beyond | 探索数字136：质因数、最大公约数、最小公倍数及其应用

When preparing for the Edexcel IGCSE Mathematics exam, mastering number properties is essential. The number 136 may appear ordinary, but it provides a rich context for exploring prime factorisation, highest common factor (HCF), lowest common multiple (LCM), standard form, and real‑world problem‑solving. In this article, we will use 136 as a focal point to revise these core topics, walking through clear step‑by‑step methods that you can apply to any number.

在准备Edexcel IGCSE数学考试时，掌握数字的性质至关重要。数字136看似平凡，却为探索质因数分解、最大公约数（HCF）、最小公倍数（LCM）、标准形式以及实际问题的解决提供了丰富的背景。本文将以136为核心，复习这些核心主题，逐步讲解清晰的方法，教会你如何将这些技巧应用于任何数字。

1. The Number 136 – Why Is It Special? | 数字136有何特别之处？

136 is an even, composite number that lies between 135 and 137. In the IGCSE syllabus, it often appears in questions testing factors, multiples and prime decomposition. Its prime factorisation involves only two primes – 2 and 17 – making it an excellent starting point for revising the fundamental theorem of arithmetic.

136是一个介于135和137之间的偶数、合数。在IGCSE教学大纲中，它常出现在测试因数、倍数和质数分解的题目里。它的质因数分解仅涉及2和17这两个质数，这使它成为复习算术基本定理的绝佳起点。

ustrates how exponents arise from repeated prime factors. Throughout this article, we will keep returning to this factorisation to unlock topics like HCF and LCM.

由于136 = 2³ × 17，它完美地展示了重复的质因数如何产生指数。在整篇文章中，我们将反复使用这个分解式来解锁最大公约数和最小公倍数等主题。

---

2. Prime Factorisation – Breaking Down 136 | 质因数分解 – 分解136

2 = 68. Continue with 68 ÷ 2 = 34, then 34 ÷ 2 = 17. Since 17 is prime, the process stops.

质因数分解是将一个数表示为其质因数的乘积。对于136，我们可以使用因子树或连续除法。用最小的质数2除：136 ÷ 2 = 68。继续用68 ÷ 2 = 34，然后34 ÷ 2 = 17。因为17是质数，分解过程到此为止。

e prime factorisation of 136 is therefore 2 × 2 × 2 × 17, which we write in index form as:

因此，136的质因数分解式为2 × 2 × 2 × 17，我们将其写成指数形式：

136 = 2³ × 17

This compact form is essential when comparing numbers, simplifying fractions or calculating HCF and LCM. Always write the factors in ascending order of primes.

在比较数字、化简分数或计算最大公约数与最小公倍数时，这种紧凑的形式至关重要。请始终按质数升序书写因数。

---

3. Writing 136 in Index Form and Standard Form | 用指数形式和标准形式表示136

< 10 and n is an integer. For 136, we move the decimal point two places left to obtain 1.36, so the exponent of 10 is 2.

指数形式用指数表示重复相乘，正如我们刚看到的：2³ 表示2 × 2 × 2。IGCSE考试还要求你以标准形式表示数字，即A × 10ⁿ，其中1 ≤ A < 10，n是整数。对于136，我们将小数点左移两位得到1.36，因此10的指数为2。

136 = 1.36 × 10²

Being able to convert between ordinary numbers, index form and standard form is a key skill. Remember that a positive power of 10 indicates a large number, while a negative power would represent a small decimal.

在常规数字、指数形式和标准形式之间转换是一项关键技能。请记住，10的正指数表示较大的数，而负指数则代表较小的小数。

---

4. Understanding Highest Common Factor (HCF) with 136 | 利用136理解最大公约数（HCF）

The highest common factor (HCF) of two or more numbers is the largest integer that divides all of them without leaving a remainder. Using prime factors, we identify the common primes and take the lowest exponent for each.

两个或多个数字的最大公约数（HCF）是能够整除所有这些数的最大整数。利用质因数，我们找出公共质数，并对每个公共质数取最低指数。

ng with 136 = 2³ × 17, the only common prime is 2. The lowest power of 2 is 2². Therefore:

以136和36为例。36的质因数分解式为36 = 2² × 3²。与136 = 2³ × 17比较，唯一的公共质数是2。2的最低次幂是2²。因此：

HCF(136, 36) = 2² = 4

ally for larger numbers. Always check that your HCF actually divides both original numbers – 136 ÷ 4 = 34 and 36 ÷ 4 = 9, so it works perfectly.

这种方法比罗列因数可靠得多，尤其对于较大的数字。一定要检查你的最大公约数确实能整除两个原始数——136 ÷ 4 = 34，36 ÷ 4 = 9，完美吻合。

---

5. Finding Lowest Common Multiple (LCM) Involving 136 | 求涉及136的最小公倍数（LCM）

The lowest common multiple (LCM) is the smallest positive integer that is a multiple of each number. Using prime factors, we take all primes that appear in either factorisation, each raised to the highest exponent that occurs.

最小公倍数（LCM）是指能同时被所有数整除的最小正整数。利用质因数，我们取所有在任一分解式中出现的质数，每个质数取其出现的最高次幂。

llect the primes 2, 3 and 17. The highest exponents are 2³, 3² and 17¹. Multiplying gives:

同样以136（2³ × 17）和36（2² × 3²）为例，我们收集质数2、3和17。最高指数分别为2³、3²和17¹。相乘得到：

LCM(136, 36) = 2³ × 3² × 17 = 8 × 9 × 17 = 1224

ship HCF × LCM = product of the two numbers (4 × 1224 = 4896 = 136 × 36) also confirms it.

你可以验证结果：1224 ÷ 136 = 9，1224 ÷ 36 = 34，都恰好整除。关系式 HCF × LCM = 两数之积（4 × 1224 = 4896 = 136 × 36）也证实了结果的正确性。

---

6. Square Roots, Cube Roots and 136 | 平方根、立方根与136

Pairs of identical factors can be taken out: 2³ gives one pair of 2, leaving one 2 inside.

当你对一个非完全平方数取平方根时，可以使用质因数来化简根式。对于136，其质因数分解为2³ × 17。成对的相同因数可被提出：2³提供了一对2，剩下一个2在根号内。

√136 = √2² × 2 × 17 = 2√34

The cube root, however, cannot be simplified nicely because no prime factor appears three times in pairs. ∛136 is an irrational number approximately equal to 5.14. Estimating such roots is a useful IGCSE skill.

但立方根则无法很好地化简，因为没有任何质因数成三次出现。∛136是一个无理数，约等于5.14。估算这类根式是一项有用的IGCSE技能。

Always leave simplified surds in exact form unless the question asks for a decimal approximation.

除非题目要求求小数近似值，否则请将化简后的根式保留为精确形式。

---

广告 / Sponsored

7. Divisibility Tests and 136 | 整除性检验与136

s digits (1 + 3 + 6 = 10) is not divisible by 3, so 136 is not a multiple of 3. It ends in '36', which is divisible by 4, so 136 is divisible by 4.

整除性检验能帮助你快速识别一个数的因数。因为136以6结尾，所以它可以被2整除。其各位数字之和（1 + 3 + 6 = 10）不能被3整除，因此136不是3的倍数。它以'36'结尾，而36能被4整除，所以136能被4整除。

prime factorisation 2³ = 8. There is also a simple test for 17, but it is rarely required – instead, the factor 17 emerges directly from prime decomposition.

对于被8整除的检验，检查末三位数字：136本身末三位是136，且136 ÷ 8 = 17，因此8是它的一个因数。这和我们质因数分解中的2³ = 8一致。虽然也存在针对17的检验，但很少要求使用——质因数分解会直接暴露出因数17。

---

8. HCF and LCM Using Prime Factor Comparison – A Table Method | 用质因数比较法求HCF和LCM – 表格法

When working with more than two numbers, organising prime factors in a table makes it easier to spot common primes and the highest exponents. Let's compare 136, 60 and 48.

当处理多于两个数字时，用表格整理质因数能够更容易地找出公共质数和最高指数。我们来比较136、60和48。

Number	Prime factorisation
136	2³ × 17
60	2² × 3 × 5
48	2⁴ × 3

ake all primes with the highest exponents: 2⁴, 3, 5 and 17, giving 16 × 3 × 5 × 17 = 4080.

求HCF时，取公共质数2的最低次幂：2² = 4。求LCM时，取所有质数的最高次幂：2⁴、3、5和17，得到16 × 3 × 5 × 17 = 4080。

This structured approach prevents missing factors and is highly recommended for IGCSE problems involving three numbers.

这种结构化的方法可以防止遗漏因数，强烈推荐用于涉及三个数的IGCSE问题。

---

9. Applying HCF and LCM to Real‑life Problems with 136 | 将HCF和LCM应用于与136相关的实际问题

IGCSE often frames HCF and LCM inside word problems. Imagine you have 136 apples and 60 oranges. You want to pack them into identical gift boxes, each containing the same combination of fruits, with no leftovers. The number of boxes must be the largest possible – this calls for the HCF.

IGCSE经常将HCF和LCM嵌入文字题中。假设你有136个苹果和60个橙子。你想把它们分装进完全相同的礼品盒中，每盒装有相同的水果组合，且没有剩余。盒子的数量必须尽可能多——这需要用到HCF。

can make 4 gift boxes. Each box will contain 136 ÷ 4 = 34 apples and 60 ÷ 4 = 15 oranges.

HCF(136, 60) = 2² = 4，因此你可以制作4个礼品盒。每盒装有136 ÷ 4 = 34个苹果和60 ÷ 4 = 15个橙子。

hey next depart together, we need the LCM: LCM(136, 60) = 2040 minutes, which is 34 hours.

再假设两辆公交车分别每136分钟和每60分钟发车一次。要找到它们下次同时发车的时间，我们需要LCM：LCM(136, 60) = 2040分钟，即34小时。

Always identify whether the context requires a common divisor (HCF) or a common multiple (LCM).

务必先判断题目要求的是公约数（HCF）还是公倍数（LCM）。

---

10. Advanced Example: 136 and Another Number – Full Worked Solution | 进阶例题：136与另一个数字 – 完整解题过程

Let's work through a typical IGCSE question: 'Find the HCF and LCM of 136 and 100. Show your complete method using prime factors.'

我们来做一道典型的IGCSE题目：“求136和100的最大公约数和最小公倍数。用质因数分解展示完整步骤。”

Step 1: Prime factorisation. 136 = 2³ × 17. 100 = 2² × 5².

步骤1：质因数分解。136 = 2³ × 17。100 = 2² × 5²。

Step 2: For HCF, common prime is 2 only, lowest power is 2², so HCF = 4.

步骤2：对于HCF，唯一的公共质数是2，最低次幂是2²，因此HCF = 4。

Step 3: For LCM, take 2³, 5² and 17. Multiply: 8 × 25 × 17 = 3400.

步骤3：对于LCM，取2³、5²和17。相乘：8 × 25 × 17 = 3400。

Step 4: Check using the product‑HCF‑LCM relationship: 136 × 100 = 13600; HCF × LCM = 4 × 3400 = 13600. Confirmed.

步骤4：利用乘积‑HCF‑LCM的关系检验：136 × 100 = 13600；HCF × LCM = 4 × 3400 = 13600。确认无误。

Practising such structured answers will earn full marks in the exam.

练习这种结构化的作答方式，能在考试中拿到满分。

---

11. Common Mistakes to Avoid When Working with 136 | 处理数字136时的常见错误提醒

One frequent error is forgetting to include the prime 17 when finding LCM – students might only consider the small primes and miss the larger factor. Always write out the full prime factorisation before comparing.

一个常见错误是在求LCM时忘记包含质数17——学生可能只考虑较小的质数而遗漏了这个较大的因数。在比较之前，一定要写出完整的质因数分解式。

Another pitfall is confusing HCF and LCM: some pick the highest exponent for HCF, leading to a number larger than the originals. Remember, HCF cannot exceed any of the given numbers; LCM cannot be less than the largest number.

另一个误区是混淆HCF和LCM：有人会选择最高次幂来求HCF，导致得出的数大于原数。请记住，HCF不可能大于任一给定数字；LCM不可能小于最大的那个数。

factor is between 1 and 10. 136 written as 13.6 × 10¹ is incorrect; it must be 1.36 × 10².

最后，在书写标准形式时，确保第一个因数在1到10之间。把136写成13.6 × 10¹是错误的；必须写作1.36 × 10²。

---

12. Summary – Key Takeaways from Exploring 136 | 总结 – 探索136的关键要点

er skills: prime factorisation (2³ × 17), standard form (1.36 × 10²), simplifying surds (2√34), as well as systematic methods for HCF and LCM. The prime factor comparison method provides a universal tool that works for any set of integers.

通过本文，我们利用数字136重温了IGCSE数字部分的核心技能：质因数分解（2³ × 17）、标准形式（1.36 × 10²）、根式化简（2√34），以及求HCF和LCM的系统方法。质因数比较法是一个通用工具，适用于任何整数。

niques with a concrete example like 136 will build your confidence for the Edexcel IGCSE Mathematics exam.

无论你是面对一道直接的计算题还是文字题，请始终从质因数分解入手，清晰地组织解题过程，并用HCF × LCM = 乘积的规则进行检查。通过像136这样具体的例子掌握这些技巧，能为你的Edexcel IGCSE数学考试树立信心。

Published by TutorHao | Mathematics Revision Series | aleveler.com

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