Combinatorics #2-ex2 April 25, 2026 5 min readCyclic ConvolutionCyclic convolution definition, FFT/NTT implementation for n=2^k, zero-padding, why n must be a power of two, and the fold-back technique for arbitrary n.#math#combinatorics#fft#ntt#convolution
