Fast Fourier Transform (FFT)
A radix-2 FFT guide: DFT normalization, butterfly decomposition, polynomial convolution, and the limits of floating-point integer results.
Reviewed articles explicitly assigned to Mathematics. Only articles published in English appear here.
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.
A proof of the max-flow min-cut theorem using residual reachability, with a concrete flow-and-cut certificate.
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.
Learn feasible flows, residual forward and reverse arcs, augmenting paths, cut bounds, and when Ford–Fulkerson terminates.
De Moivre's formula for positive, zero, and negative integer powers, proved with Euler's formula and illustrated by a cube calculation.