| This then becomes the divisor to determine the piece count from the weight of an unknown quantity of countable parts. |
| Prior to publishing, he also found an upper bound on the least prime divisor of an odd perfect number. |
| Euclid's Elements is full of algorithms for geometry, including one to find the greatest common divisor of two numbers. |
| Any positive divisor of n is a product of prime divisors of n raised to some power. |
| The first, Proposition 2 of Book VII, is a procedure for finding the greatest common divisor of two whole numbers. |
| His famous Euclidean algorithm, when applied to a pair of natural numbers, leads in a finite number of steps to their greatest common divisor. |
