← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

31 第31章 数论算法

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.759Z

d for ·n as they were for +n in the proof of Theorem 31.12. The identity element is [1]n.

To show the existence of inverses, let a be an element of and let (d, x, y) be returned by EXTENDED-EUCLID(a, n). Then we have d = 1, since , and or equivalently, ax = 1 (mod n). Thus [x]n is a multiplicative inverse of [a]n, modulo n. Furthermore, we claim that . To see why, equation (31.20) demonstrates that the smallest positive

linear combination of x and n must be 1. Therefore, Theorem 31.2 implies that gcd(x, n) =

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter031.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea