原书出处
Introduction to Algorithms, Fourth Edition
31 第31章 数论算法
at 7−1 = 13 (mod 15), since 7 · 13 = 91 = 1 (mod 15), so that 2/7 = 2 · 13 = 11 (mod 15).
The size of is denoted ϕ(n). This function, known as Euler’s phi function, satisfies the equation so that p runs over all the primes dividing n (including n itself, if n is prime). We won’t prove this formula here. Intuitively, begin with a list of the n remainders {0, 1,
…, n – 1} and then, for each prime p that divides n, cross out every multiple of p in the
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter031.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea