← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

31 第31章 数论算法

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.758Z

orization An elementary but important fact about divisibility by primes is the following.

Theorem 31.7 For all primes p and all integers a and b, if p | ab, then p | a or p | b (or both). Proof Assume for the purpose of contradiction that p | ab, but that p ∤ a and p ∤ b. Because p > 1 and ab = kp for some k ∈ ℤ, equation (31.10) gives that gcd(ab, p) = p. We also have that gcd(a, p) = 1 and gcd(b, p) = 1, since the only

divisors of p are 1 and p, and we assumed that p divides neither a nor b. Theorem 31.6 th

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter031.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea