Concepts2
∑MathAdvanced
Primitive Roots
A primitive root modulo n is a number g that cycles through all units modulo n when you repeatedly multiply by g, so its multiplicative order equals \(\varphi(n)\).
#primitive root#multiplicative order#euler totient+10
⚙️AlgorithmAdvanced
NTT (Number Theoretic Transform)
The Number Theoretic Transform (NTT) is an FFT-like algorithm that performs discrete convolutions exactly using modular arithmetic instead of floating-point numbers.
#ntt#number theoretic transform#polynomial multiplication+11