Euclidean Algorithm

A set of rules which when applied to two integers produces their common divisor.

This method is used for finding remainders by multiplying the divisor by the quotient and subtracting that amount from the number being divided.

Example:

when finding the remainder for 33 divided by 4, the quotient is 8, so one multiplies 8 times 4 (giving 32) and then subtracts 32 from 33, leaving 1 as the remainder.

See also: Algorithm.

Previous PageView links to and from this pageNext Page

Subjects: Mathematics