全部书籍

专业

应用 关于 Coach 登录 开始阅读

书籍暂未推出简体中文版——当前显示英文版。

Mathematics · 术语表

什么是 Least common multiple?

Definition 6.10 University Mathematics — Year 1 · 第 6 章 — Integer Arithmetic

lcm⁡(a,b)\operatorname{lcm}(a, b) is the generator in N\N of the subgroup aZ∩bZa\Z \cap b\Z: it is a common multiple of aa and bb that divides every common multiple, and for a,b∈N∗a, b \in \N^*,

gcd⁡(a,b)×lcm⁡(a,b)=ab(proof in Exercise 6.5).\gcd(a,b) \times \operatorname{lcm}(a,b) = ab \qquad (\text{proof in } \text{Exercise 6.5}).

示例

Example 6.11 (Alignment problems are lcm problems)

Two meshed gears have 8484 and 3636 teeth. After how many teeth of common motion do they return to their initial position together? The configuration repeats when the number of elapsed teeth is a common multiple of 8484 and 3636; the first time is

lcm⁡(84,36)=84×36gcd⁡(84,36)=302412=252\operatorname{lcm}(84, 36) = \frac{84 \times 36}{\gcd(84, 36)} = \frac{3024}{12} = 252

teeth — that is, 33 turns of the large gear and 77 of the small one (252/84252/84 and 252/36252/36). Note the practical route: compute the gcd first (Euclid: 84=2×36+1284 = 2\times36 + 12, 36=3×1236 = 3\times12), then divide — never build the lcm by listing multiples. Every periodic-coincidence question (gears, planetary alignments, repeating decimals meeting) reduces to this one computation.

在原文中阅读 →