Update for 05-11-21 14:45
This commit is contained in:
parent
df2fbe1147
commit
eb2b3fc1da
@ -2,3 +2,13 @@
|
||||
|
||||
The Euclidean Algorithm is an algorithm for finding the inverse of a number
|
||||
when working within a modulo.
|
||||
|
||||
Steps, represented as psuedo code (for A^-1 = (mod m))
|
||||
|
||||
{{{
|
||||
lhs = m
|
||||
rhs = A
|
||||
|
||||
|
||||
|
||||
}}}
|
||||
|
Loading…
Reference in New Issue
Block a user