Concepts2
∑MathIntermediate
Linear Diophantine Equations
A linear Diophantine equation ax + by = c has integer solutions if and only if gcd(a, b) divides c.
#linear diophantine#extended euclidean algorithm#gcd+12
⚙️AlgorithmAdvanced
FFT (Fast Fourier Transform)
FFT converts a polynomial from coefficients to values at the n-th roots of unity in O(n log n) time, enabling fast multiplication via pointwise products.
#fft#polynomial multiplication#convolution+11