The greatest common divisor of two numbers can be found by successive division.
— Euclid Ancient

Father of geometry

Share:

Details

Context

Euclidean Algorithm, Book VII of 'Elements'

Date / Period

c. 300 BCE

Source

https://en.wikipedia.org/wiki/Euclidean_algorithm

Verification

Unverifiable

Explanation

Found in 1 providers: grok

Method

Cross Reference

Sources Checked

1 source

Get This Quote on Merchandise

Premium quality, printed on demand. Ships worldwide.

Don't see what you're looking for? Email us for custom products