Skip to content
Snippets Groups Projects
Commit b8494214 authored by dario.genga's avatar dario.genga
Browse files

Update modular_inverse and modulo.

The modulo method now works with negative numbers.

Also added a egcd method to get the greatest common divisor of a
and b by using the euclidean division.

Also added comments to all methods.
parent bca19965
No related branches found
No related tags found
Loading
Loading
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment