← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

30 第30章 多项式与快速傅里叶变换

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.756Z

such that ωn = 1. There are exactly n complex nth roots of unity: e2πik/n for k = 0, 1, …

, n − 1. To interpret this formula, use the definition of the exponential of a complex number: eiu = cos(u) + i sin(u). Figure 30.2 shows that the n

complex roots of unity are equally spaced around the circle of unit radius centered at th

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter030.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea