Lean formalisation of Shallit and Sorenson's left-shift binary GCD algorithm.
-
Updated
Oct 22, 2026 - Lean
#
binary-gcd
Here are 5 public repositories matching this topic...
University homework assignments rewritten in rust as well as testing
testing homework modular-arithmetic gcd homework-exercises lcm extended-gcd greatest-common-divisor euclidean-algorithm least-common-multiple binary-gcd
-
Updated
Dec 8, 2024 - Rust
Compute the greatest common divisor (gcd).
nodejs javascript node math euclid stdlib mathematics gcm gcd node-js euclidean hcf gcf greatest-common-divisor stein binary-gcd greatest-common-factor highest-common-factor greatest-common-measure highest-common-divisor
-
Updated
Oct 18, 2026 - JavaScript
A Comparison between different greatest common divisor algorithms: Euclidian GCD, Extended Euclidian GCD, Binary GCD recursive, and Binary GCD non-recursive.
-
Updated
Dec 31, 2021 - Jupyter Notebook
Compute the greatest common divisor (gcd).
nodejs javascript node math euclid stdlib mathematics gcm gcd node-js euclidean hcf gcf greatest-common-divisor stein binary-gcd greatest-common-factor highest-common-factor greatest-common-measure highest-common-divisor
-
Updated
Nov 5, 2026 - JavaScript
Add this topic to your repo
To associate your repository with the binary-gcd topic, visit your repo's landing page and select "manage topics."