原书出处
Introduction to Algorithms, Fourth Edition
31 第31章 数论算法
ors The notion of one integer being divisible by another is key to the theory of numbers.
The notation d | a (read “d divides a”) means that a = kd for some integer k. Every integer divides 0. If a > 0 and d | a, then |d| ≤ |a|. If d | a, then we also say that a is a multiple of d. If d does not divide a, we write d ∤ a. If d | a and d ≥ 0, then d is a divisor of a
. Since d | a if and only if –d | a, without loss of generality, we define the divisors of
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter031.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea