to calculate the greatest common divisor
gcd-cli tools for managing and using GCD. GCD stands for GitChangeDirectory, as it primary goal is to quickly change between git project folders.
A fork of cargo-snippet that added bundle and more snippet feature
Fast parallel bulk GCD computation for finding weak RSA keys in a set
The binary Euclidean algorithm for computing gcd.
Encoder and decoder for GCD files
A snippet extractor for competitive programmers
Arbitrary-precision integers for OxiNum (UBig/IBig via dashu-int)
Async task dispatch via Grand Central Dispatch
Calculate the greatest common divisor
Utility-first arithmetic primitives for RustUse
An algorithmically faster implementation of variadic GCD.
In mathematics, the greatest common divisor (gcd) of two or more integers, when at least one of them is not zero, is the largest positive integer that divides the numbers without a remainder.
Detects GCD of two integers using Euclids algorithm. Adaption of original palindrome gem
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.