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