← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

31 第31章 数论算法

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

tain Euler’s theorem and specialize it to , where p is prime, to obtain Fermat’s theorem.

Theorem 31.30 (Euler’s theorem) For any integer n > 1, ▪ Theorem 31.31 (Fermat’s theorem) If p is prime, then Proof By equation (31.22), ϕ(p) = p – 1 if p is prime. ▪ Fermat’s theorem applies to every element in ℤp except 0, since . For all a ∈ ℤp, however, we have ap = a (mod p) if p is prime. If , then every element in is a power of g, modulo n, and g is a primitive root or a generator of . For example,

3 is a primitive root, modulo 7, but 2 is not a primitive root, modulo 7. If possesses a

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea