原书出处
Introduction to Algorithms, Fourth Edition
31 第31章 数论算法
he d positions for which ax mod n = b are the solutions of the equation ax = b (mod n). ▪
Theorem 31.23 Let d = gcd(a, n), and suppose that d = ax′ + ny′ for some integers x′ and y′ (for example, as computed by EXTENDED-EUCLID). If d | b, then the equation ax = b (mod n) has as one of its solutions the value x0, where x0 = x′(b/d) mod n. Proof We have ax0 = ax′(b/d) (mod n) = d(b/d)
(mod n) (because ax′ = d (mod n)) = b (mod n), and thus x0 is a solution to ax = b (mod n
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter031.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea