原书出处
Introduction to Algorithms, Fourth Edition
31 第31章 数论算法
mod n), since b and b mod n differ by a multiple of n, which is itself a multiple of d. ▪
Corollary 31.22 The equation ax = b (mod n) either has d distinct solutions modulo n, where d = gcd(a, n), or it has no solutions. Proof If ax = b (mod n) has a solution, then b ∈ 〈a〉. By Theorem 31.17, ord(a) = |〈a〉|, and so Corollary 31.18 and Theorem 31.20 imply that the sequence ai mod n, for i = 0, 1,
…, is periodic with period |〈a〉| = n/d. If b ∈ 〈a〉, then b appears exactly d times in the
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter031.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea