Talk:Greatest common divisor

Article Checklist for "Greatest common divisor"

Workgroup category or categories	Mathematics Workgroup [Categories OK]
Article status	Developing article: beyond a stub, but incomplete
Underlinked article?	No
Basic cleanup done?	Yes
Checklist last edited by	Catherine Woodgold

To learn how to fill out this checklist, please see CZ:The Article Checklist.

---

Example is redundant

Oops, maybe I shouldn't have put in an example of Euclid's algorithm, since such an example is already given on the Euclid's algorithm page. --Catherine Woodgold 08:38, 13 May 2007 (CDT)

Why so complicate?

$60=2^{2}\times 3^{1}\times 5^{1}$

$72=2^{3}\times 3^{2}\times 5^{0}$

So for the gcd you have take take the smallest exponents: :$\operatorname {gcd} (60,72)=2^{2}\times 3^{1}\times 5^{0}=4\times 3=12$

lcm is similar: You have to take the gratest exponents: :$\operatorname {lcm} (60,72)=2^{3}\times 3^{2}\times 5^{1}=8\times 9\times 5=360$

--arbol01 19:01, 15 July 2007 (CDT)