Links to this page
Edit this page
Entry portal
Advice For New Users

The greatest common divisor (gcd), also called the greatest common factor (gcf) or highest common factor (hcf), of two whole numbers is the largest number that divides into both numbers without a remainder.

The Gcd can be found using the Euclidean Algorithm.

Related to the Lcm.

Links to this page / Page history / Last change to this page
Recent changes / Edit this page (with sufficient authority)
All pages / Search / Change password / Logout