| Prior to publishing, he also found an upper bound on the least prime divisor of an odd perfect number. |
| It is possible to use short division for problems having more than one digit in the divisor. |
| Euclid's Elements is full of algorithms for geometry, including one to find the greatest common divisor of two numbers. |
| He gives the reader the same method of dividing fractions as taught in schools today, namely invert the divisor and multiply. |
| We will now see how to find the greatest common divisor and the lowest common multiple of two numbers from their prime factorizations. |
| But Zu would know how to reduce fractions to their lowest terms by dividing top and bottom by the greatest common divisor. |
