← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

31 第31章 数论算法

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

ing an integer a is [a]n = {a + kn : k ∈ ℤ}. For example, [3]7 = {…, –11, –4, 3, 10, 17, …

}, and [–4]7 and [10]7 also denote this set. With the notation defined on page 64, writing a ∈ [b]n is the same as writing a = b (mod n). The set of all such equivalence classes is When you see the definition you should read it

as equivalent to equation (31.1) with the understanding that 0 represents [0]n, 1 represe

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea