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

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

Get This Quote & Author's Image Illustrated On:

Click any product to generate a realistic preview (~30s). Up to 3 at a time.

Details

Euclidean Algorithm, Book VII of 'Elements'

Date: c. 300 BCE

Inspirational

Verification

Unverifiable

Found in 1 providers: grok

1 source checked

Your Cart

Your cart is empty