In my quest to learn more about algorithms, I recently encountered one for deriving the greatest common divisor of two whole numbers. It's called Euclid's Algorithm, named after the "Father of ...

The PSLQ procedure can be regarded as a jazzed-up version of an integer-relation algorithm dating back more than 2,000 years to the Greek geometer Euclid of Alexandria (365–300 B.C.). The Euclidean ...

Day 4 of posting a different algorithm every day until I don't want to anymore: Today's algorithm is Euclid's Algorithm: an ancient (300 BC) method for finding the greatest common divisor of two ...

Euclid's algorithm is a method for finding the greatest common denominator of two numbers through the systematic use of arithmetic. It also has a curious to Fibonacci numbers.Euclid's algorithm is a ...