17 lines
388 B
Plaintext
17 lines
388 B
Plaintext
|
= GCD =
|
||
|
|
|
||
|
|
Greatest common divisor is the multiple that two numbers have in common
|
||
|
|
|
||
|
|
== Extended Euclidean's Algorihtm ==
|
||
|
|
|
||
|
|
Way to find the greatest common divisor of two numbers
|
||
|
|
|
||
|
|
* Theorm
|
||
|
|
- If m,n are relatively prime then n has an inverse mod m
|
||
|
|
* n^-1 = b mod m
|
||
|
|
- Where a,b are any integer solutions to
|
||
|
|
* a * m = b * n = 1 mod m
|
||
|
|
- and b would be a modular inverse of n
|
||
|
|
|
||
|
|
[[index]]
|