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.
Loading
Please register or sign in to comment