Integer Properties and Their Applications | 整数性质及其应用

📚 Integer Properties and Their Applications | 整数性质及其应用

Integers are the building blocks of mathematics. From counting objects to solving advanced equations, the properties of integers (whole numbers, including zero and negatives) form the foundation of number theory and appear frequently in examinations. This article explores the key properties of integers and demonstrates how to apply them effectively in problem-solving.

整数是数学的基石。从数数到解复杂的方程，整数的性质（包括零和负数的全体整数）构成了数论的基础，也是各类考试中的常客。本文将系统地梳理整数的核心性质，并展示如何在解题中灵活运用这些性质。

1. Divisibility Rules | 整除规则

Divisibility is the study of whether one integer can be divided by another without leaving a remainder. The most useful divisibility tests are those for small prime numbers and their powers. For any integer n, it is divisible by 2 if its last digit is even, and divisible by 3 if the sum of its digits is divisible by 3.

整除研究的是一个整数能否被另一个整数除尽而不留余数。最常用的整除判定法则针对小质数及其幂次。对于任意整数 n，若末位为偶数则 n 能被 2 整除；若各位数字之和能被 3 整除，则 n 能被 3 整除。

Additional rules worth memorising include: a number is divisible by 4 if its last two digits form a number divisible by 4; by 5 if its last digit is 0 or 5; by 6 if it is divisible by both 2 and 3; by 8 if its last three digits form a number divisible by 8; by 9 if the sum of its digits is divisible by 9; and by 11 if the alternating sum of its digits is divisible by 11. For example, to test 4,257, we compute (7 – 5 + 2 – 4) = 0, which is divisible by 11, so 4,257 is divisible by 11.

其他值得记忆的法则包括：末尾两位组成的数能被 4 整除，则原数能被 4 整除；末位为 0 或 5 则能被 5 整除；同时能被 2 和 3 整除则能被 6 整除；末尾三位组成的数能被 8 整除，则原数能被 8 整除；各位数字之和能被 9 整除，则原数能被 9 整除；奇偶位数字交替相减的差能被 11 整除，则原数能被 11 整除。例如，检验 4,257，计算 (7 – 5 + 2 – 4) = 0，0 能被 11 整除，因此 4,257 能被 11 整除。

Divisibility by 11: (sum of digits in odd positions) − (sum of digits in even positions) ≡ 0 (mod 11)

被 11 整除法则：奇数位数字之和 − 偶数位数字之和 ≡ 0 (mod 11)

2. Prime Numbers | 质数（素数）

A prime number is a positive integer greater than 1 that has exactly two distinct positive divisors: 1 and itself. The number 1 is not prime because it only has one positive divisor. The first ten primes are 2, 3, 5, 7, 11, 13, 17, 19, 23 and 29. Note that 2 is the only even prime number, since every other even number is divisible by 2.

质数是大于 1 且恰好有两个不同正因数的正整数：1 和它本身。数字 1 不是质数，因为它只有一个正因数。前十个质数为 2、3、5、7、11、13、17、19、23 和 29。注意 2 是唯一的偶质数，因为其他所有偶数都能被 2 整除。

The Fundamental Theorem of Arithmetic states that every positive integer greater than 1 can be expressed uniquely as a product of primes, apart from the order of the factors. This unique prime factorisation is essential in simplifying fractions, finding GCD and LCM, and solving exponential equations. For example, 360 = 2³ × 3² × 5.

算术基本定理指出，每个大于 1 的正整数都可以唯一地分解为质数的乘积（不考虑因数的顺序）。这种唯一的质因数分解在化简分数、求最大公约数（GCD）和最小公倍数（LCM）以及解指数方程中至关重要。例如，360 = 2³ × 3² × 5。

To determine whether a number n is prime, it suffices to test divisibility by all primes up to √n. This is because if n has a factor greater than √n, then it must also have a factor smaller than √n. This method is the basis of the Sieve of Eratosthenes, an ancient and efficient way to list all primes up to a given limit.

判断一个数 n 是否为质数，只需检验所有不大于 √n 的质数是否能整除 n。因为如果 n 有大于 √n 的因数，则必然也有小于 √n 的因数。这一方法是埃拉托斯特尼筛法的基础，该古老而高效的方法可以在给定范围内列出所有质数。

Prime test: n is prime ⟺ n has no prime divisor p with p ≤ √n

质数判定：n 是质数 ⟺ n 不存在满足 p ≤ √n 的质因数 p

3. GCD and LCM | 最大公约数与最小公倍数

The greatest common divisor (GCD) of two integers is the largest positive integer that divides both of them, while the least common multiple (LCM) is the smallest positive integer that is divisible by both. These concepts are fundamental in working with fractions, ratios and periodic events.

两个整数的最大公约数（GCD）是能同时整除这两个整数的最大正整数，而最小公倍数（LCM）是能被这两个整数同时整除的最小正整数。这些概念在处理分数、比值和周期事件时至关重要。

Given the prime factorisation of two numbers, the GCD is obtained by taking each prime to the smallest exponent appearing in either factorisation, and the LCM is obtained by taking each prime to the largest exponent. For instance, for a = 2³ × 3² × 7 and b = 2² × 3³ × 5, we have gcd(a, b) = 2² × 3² = 36 and lcm(a, b) = 2³ × 3³ × 5 × 7 = 7,560.

已知两个数的质因数分解后，GCD 取每个质数在分解中出现的最小指数，LCM 取每个质数出现的最大指数。例如，对于 a = 2³ × 3² × 7 和 b = 2² × 3³ × 5，有 gcd(a, b) = 2² × 3² = 36，而 lcm(a, b) = 2³ × 3³ × 5 × 7 = 7,560。

The Euclidean algorithm provides a fast method for finding the GCD without factorising. It relies on the fact that gcd(a, b) = gcd(b, a mod b), repeating this step until the remainder becomes zero. For example, to find gcd(252, 105): 252 = 2 × 105 + 42, 105 = 2 × 42 + 21, 42 = 2 × 21 + 0, so the GCD is 21.

欧几里得算法提供了一种不依赖分解的快速求 GCD 的方法。它基于恒等式 gcd(a, b) = gcd(b, a mod b)，不断迭代直到余数为零。例如，求 gcd(252, 105)：252 = 2 × 105 + 42，105 = 2 × 42 + 21，42 = 2 × 21 + 0，因此 GCD 为 21。

A crucial relationship connects the GCD and LCM of two positive integers a and b:

一个连接 GCD 与 LCM 的关键恒等式如下：

a × b = gcd(a, b) × lcm(a, b)

This property is extremely useful: if you know the GCD and one number, you can immediately find the LCM, and vice versa. In competition problems, this identity often reduces what appears to be a two-variable problem into a single equation.

这一性质极为有用：若已知 GCD 和其中一个数，即可立即求出 LCM，反之亦然。在竞赛题中，这一恒等式常将看似二元的问题化为一元方程。

4. Modular Arithmetic | 模运算

Modular arithmetic, sometimes called “clock arithmetic”, treats integers by their remainders when divided by a fixed positive integer, called the modulus. For integers a and b, we write a ≡ b (mod m) if m divides (a − b), meaning a and b leave the same remainder upon division by m.

模运算有时也称为”时钟运算”，它依据整数除以固定正整数（称为模数）所得的余数来研究整数。对于整数 a 和 b，若 m 能整除 (a − b)，则记 a ≡ b (mod m)，这意味着 a 和 b 除以 m 的余数相同。

Modular arithmetic preserves addition and multiplication: if a ≡ b (mod m) and c ≡ d (mod m), then a + c ≡ b + d (mod m) and a × c ≡ b × d (mod m). This makes it a powerful tool for testing divisibility, finding last digits, and solving Diophantine equations. For example, to find the last digit of 7²⁰²⁵, note that 7¹ ≡ 7 (mod 10), 7² ≡ 9, 7³ ≡ 3, 7⁴ ≡ 1 (mod 10). Since 2025 = 4 × 506 + 1, the last digit is 7.

模运算保持加法和乘法：若 a ≡ b (mod m) 且 c ≡ d (mod m)，则 a + c ≡ b + d (mod m) 且 a × c ≡ b × d (mod m)。这使得模运算成为检验整除性、求末位数字以及解丢番图方程的利器。例如，求 7²⁰²⁵ 的末位数字，注意 7¹ ≡ 7 (mod 10)，7² ≡ 9，7³ ≡ 3，7⁴ ≡ 1 (mod 10)。由于 2025 = 4 × 506 + 1，末位数字是 7。

For mod 10: the last digit cycles with period 4 for base 7: 7, 9, 3, 1

模 10 下：底数 7 的末位数字以 4 为周期循环：7、9、3、1

Fermat’s Little Theorem provides a deeper result: if p is prime and a is not divisible by p, then aᵖ⁻¹ ≡ 1 (mod p). This theorem is widely used in cryptography and in simplifying large-power computations. For instance, to compute 3¹⁰⁰ (mod 7), since 7 is prime and 3 ≢ 0 (mod 7), we have 3⁶ ≡ 1 (mod 7), and 100 = 6 × 16 + 4, so 3¹⁰⁰ ≡ 3⁴ = 81 ≡ 4 (mod 7).

费马小定理给出了更深层的结论：若 p 为质数且 a 不被 p 整除，则 aᵖ⁻¹ ≡ 1 (mod p)。该定理广泛应用于密码学和简化大幂次计算。例如，计算 3¹⁰⁰ (mod 7)，因为 7 是质数且 3 ≢ 0 (mod 7)，有 3⁶ ≡ 1 (mod 7)，而 100 = 6 × 16 + 4，故 3¹⁰⁰ ≡ 3⁴ = 81 ≡ 4 (mod 7)。

5. Parity | 奇偶性

Parity refers to whether an integer is even or odd. Even integers are divisible by 2 and can be written as 2k, while odd integers are not divisible by 2 and take the form 2k + 1, where k is an integer. The parity rules are simple: even ± even = even, odd ± odd = even, even ± odd = odd; even × even = even, odd × odd = odd, even × odd = even.

奇偶性指一个整数是偶数还是奇数。偶数能被 2 整除，可写成 2k；奇数不能被 2 整除，可写成 2k + 1，其中 k 为整数。奇偶运算法则简单：偶 ± 偶 = 偶，奇 ± 奇 = 偶，偶 ± 奇 = 奇；偶 × 偶 = 偶，奇 × 奇 = 奇，偶 × 奇 = 偶。

Parity arguments are often the first step in proving that an equation has no integer solutions. For example, the equation x² + y² = 2,023,007 has no integer solutions because x² and y² are each either 0 or 1 modulo 4 (since squares are 0 or 1 mod 4), so the sum can only be 0, 1 or 2 modulo 4. But 2,023,007 ≡ 3 (mod 4), a contradiction.

奇偶论证常常是证明方程无整数解的第一步。例如，方程 x² + y² = 2,023,007 没有整数解，因为 x² 和 y² 模 4 分别为 0 或 1（平方数模 4 只能为 0 或 1），所以它们的和模 4 只能是 0、1 或 2。但 2,023,007 ≡ 3 (mod 4)，矛盾。

Another classic parity result is that the square of an integer is always non-negative and congruent to 0 or 1 modulo 4. This fact is used in many Diophantine problems to eliminate impossible cases before attempting full solutions.

另一个经典的奇偶结论是：整数的平方永远非负且模 4 同余于 0 或 1。这一事实在许多丢番图问题中被用于先排除不可能的情况，再进行完整求解。

6. Perfect Squares and Cubes | 完全平方数与完全立方数

A perfect square is an integer that equals the square of some integer, such as 0, 1, 4, 9, 16, 25. A perfect cube is an integer that equals the cube of some integer, such as 0, 1, 8, 27, 64. Recognising perfect powers from their last digits or their prime factorisation is a key skill in integer problems.

完全平方数是某个整数的平方，例如 0、1、4、9、16、25。完全立方数是某个整数的立方，例如 0、1、8、27、64。从末位数字或质因数分解中识别完全幂是在整数问题中的关键技能。

The last digit of a perfect square must be 0, 1, 4, 5, 6 or 9; it can never be 2, 3, 7 or 8. This gives a quick way to rule out certain candidates. Additionally, in the prime factorisation of a perfect square, every prime appears with an even exponent; for a perfect cube, every prime appears with an exponent that is a multiple of 3.

完全平方数的末位数字只能是 0、1、4、5、6 或 9，绝不可能是 2、3、7 或 8。这为快速排除某些候选数提供了捷径。此外，完全平方数的质因数分解中每个质数的指数都是偶数；完全立方数中每个质数的指数都是 3 的倍数。

n is a perfect square ⟺ for every prime p, the exponent of p in the prime factorisation of n is even

n 是完全平方数 ⟺ n 的质因数分解中每个质数 p 的指数均为偶数

Consecutive integers that are both perfect powers have deep number-theoretic significance. A well-known problem asks to find all pairs of consecutive integers that are both perfect squares; the only non-trivial example is 8 and 9 (2³ and 3²). This was famously resolved by Euler for consecutive perfect squares and by Mihăilescu in 2002 for all perfect powers (Catalan’s conjecture).

连续整数同为完全幂的问题具有深刻的数论意义。一个著名问题是求所有连续且同为完全平方数的整数对；唯一的非平凡例子是 8 和 9（即 2³ 和 3²）。欧拉解决了连续完全平方的情况，而米哈伊列斯库在 2002 年解决了所有完全幂的情况（即卡塔兰猜想）。

7. Integer Sequences | 整数序列

Integer sequences appear throughout mathematics, and understanding their properties is essential for solving sequence-related problems. An arithmetic sequence has a constant common difference d, with the n-th term given by aₙ = a₁ + (n − 1)d. A geometric sequence has a constant common ratio r, with the n-th term aₙ = a₁ × rⁿ⁻¹.

整数序列遍布数学各个领域，理解其性质对解决与序列相关的问题至关重要。等差数列具有恒定的公差 d，第 n 项为 aₙ = a₁ + (n − 1)d；等比数列具有恒定的公比 r，第 n 项为 aₙ = a₁ × rⁿ⁻¹。

Another famous integer sequence is the Fibonacci sequence, defined by F₁ = 1, F₂ = 1, and Fₙ = Fₙ₋₁ + Fₙ₋₂ for n ≥ 3. Its terms are 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, …. The Fibonacci numbers appear in natural phenomena and have many remarkable divisibility properties, such as gcd(Fₘ, Fₙ) = F_{gcd(m,n)}.

另一个著名的整数序列是斐波那契数列，定义为 F₁ = 1，F₂ = 1，且当 n ≥ 3 时 Fₙ = Fₙ₋₁ + Fₙ₋₂。其各项为 1、1、2、3、5、8、13、21、34、55、…… 斐波那契数出现在自然现象中，并有许多显著的整除性质，例如 gcd(Fₘ, Fₙ) = F_{gcd(m,n)}。

When solving integer sequence problems, always check whether the sequence is arithmetic, geometric, Fibonacci-like, or defined by repeated addition of a square or a multiple. Identifying the type of sequence early can dramatically simplify the problem.

在解决整数序列问题时，务必先判断序列是等差、等比、斐波那契型，还是通过重复加平方数或倍数来定义的。尽早识别序列类型可以大大简化问题。

8. Problem-Solving Strategies | 解题策略

Effective problem solving with integers requires a toolbox of strategies. The first and most fundamental technique is to exhaustively consider small cases to guess a pattern, then prove the pattern by induction or contradiction. This “guess-and-prove” approach is common in number theory.

高效地解整数问题需要一个策略工具箱。最基本的技术是先穷举小规模情况以猜测规律，再通过归纳法或反证法证明规律。这种”先猜后证”的方法在数论中十分常见。

Proof by contradiction is especially powerful: assume that an integer solution exists, derive a contradiction using parity, modular arithmetic, or inequalities, and conclude that no solution exists. For example, to show that √2 is irrational, assume √2 = a/b in lowest terms, then a² = 2b², implying a is even; substituting a = 2c gives 4c² = 2b², so b² = 2c², implying b is even, contradicting the assumption that a/b was in lowest terms.

反证法尤为强大：假设存在整数解，利用奇偶性、模运算或不等式推出矛盾，从而得出无解的结论。例如，证明 √2 是无理数：假设 √2 = a/b 为最简分数，则 a² = 2b²，推出 a 为偶数；令 a = 2c，则 4c² = 2b²，即 b² = 2c²，推出 b 也为偶数，这与 a/b 是最简分数矛盾。

Another strategy is to bound the search space. If solving for integer variables in an equation, derive upper and lower bounds for each variable, then check only the finitely many possibilities. Combining bounds with parity and modular constraints usually reduces the candidate set to a handful of numbers.

另一个策略是限制搜索范围。若在方程中求整数变量，先推导每个变量的上下界，然后仅检验有限种可能。将界与奇偶性和模约束结合，通常能把候选集合缩小到少数几个数。

Finally, use the identity gcd(a, b) × lcm(a, b) = a × b whenever a problem relates to factors or multiples. This identity links two seemingly separate ideas and often reveals hidden structure in the problem.

最后，当题目涉及因数或倍数时，善用恒等式 gcd(a, b) × lcm(a, b) = a × b。该恒等式将两个看似独立的概念联系起来，常常揭示题目中隐藏的结构。

9. Common Pitfalls | 常见误区

Students frequently make several predictable errors when working with integer properties. The most common is forgetting that 1 is not prime. Another is assuming that if a number is not divisible by any number up to √n, it might still be composite; this is false — testing up to √n is sufficient and necessary.

学生在处理整数性质时常犯几类可预见的错误。最常见的错误是忘记 1 不是质数。另一个常见错误是认为如果一个数不能被任何不大于 √n 的数整除，它仍可能是合数；事实上这是错误的 — 检验到 √n 既充分又必要。

A subtle error involves the divisibility by 11 rule: students often confuse whether the alternating sum should start with the digit on the left or the right. The correct statement is that the alternating sum (from right to left) must be divisible by 11, which gives the same result regardless of the starting point modulo 11. Additionally, negative integers are perfectly valid in modular arithmetic; for example, −1 ≡ 9 (mod 10).

一个微妙的错误涉及被 11 整除的法则：学生常混淆交替和应从左侧还是右侧的数字开始。正确的规则是（从右向左的）交替和必须能被 11 整除，由于模 11 下的对称性，从哪一侧开始结果一致。另外，负整数在模运算中完全合法；例如，−1 ≡ 9 (mod 10)。

Also note the difference between “divides” and “is divisible by”: a ∣ b means a divides b (b is a multiple of a), while b is divisible by a means the same thing. Writing “2 ∣ 6” is correct, while “6 ∣ 2” is false. Confusing the order of the integers in the divisibility symbol is a classic source of lost marks.

还要注意”整除”与”被整除”的区别：a ∣ b 表示 a 整除 b（即 b 是 a 的倍数），而说”b 能被 a 整除”表达的是同一个意思。书写”2 ∣ 6″是正确的，而”6 ∣ 2″是错误的。混淆整除符号中整数的先后顺序是常见的失分原因。

10. Practice Problems | 练习题

Problem 1: Find the smallest positive integer n such that n² is divisible by 24 but n is not divisible by 24.

问题 1：求最小的正整数 n，使得 n² 能被 24 整除，但 n 不能被 24 整除。

Solution: Since 24 = 2³ × 3, for n² to be divisible by 24, n² must contain at least 2³ × 3. This requires n to contain at least 2² × 3 (since factors in n are doubled in n²), so n must be divisible by 12. The smallest positive multiple of 12 is 12 itself; check that 12² = 144 = 6 × 24, divisible by 24, and 12 is not divisible by 24. Thus n = 12.

解答：因为 24 = 2³ × 3，要使 n² 能被 24 整除，n² 中至少要包含 2³ × 3。这要求 n 中至少包含 2² × 3（因为 n 中的因数在 n² 中指数翻倍），所以 n 必须能被 12 整除。最小的正整数倍是 12 本身；验证 12² = 144 = 6 × 24，能被 24 整除，而 12 不能被 24 整除。因此 n = 12。

Problem 2: Prove that the sum of the squares of any three consecutive integers is never divisible by 3.

问题 2：证明任意三个连续整数的平方和不能被 3 整除。

Solution: Let the three integers be n, n + 1, n + 2. Their squares sum to n² + (n + 1)² + (n + 2)² = 3n² + 6n + 5 = 3(n² + 2n + 1) + 2. This equals a multiple of 3 plus 2, so it is congruent to 2 (mod 3) and therefore never divisible by 3.

解答：设三个整数为 n、n + 1、n + 2。它们的平方和为 n² + (n + 1)² + (n + 2)² = 3n² + 6n + 5 = 3(n² + 2n + 1) + 2。这等于 3 的倍数加 2，因此同余于 2 (mod 3)，故永不能被 3 整除。

Problem 3: Find all integer solutions to x² ≡ 2 (mod 7).

问题 3：求 x² ≡ 2 (mod 7) 的所有整数解。

Solution: Check x mod 7: x = 0 → 0² = 0; x = 1 → 1; x = 2 → 4; x = 3 → 9 ≡ 2; x = 4 → 16 ≡ 2; x = 5 → 25 ≡ 4; x = 6 → 36 ≡ 1. Thus x ≡ 3 or 4 (mod 7), meaning all integers of the form 7k + 3 and 7k + 4 for any integer k.

解答：逐一检验模 7：x = 0 时 0² = 0；x = 1 时为 1；x = 2 时为 4；x = 3 时 9 ≡ 2；x = 4 时 16 ≡ 2；x = 5 时 25 ≡ 4；x = 6 时 36 ≡ 1。因此 x ≡ 3 或 4 (mod 7)，即所有形如 7k + 3 和 7k + 4 的整数，其中 k 为任意整数。

Problem 4: The product of two positive integers is 600 and their GCD is 5. Find all possible pairs.

问题 4：两个正整数的乘积为 600，其 GCD 为 5。求所有可能的数对。

Solution: Using a × b = gcd(a, b) × lcm(a, b), we get 5 × lcm = 600, so lcm = 120. Write a = 5m, b = 5n, where gcd(m, n) = 1. Then mn = 600 / 25 = 24, and lcm(a, b) = 5mn = 5 × 24 = 120, consistent. The coprime factor pairs of 24 are (1, 24), (3, 8). Hence the possible pairs are (5, 120) and (15, 40), with order swapped allowed.

解答：利用 a × b = gcd(a, b) × lcm(a, b)，得 5 × lcm = 600，所以 lcm = 120。令 a = 5m，b = 5n，其中 gcd(m, n) = 1。则 mn = 600 / 25 = 24，且 lcm(a, b) = 5mn = 5 × 24 = 120，一致。24 的互质因数对为 (1, 24) 与 (3, 8)。因此可能的数对为 (5, 120) 与 (15, 40)，顺序可交换。

The properties of integers — divisibility, primality, parity, modular relationships, and factorisation — are not isolated facts but interconnected tools. Mastering these tools allows you to approach problems with confidence, whether you are simplifying fractions, solving Diophantine equations, or proving a result from first principles. Regular practice with these concepts will build both speed and accuracy in examinations.

整数的性质 — 整除性、素数性、奇偶性、模关系和因数分解 — 并非孤立的事实，而是相互关联的工具。掌握这些工具能让你自信地应对各种问题，无论是化简分数、求解丢番图方程，还是从基本原理出发证明某个结论。经常练习这些概念将显著提升考试中的速度和准确率。

Published by TutorHao | Mathematics Revision Series | aleveler.com

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

Integer Properties and Their Applications | 整数性质及其应用