← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

31 第31章 数论算法

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

n/d, observe that there are exactly n/d multiples of d between 0 and n – 1, inclusive. ▪

Corollary 31.21 The equation ax = b (mod n) is solvable for the unknown x if and only if d | b, where d = gcd(a, n). Proof The equation ax = b (mod n) is solvable if and only if [b] ∈ 〈a〉, which is the same as saying (b mod n) ∈ {0, d, 2d,

…, ((n/d) – 1)d}, by Theorem 31.20. If 0 ≤ b < n, then b ∈ 〈a〉 if and only if d | b, sinc

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea