Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2018/ii/paper-4/40e/a/solution

Let and . Since ,
Hence, for , the even--odd fast Fourier transform recursion is
Only one twiddle-factor multiplication is needed for each value of .

New to topics? Read the docs here!