原书出处
Introduction to Algorithms, Fourth Edition
31 第31章 数论算法
hose proof is omitted, provides an extremely useful constraint on the size of a subgroup.
Theorem 31.15 (Lagrange’s theorem) If (S, ⊕) is a finite group and (S′, ⊕) is a subgroup of (S, ⊕), then |S′| is a divisor of |S|. ▪ A subgroup S′ of a group S is a proper subgroup if S′ ≠ S. We’ll use the following corollary in the analysis in Section 31.8 of the Miller-Rabin
primality test procedure. Corollary 31.16 If S′ is a proper subgroup of a finite group S,
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter031.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea