extended-euclidean-algorithm 0.1.1

This library computes the greatest common divisor of 2 natural numbers and 2 additional numbers such that gcd(a,b)=s·a+t·b holds.
Documentation 
1
2
3
4
5
6
7

# This file is automatically @generated by Cargo.
# It is not intended for manual editing.
version = 3

[[package]]
name = "extended-euclidean-algorithm"
version = "0.1.1"