vimwiki/math/modular_inverse.wiki

27 lines
431 B
Plaintext
Raw Normal View History

2021-11-05 18:15:01 +00:00
= Modular Inverse =
A modular inverse is an _x_ such that satisfies the equation of form
A * x = (mod m)
This is derived from a statement in form
A^-1 (mod m)
This is due to the nature of modular operations, and can be shown via the
following set of steps.
A^-1 = 1/A
A * x = 1
x = 1/A
Therefore, via substiution
A * x = (mod m)
This means that x will be the inverse of A
To solve this, see the [[euclidean_algorithm]]