原书出处
Introduction to Algorithms, Fourth Edition
31 第31章 数论算法
uniquely factored into a product of primes. Exercise 31.1-11 asks you to provide a proof.
Theorem 31.8 (Unique prime factorization) There is exactly one way to write any composite integer a as a product of the form where the pi are prime, p1 < p2 <
… < pr, and the ei are positive integers. ▪ As an example, the unique prime factorization
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter031.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea