Greatest Common Divisor

Return to Glossary.

Formal Definition


Let r and s be two positive integers. The positive generator d of the cyclic group $H=\{nr+ms|n,m\in\mathbb{Z}\}$ under addition is the greatest common divisor (abbreviated gcd) of r and s. We write $d=\gcd(r,s)$.

Informal Definition


The greatest common divisor (or GCD) between two numbers is a number that is both a common factor between the them and also the largest of the common factors.

Example(s)


The greatest common divisor of 42 and 72 is 6.

Non-example(s)


  • The GCD of 50 and 25 is not 5. Even though 5 is a common factor between the two integers, it is not the largest.

Additional Comments


Add any other comments you have about the term here

Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License