Prime Numbers and Factors: Exploring 193 | 质数与因数：探究193

📚 Prime Numbers and Factors: Exploring 193 | 质数与因数：探究193

In IGCSE Mathematics, understanding prime numbers, factors and multiples forms the bedrock of number theory. This article takes a closer look at the prime nature of the number 193 and then expands into prime factorisation, highest common factor (HCF) and lowest common multiple (LCM) – all essential topics in the Edexcel IGCSE syllabus. Whether you are building a solid foundation or preparing for exam-style questions, mastering these concepts will sharpen your numerical skills.

在IGCSE数学中，理解质数、因数和倍数是数论的基石。本文先深入探讨数字193的质数特性，然后扩展到质因数分解、最大公因数（HCF）和最小公倍数（LCM）——这些全部是Edexcel IGCSE考纲中的核心主题。无论你是夯实基础还是准备考试型题目，掌握这些概念都将强化你的计算能力。

1. What is a Prime Number? | 什么是质数？

A prime number is a whole number greater than 1 that has exactly two distinct factors: 1 and itself. For example, 7 is prime because only 1 × 7 gives 7. The number 1 is not prime because it only has one factor. Composite numbers have more than two factors. Recognising primes is fundamental for factorisation and simplifying fractions.

质数是大于1且恰好有两个不同因数的整数：1和它本身。例如，7是质数，因为只有1 × 7等于7。数字1不是质数，因为它只有一个因数。合数则有两个以上的因数。识别质数是因式分解和约分的基础。

Prime numbers include 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, and so on. Notice that 2 is the only even prime; all other even numbers are divisible by 2 and therefore composite. This simple definition unlocks many problem-solving techniques in IGCSE exams.

质数包括2、3、5、7、11、13、17、19、23、29等等。注意2是唯一的偶质数；其他所有偶数都能被2整除，因此都是合数。这个简单的定义为IGCSE考试中的许多解题技巧打开了大门。

2. Is 193 a Prime Number? | 193是质数吗？

To test if 193 is prime, check divisibility by prime numbers less than or equal to its square root. The square root of 193 is approximately 13.89, so we only need to test primes up to 13: 2, 3, 5, 7, 11, 13.

要检验193是不是质数，需要检查它能否被小于或等于其平方根的质数整除。193的平方根大约是13.89，因此我们只需检验不超过13的质数：2, 3, 5, 7, 11, 13。

Divisibility by 2: 193 is odd, so not divisible by 2. | 能被2整除吗：193是奇数，所以不能被2整除。
Divisibility by 3: Sum of digits 1 + 9 + 3 = 13, not divisible by 3, so 193 is not divisible by 3. | 能被3整除吗：各位数字之和1 + 9 + 3 = 13，不能被3整除，所以193不能被3整除。
Divisibility by 5: Last digit is 3, not 0 or 5. No. | 能被5整除吗：末位数字是3，不是0或5，不能。
Divisibility by 7: 7 × 27 = 189, remainder 4, so no. | 能被7整除吗：7 × 27 = 189，余4，不能。
Divisibility by 11: 11 × 17 = 187, remainder 6, so no. | 能被11整除吗：11 × 17 = 187，余6，不能。
Divisibility by 13: 13 × 14 = 182, remainder 11, so no. | 能被13整除吗：13 × 14 = 182，余11，不能。

Since none of these primes divide 193 exactly, 193 is indeed a prime number. This method of using the square root limit is efficient and exam-friendly.

由于这些质数都不能整除193，因此193确实是一个质数。这种利用平方根界限的方法既高效又适合考试。

3. Prime Factorisation | 质因数分解

Prime factorisation expresses a composite number as a product of prime factors. For example, 12 = 2 × 2 × 3 = 2² × 3. Writing numbers in index form saves time and helps when finding HCF and LCM. Every whole number greater than 1 can be factorised uniquely, a fact known as the Fundamental Theorem of Arithmetic.

质因数分解是将合数表示为质因数相乘的形式。例如，12 = 2 × 2 × 3 = 2² × 3。用指数形式书写可以节省时间，并且有助于求HCF和LCM。每一个大于1的整数都可以被唯一分解，这被称为算术基本定理。

A factor tree is a visual method. Start with the number, split into two factors, and continue until all branches end in primes. For 72, we get 72 = 2³ × 3². This technique appears regularly in IGCSE questions, often as a step towards simplifying surds or solving number problems.

因数树是一种直观的方法。从该数开始，分成两个因数，继续拆分直到所有分支以质数结束。对于72，我们得到72 = 2³ × 3²。这种方法经常出现在IGCSE题目中，常常作为化简根式或解决数字问题的步骤。

4. Factors and Multiples | 因数和倍数

A factor of a number divides that number exactly without a remainder. The factors of 193 are 1 and 193, because it is prime. For composite numbers, finding all factor pairs is a key skill. A multiple of a number is the product of that number and any integer. For example, multiples of 193 are 193, 386, 579, etc.

一个数的因数可以整除该数而没有余数。193的因数是1和193，因为它是质数。对于合数，找到所有因数对是一项关键技能。一个数的倍数是该数与任意整数的乘积。例如，193的倍数有193、386、579等。

Understanding factors helps in identifying prime numbers and simplifying ratios. Multiples are used in sequences, timetables, and when finding common denominators. In IGCSE, you are often asked to list all factors or establish whether a larger number is a multiple of a given integer.

理解因数有助于识别质数以及化简比率。倍数用于数列、时间表以及寻找公分母。在IGCSE中，经常要求列出所有因数，或者判断一个较大的数是否是另一个整数的倍数。

5. Highest Common Factor (HCF) | 最大公因数 (HCF)

The highest common factor (HCF) of two or more numbers is the largest integer that divides all of them without a remainder. For 36 and 60, the factor list method works: factors of 36 are 1, 2, 3, 4, 6, 9, 12, 18, 36; factors of 60 are 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60. The common factors are 1, 2, 3, 4, 6, 12, so HCF = 12.

两个或多个数的最大公因数（HCF）是能够整除所有这些数的最大整数。对于36和60，可以使用列举因数法：36的因数有1, 2, 3, 4, 6, 9, 12, 18, 36；60的因数有1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60。公因数有1, 2, 3, 4, 6, 12，因此HCF = 12。

When one of the numbers is prime, such as pairing 193 with another number, the HCF is either 1 or 193 itself if the other number is a multiple of 193. In number problems, HCF is essential for simplifying fractions and dividing quantities evenly.

当其中一个数为质数时，比如将193与另一个数配对，如果另一个数是193的倍数，则HCF为193，否则为1。在数字问题中，HCF对于化简分数和均匀分配数量至关重要。

6. Lowest Common Multiple (LCM) | 最小公倍数 (LCM)

The lowest common multiple (LCM) is the smallest positive integer that is a multiple of two or more numbers. Using 193 and another number, say 12, the LCM can be found by listing multiples: multiples of 193 are 193, 386, 579, 772, 965, 1158, …; multiples of 12 are 12, 24, 36, 48, 60, 72, 84, 96, 108, 120, … We look for the first common occurrence. However, a far quicker method uses prime factors or the relationship LCM × HCF = product of numbers.

最小公倍数（LCM）是两个或多个数的最小的正整数倍数。拿193和另一个数（比如12）来说，可以通过列举倍数求得LCM：193的倍数有193, 386, 579, 772, 965, 1158, …；12的倍数有12, 24, 36, 48, 60, 72, 84, 96, 108, 120, …我们寻找第一个相同的倍数。但是，更快的方法是使用质因数或者利用关系式 LCM × HCF = 两数之积。

For 193 and 12, since 193 is prime and does not share any prime factors with 12 (2² × 3), the LCM is simply their product: 193 × 12 = 2316. This shortcut is a huge time-saver in IGCSE exams.

对于193和12，因为193是质数且与12（2² × 3）没有共同的质因数，所以LCM就是它们的乘积：193 × 12 = 2316。这个捷径在IGCSE考试中能节省大量时间。

7. Using Prime Factorisation to Find HCF and LCM | 用质因数分解求HCF和LCM

Prime factorisation provides a systematic method. Write each number as a product of prime factors in index form. For HCF, take the product of the lowest power of each common prime factor. For LCM, take the product of the highest power of all prime factors that appear.

质因数分解提供了一套系统的方法。将每个数写成指数形式的质因数乘积。求HCF时，取每个公共质因数的最低次幂的乘积。求LCM时，取所有出现的质因数的最高次幂的乘积。

Number	Prime Factorisation
36	2² × 3²
60	2² × 3 × 5

Common primes are 2 and 3. Lowest powers: 2² and 3¹. HCF = 2² × 3 = 12. For LCM, highest powers: 2², 3² and 5¹, so LCM = 2² × 3² × 5 = 4 × 9 × 5 = 180. This structured approach prevents mistakes in more complex problems.

公共质因数是2和3。最低次幂：2²和3¹。HCF = 2² × 3 = 12。对于LCM，取最高次幂：2², 3²和5¹，所以LCM = 2² × 3² × 5 = 4 × 9 × 5 = 180。这种结构化的方法可以避免在较复杂问题中出错。

When one number is prime, like 193, its prime factorisation is simply 193¹. Combining it with a composite number, the HCF will be 1 if 193 is not a factor of the other number, and the LCM will be the product. Understanding these patterns builds confidence in tackling word problems.

当其中一个数是质数时，例如193，它的质因数分解就是193¹。把一个质数与一个合数组合时，如果193不是另一个数的因数，HCF就是1，LCM就是两数之积。理解这些模式可以增强解决应用题的自信心。

8. Real-Life Applications | 实际应用

Primes and factorisation are not just abstract ideas. Encryption algorithms that secure online transactions rely on large prime numbers. In everyday life, HCF helps in dividing identical items into equal groups, such as packing sweets into bags with no leftovers. LCM is used to synchronise events repeating at different intervals, like bus arrivals or scheduling regular medication.

质数与因数分解并非纸上谈兵。保障在线交易安全的加密算法依赖于大质数。在日常生活中，HCF可用于将相同的物品均分成小组，例如将糖果分装成没有剩余的小袋。LCM则用于同步以不同间隔重复的事件，比如公共汽车到站时间或安排定期服药。

For instance, if a machine beeps every 193 seconds and another every 12 seconds, the first moment they beep together is found by LCM(193,12) = 2316 seconds. This real context reinforces the relevance of the topic beyond the classroom.

举个例子，如果一台机器每193秒发出一声蜂鸣，另一台每12秒发出一声，它们第一次同时蜂鸣的时间可通过LCM(193,12) = 2316秒求出。这样的真实情境加深了这一主题在课堂之外的实用性。

9. Exam-Style Questions | 考试题型示例

Edexcel IGCSE often presents problems that combine primes, factors and multiples within a single question. Typical formats include:

Edexcel IGCSE经常在一道题中结合质数、因数和倍数进行考查。常见题型包括：

Prove that 193 is prime. | 证明193是质数。
Express 600 as a product of prime factors in index form. | 将600写成指数形式的质因数乘积。
Find the HCF and LCM of 84 and 96. | 求84和96的HCF和LCM。
Two numbers have HCF 1 and product 386. What could the numbers be if one is 193? | 两个数的HCF为1，乘积为386。若其中一个数是193，另一个数可能是多少？

To solve the last one: if HCF is 1 and one number is 193, the other must be 2, because 193 × 2 = 386 and they share no common factor other than 1. Always check that the HCF condition holds.

解答最后一问：如果HCF为1且其中一个为193，另一个数必然是2，因为193 × 2 = 386且它们除1外没有公因数。永远要验证HCF条件是否成立。

Practising such problems develops accuracy and speed. Remember to show clear working, as method marks are awarded even if the final answer has a slip.

练习这类题目可以提高准确性和速度。要记得展示清晰的解题过程，因为即使最终答案有疏漏，过程分还会计入。

10. Summary | 总结

Prime numbers are the building blocks of all integers, and 193 serves as a perfect example of a prime. Prime factorisation methodically unlocks the structure of composite numbers, enabling efficient calculation of HCF and LCM. Grasping these IGCSE concepts and their real-world connections not only leads to exam success but also strengthens logical reasoning.

质数是所有整数的基石，193正是质数的一个完美范例。质因数分解有条不紊地揭示了合数的结构，从而可以高效地计算HCF和LCM。掌握这些IGCSE概念及其与现实的联系，不仅能取得考试成功，还能增强逻辑推理能力。

Stay consistent in your revision and attempt a mix of straightforward and challenging problems involving 193 or other numbers. With solid practice, you will confidently tackle any prime-factor question in your Edexcel IGCSE Maths exam.

保持连贯的复习节奏，尝试解决涉及193或其他数字的直接和挑战性问题。通过扎实的练习，你将胸有成竹地应对Edexcel IGCSE数学考试中的任何质因数问题。

Published by TutorHao | IGCSE Mathematics Revision Series | aleveler.com

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

Prime Numbers and Factors: Exploring 193 | 质数与因数：探究193