原书出处
Introduction to Algorithms, Fourth Edition
30 第30章 多项式与快速傅里叶变换
Corollary 30.4 For any even integer n > 0, Proof The proof is left as Exercise 30.2-1. ▪
Lemma 30.5 (Halving lemma) If n > 0 is even, then the squares of the n complex nth roots of unity are the n/2 complex (n/2)th roots of unity. Proof By the cancellation lemma, for any nonnegative integer k. Squaring all of the complex nth roots of unity produces each (n/2)th root of unity exactly twice, since Thus and have the same square. We could also have used Corollary 30.4
to prove this property, since implies , and thus . ▪ As we’ll see, the halving lemma is e
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter030.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea