euclid

Here are 4 public repositories matching this topic...

calculate the multiplicative inverse of a number (however large) using Euclid's Extended Division Lemma

euclid modular-arithmetic inverse

GCD/HCF in two Algorithms; (a) Trial and Error Algorithm (b) Euclid's Algorithm. Both written in C.

c algorithm euclid

C: Euclid's GCD algorithm

c euclid gcd

The Euclidean Algorithm finds the greatest common factor of two inputted integers

c euclid

Add a description, image, and links to the euclid topic page so that developers can more easily learn about it.

To associate your repository with the euclid topic, visit your repo's landing page and select "manage topics."