dsa4 min read
GCD, LCM, and Extended Euclidean Algorithm
Master GCD/LCM with Euclidean algorithm O(log n) and the Extended Euclidean for modular inverse computation.
Read →
webcoderspeed.com
1 articles
Master GCD/LCM with Euclidean algorithm O(log n) and the Extended Euclidean for modular inverse computation.