原书出处
Introduction to Algorithms, Fourth Edition
31 第31章 数论算法
. For example, 3 is a primitive root, modulo 7, but 2 is not a primitive root, modulo 7.
If possesses a primitive root, the group is cyclic. We omit the proof of the following theorem, which is proven by Niven and Zuckerman [345]. Theorem 31.32 The values of n > 1 for which is cyclic are 2, 4, pe, and 2pe, for all primes p > 2 and all positive integers e. ▪ If g is a primitive
root of and a is any element of , then there exists a z such that gz = a (mod n). This z
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter031.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea