原书出处
Introduction to Algorithms, Fourth Edition
31 第31章 数论算法
for this refinement. We omit the proof (but see, for example, Niven and Zuckerman [345]).
Theorem 31.1 (Division theorem) For any integer a and any positive integer n, there exist unique integers q and r such that 0 ≤ r < n and a = qn + r. ▪ The value q = ⌊a/n⌋ is the quotient of the division. The value r = a mod n is the remainder (or residue) of the division, so that n | a if and only if
a mod n = 0. The integers partition into n equivalence classes according to their remaind
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter031.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea