Prime Numbers and Divisibility: A Study of 211 | 质数与可除性：以211为例

📚 Prime Numbers and Divisibility: A Study of 211 | 质数与可除性：以211为例

In this revision article, we explore the fundamental ideas of prime numbers and divisibility through a single, special number: 211. Understanding why 211 is prime, how to test for factors, and how prime numbers appear in IGCSE Mathematics will strengthen your number sense and problem-solving skills.

在本文中，我们将通过一个特殊的数字 211，来探讨质数与可除性的基本概念。理解为什么 211 是质数、如何检验因子，以及质数在 IGCSE 数学中如何出现，将帮助你增强数感并提升解题能力。

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

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, and 7 are prime because no other positive integers divide them exactly.

质数是一个大于 1 的正整数，它只有两个不同的正因数：1 和它本身。例如，2、3、5、7 都是质数，因为没有其他正整数能整除它们。

Numbers that have more than two factors are called composite numbers. The number 1 is neither prime nor composite, because it has only one positive factor.

拥有超过两个正因数的数称为合数。数字 1 既不是质数也不是合数，因为它只有一个正因数。

Prime: exactly two factors (e.g. 11, 13, 211).
质数：正好两个因数（例如 11、13、211）。
Composite: more than two factors (e.g. 12, 15, 100).
合数：多于两个因数（例如 12、15、100）。
Neither: 1 only.
既非质数也非合数：只有 1。

2. Why Is 211 Prime? | 为什么 211 是质数？

To prove that a number is prime, you must check whether it is divisible by any prime number less than or equal to its square root. The square root of 211 is approximately 14.5, since 14² = 196 and 15² = 225. Therefore, we only need to test prime numbers: 2, 3, 5, 7, 11, and 13.

要证明一个数是质数，你需要检查它是否能被小于或等于其平方根的质数整除。211 的平方根约为 14.5，因为 14² = 196，15² = 225。因此，我们只需要检验质数：2、3、5、7、11 和 13。

Check divisibility:

检验整除性：

211 is odd, so not divisible by 2.
211 是奇数，所以不能被 2 整除。
The sum of digits is 2 + 1 + 1 = 4, which is not a multiple of 3, so not divisible by 3.
数位和为 2 + 1 + 1 = 4，不是 3 的倍数，所以不能被 3 整除。
It does not end in 0 or 5, so not divisible by 5.
它不以 0 或 5 结尾，所以不能被 5 整除。
Using divisibility by 7: 7 × 30 = 210, so 211 = 7 × 30 + 1, not divisible.
检验 7：7 × 30 = 210，所以 211 = 7 × 30 + 1，不能整除。
For 11: Check alternating sum (2 − 1 + 1) = 2, not a multiple of 11.
对于 11：交替和 (2 − 1 + 1) = 2，不是 11 的倍数。
For 13: 13 × 16 = 208, remainder 3, so not divisible.
对于 13：13 × 16 = 208，余数为 3，所以不能整除。

None of these primes divide 211, so 211 is prime.

这些质数都不能整除 211，所以 211 是质数。

3. Divisibility Rules You Should Know | 你应该掌握的整除规则

Divisibility rules help you test factors quickly without performing long division. These rules form a key part of IGCSE arithmetic and factor work.

整除规则可以帮助你快速检验因子，而无需长除法。这些规则是 IGCSE 算术和因数学习的关键部分。

Divisor	Rule	Example
2	Last digit is even.	218
3	Sum of digits is a multiple of 3.	123 (1+2+3=6)
5	Last digit is 0 or 5.	205
7	Double last digit, subtract from the rest; repeat if needed.	203 → 20 − 6 = 14, divisible by 7
11	Alternating sum of digits is a multiple of 11 (including 0).	121 → 1 − 2 + 1 = 0

When testing primes like 211, these rules let you eliminate possible factors almost instantly.

在检验像 211 这样的质数时，这些规则可以让你几乎瞬间排除可能的因子。

4. Factor Pairs of 211 | 211 的因数对

A factor pair of a number n consists of two positive integers whose product is n. For 211, the only factor pair is 1 × 211, because 211 is prime.

一个数 n 的因数对是指乘积为 n 的两个正整数。对于 211，唯一的因数对是 1 × 211，因为 211 是质数。

When finding factor pairs, it is helpful to list candidates from 1 upward to the square root. If you reach the square root without finding any factor besides 1, then the number is prime.

寻找因数对时，从 1 开始一直到平方根列出候选是有帮助的。如果你到达平方根仍然只找到 1 这个因子，那么这个数就是质数。

√211 ≈ 14.5, so we only check integers from 1 to 14.

√211 ≈ 14.5，因此我们只需要检查从 1 到 14 的整数。

Since none of 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14 divide 211, the only factor pair is 1 and 211.

因为 2、3、4、5、6、7、8、9、10、11、12、13、14 都不能整除 211，所以唯一的因数对是 1 和 211。

5. The Sieve of Eratosthenes | 埃拉托斯特尼筛法

The Sieve of Eratosthenes is an ancient algorithm for finding all prime numbers up to a given limit. It is an excellent way to see why numbers like 211 appear on the prime list.

埃拉托斯特尼筛法是一种古老的算法，用于找出不超过某个上限的所有质数。它是理解为什么像 211 这样的数会出现在质数列表中的绝佳方法。

Write all numbers from 2 to your maximum limit.
写出从 2 到最大上限的所有数。
Circle 2, then cross out all multiples of 2.
圈出 2，然后划掉所有 2 的倍数。
Circle the next uncrossed number (3), then cross out all multiples of 3.
圈出下一个未被划掉的数（3），然后划掉所有 3 的倍数。
Continue this process until you reach the square root of the maximum.
继续这个过程直到达到上限的平方根。
All numbers that are left uncrossed are prime.
所有未被划掉的数就是质数。

To find primes up to 300, you only need to cross out multiples of primes up to √300 ≈ 17.3, which are 2, 3, 5, 7, 11, 13, and 17. After applying the sieve, 211 will remain unmarked, confirming it is prime.

要找出 300 以内的质数，你只需要划掉不超过 √300 ≈ 17.3 的质数的倍数，即 2、3、5、7、11、13 和 17。应用筛法后，211 将保持未标记，证明它是质数。

6. Prime Factorisation and Index Notation | 质因数分解与指数记法

Prime factorisation (or prime decomposition) writes a number as a product of its prime factors. For any composite number, this product is unique – a fact known as the Fundamental Theorem of Arithmetic.

质因数分解（也称质因数分解式）将一个数写成其质因数的乘积。对于任何合数，这个乘积是唯一的——这被称为算术基本定理。

For example, the prime factorisation of 220 is:

例如，220 的质因数分解为：

220 = 2² × 5 × 11

Since 211 is prime, its prime factorisation is simply itself:

由于 211 是质数，它的质因数分解就是本身：

211 = 211¹

In index notation, a prime number p is written as p¹. In IGCSE questions, you may be asked to express a number using index notation, or to find the Highest Common Factor (HCF) and Lowest Common Multiple (LCM) using prime factors.

在指数记法中，质数 p 写作 p¹。在 IGCSE 题目中，你可能会被要求用指数记法表示一个数，或者用质因数求最大公因数（HCF）和最小公倍数（LCM）。

HCF is found by taking the smallest power of each common prime factor.
最大公因数 是取每个公共质因数的最低次幂。
LCM is found by taking the largest power of each prime factor that appears.
最小公倍数 是取出现的每个质因数的最高次幂。

7. Applications of Prime Numbers | 质数的应用

Prime numbers are not just abstract concepts; they are essential in modern digital security. Cryptosystems like RSA rely on the fact that multiplying two large primes is easy, but factoring their product without knowing the primes is extremely difficult.

质数不仅仅是抽象概念；它们在现代数字安全中至关重要。类似 RSA 的加密系统基于这样一个事实：将两个大质数相乘很容易，但在不知道质数的情况下分解它们的乘积极其困难。

Other applications include generating random numbers, creating hash tables in computer science, and designing reliable communication codes.

其他应用包括生成随机数、在计算机科学中创建哈希表，以及设计可靠的通信编码。

In IGCSE Mathematics, you are not expected to implement RSA, but understanding why primes are so important helps you appreciate the topic beyond the exam.

在 IGCSE 数学中，你不必实现 RSA，但理解质数为何如此重要，有助于你超越考试来欣赏这个主题。

8. Common Misconceptions | 常见误解

Many students fall into the same traps when working with primes. Let us clear them up.

许多学生在处理质数时会陷入同样的陷阱。让我们把它们弄清楚。

Misconception: 1 is prime.
Truth: 1 has only one factor, so it is neither prime nor composite.
误解：1 是质数。
事实：1 只有一个因数，所以它既不是质数也不是合数。
Misconception: All odd numbers are prime.
Truth: 9, 15, 21, and 211? Wait, 211 is prime, but many odd numbers are composite like 21 = 3 × 7.
误解：所有奇数都是质数。
事实：9、15、21 都是奇数但却是合数，例如 21 = 3 × 7。211 是质数，但不能以偏概全。
Misconception: A number is composite if it has a factor greater than its square root.
Truth: Every composite number has a factor less than or equal to its square root. Checking up to √n is enough.
误解：如果某个数有一个大于其平方根的因数，它就是合数。
事实：每个合数都有一个小于或等于其平方根的因数。检查到 √n 就足够了。
Misconception: 2 is not prime because it is even.
Truth: 2 is the smallest prime and the only even prime number, since any other even number is divisible by 2.
误解：2 是偶数所以不是质数。
事实：2 是最小的质数，也是唯一的偶质数，因为任何其他偶数都能被 2 整除。

9. Working with Prime Numbers in Exam Questions | 考试题中质数的运用

Edexcel IGCSE questions often test primes in several ways. Here is a typical type you might see.

爱德思 IGCSE 题目通常从几个角度考察质数。下面是一个你可能遇到的典型题型。

(a) Write 84 as a product of prime factors.

(a) 将 84 写成质因数的乘积。

Solution: Divide by the smallest primes repeatedly.

解法：不断用最小的质数去除。

84 ÷ 2 = 42, 42 ÷ 2 = 21, 21 ÷ 3 = 7. So:

84 ÷ 2 = 42，42 ÷ 2 = 21，21 ÷ 3 = 7。因此：

84 = 2² × 3 × 7

(b) Use your answer to (a) to find the highest common factor of 84 and 126.

(b) 利用 (a) 的答案求 84 和 126 的最大公因数。

First factorise 126: 126 = 2 × 3² × 7. Then HCF takes the lowest powers of common primes: 2¹ × 3¹ × 7¹ = 42.

首先分解 126：126 = 2 × 3² × 7。然后取公共质因数的最低次幂：2¹ × 3¹ × 7¹ = 42。

For 211, since it has no common prime factors with any other number except when the other number is a multiple of 211, the HCF with any smaller positive integer is 1.

对于 211，由于它与任何其他数没有公共质因数，除非另一个数是 211 的倍数，因此它与任何较小的正整数的最大公因数都是 1。

10. Practice: Test Yourself | 练习：自我检测

Try these quick questions to check your understanding.

试试这些快速问题来检查你的理解。

List all prime numbers between 20 and 40.
列出 20 到 40 之间的所有质数。
Is 143 prime or composite? Explain your reasoning using divisibility tests.
143 是质数还是合数？用整除规则解释你的推理。
Write 360 in prime factor form using index notation.
用指数记法写出 360 的质因数形式。
The prime factorisation of 211 is 211¹. What is the smallest integer greater than 1 that you can multiply by 211 to get a perfect square?
211 的质因数分解是 211¹。要使乘积成为完全平方数，你能乘以的大于 1 的最小整数是多少？

Answers: 1. 23, 29, 31, 37. 2. 143 = 11 × 13, so composite. 3. 360 = 2³ × 3² × 5. 4. 211, because 211 × 211 = 211², which is a perfect square.

答案：1. 23、29、31、37。2. 143 = 11 × 13，所以是合数。3. 360 = 2³ × 3² × 5。4. 211，因为 211 × 211 = 211²，是完全平方数。

11. Summary | 总结

We have investigated the number 211 and, through it, reviewed the core concept of prime numbers. Remember the key steps for identifying a prime: test only primes up to its square root; use divisibility rules; and always note the special status of 2 and 1.

我们研究了数字 211，并通过它复习了质数的核心概念。记住识别质数的关键步骤：只测试不超过其平方根的质数；使用整除规则；始终注意 2 和 1 的特殊地位。

Prime numbers appear frequently in number theory, HCF/LCM problems, and even in modern technology. Mastering this topic will make many exam questions straightforward.

质数频繁出现在数论、最大公因数/最小公倍数题目中，甚至出现在现代技术中。掌握这个主题将使许多考试题目变得轻松简单。

Published by TutorHao | Mathematics Revision Series | aleveler.com

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

Prime Numbers and Divisibility: A Study of 211 | 质数与可除性：以211为例