Liking cljdoc? Tell your friends :D
All platforms.
emmy.euclid
Implementations of various greatest common divisor algorithms.
Implementations of various [greatest common divisor](https://en.wikipedia.org/wiki/Greatest_common_divisor) algorithms.
extended-gcdclj/s
(extended-gcd a b)Returns a vector containing the greatest common
divisor and
the Bézout coefficients
corresponding to the inputs a and b.
For more info, see the Wikipedia article on the Extended Euclidean algorithm.
Returns a vector containing the [greatest common divisor](https://en.wikipedia.org/wiki/Greatest_common_divisor) and the [Bézout coefficients](https://en.wikipedia.org/wiki/Bézout%27s_identity) corresponding to the inputs `a` and `b`. For more info, see the Wikipedia article on the [Extended Euclidean algorithm](http://en.wikipedia.org/wiki/Extended_Euclidean_algorithm).
gcdclj/s
(gcd a b)Returns the greatest common
divisor of the two
inputs a and b.
Returns the [greatest common divisor](https://en.wikipedia.org/wiki/Greatest_common_divisor) of the two inputs `a` and `b`.
cljdoc is a website building & hosting documentation for Clojure/Script libraries
× close