Solution
ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2018/ii/paper-4/40e/a/solution
Past exam of the mathematics course of the University of Cambridge 2018 ii Paper 4 40E a Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-03
Let and . Since ,Hence, for , the even--odd fast Fourier transform recursion isOnly one twiddle-factor multiplication is needed for each value of .
New to topics? Read the docs here!