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.

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