Fast Fourier Transform (FFT)
A radix-2 FFT guide: DFT normalization, butterfly decomposition, polynomial convolution, and the limits of floating-point integer results.
9 articles.
A radix-2 FFT guide: DFT normalization, butterfly decomposition, polynomial convolution, and the limits of floating-point integer results.
A proof that every bounded sequence in finite-dimensional Euclidean space has a convergent subsequence, with the compactness distinction.
The monotone convergence theorem for real sequences, proved from the least-upper-bound property and illustrated with examples.
The nested interval theorem: completeness gives a common point, while shrinking interval lengths make it unique.
A grouped reference to algebraic, metric, order, completeness, and limit concepts used across introductory analysis.
A compact, grouped reference to 19 foundational ideas in sets, algebraic structures, functions, and cardinality, with examples.
Why the gcd of two integers is an integer linear combination, with a least-positive-combination proof and the field-only polynomial analogue.
A proof and worked trace of the Euclidean algorithm, including its nonnegative-input C++ implementation and logarithmic step count.
Archived technical note: Codeforces Global Round 19 B. MEX and Array.