原书出处
Introduction to Algorithms, Fourth Edition
31 第31章 数论算法
uclid’s algorithm for computing greatest common divisors relies on the following theorem.
Theorem 31.9 (GCD recursion theorem) For any nonnegative integer a and any positive integer b, gcd(a, b) = gcd(b, a mod b). Proof We will show that gcd(a, b) and gcd(b, a mod b) divide each other. Since they are both nonnegative, equation (31.5) then implies that they must be equal. We first show that gcd(a, b)
| gcd(b, a mod b). If we let d = gcd(a, b), then d | a and d | b. By equation (3.11) on p
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter031.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea