原书出处
Introduction to Algorithms, Fourth Edition
31 第31章 数论算法
any integers x and y, Also, if a | b, then either |a| ≤ |b| or b = 0, which implies that
The greatest common divisor of two integers a and b which are not both 0, denoted by gcd(a, b), is the largest of the common divisors of a and b. For example, gcd(24, 30) = 6, gcd(5, 7) = 1, and gcd(0, 9) = 9. If a and b are both nonzero, then gcd(a, b) is an integer between 1 and min {|a|, |b|}. We define gcd(0, 0) to be 0, so that standard
properties of the gcd function (such as equation (31.9) below) hold universally. Exercise
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter031.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea