Wolfram Researchfunctions.wolfram.comOther Wolfram Sites
Search Site
Function CategoriesGraphics GalleryNotationsGeneral IdentitiesAbout This Site ContributeEmail CommentsSign the Guestbook

View Related Information In
The Documentation Center

Download All Formulas For This Function
Mathematica Notebook
PDF File

Download All Introductions For This Function
Mathematica Notebook
PDF File


Developed with Mathematica -- Download a Free Trial Version


Mathematica Notation

Traditional Notation

Integer Functions > GCD[n1,n2,...,nm] > Introduction to the GCD and LCM (greatest common divisor and least common multiple)


The legendary Greek mathematician Euclid (ca. 325–270 BC) suggested an algorithm for finding the greatest common divisor of two integers, which was later named the Euclidean algorithm. This algorithm, as well as computationally refined versions, are in widespread use today.