Engineering↗
Modular Inversion and Simultaneous Inversion
Computing modular inverses, and Montgomery's trick for inverting many elements at the cost of one inversion plus multiplications.
Every page in the KEVOS library tagged Modular Inverse. 3 pages.
Computing modular inverses, and Montgomery's trick for inverting many elements at the cost of one inversion plus multiplications.
Computing Bezout coefficients alongside the GCD, modular inversion as its principal application, and controlling coefficient growth.
The extended Euclidean algorithm, its loop invariants, half-extended variants, modular inversion, and rational reconstruction from a partial remainder sequence.