Overview

Euclid's algorithm


Show Summary Details

Quick Reference

An algorithm for finding the greatest common divisor of two integers, m and n. If m > n divide m by n and let r be the remainder. If r = 0 then n is the answer; otherwise apply the same algorithm to the integers n and r.

Subjects: Mathematics.


Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.