Calculadora de MCD (Máximo Común Divisor)

Find the greatest common factor (GCF/GCD/HCF) of any set of numbers with complete step-by-step solutions.

Examples:
Enter 2 to 10 positive integers.
Individual Numbers (2)
#1
#2
Greatest Common Factor
12
GCF(24, 36)
Status:Common Divisors Exist
Least Common Multiple (LCM)
72

Smallest multiple shared by all input values.

GCF × LCM = 864
Fraction Simplification
24/36
2/3

Dividing numerator & denominator by GCF (12) yields simplest form.

Divisor applied: ÷ 12
Euclidean Division Steps

The Euclidean algorithm repeatedly executes integer division with remainder: A = B × Quotient + Remainder. The last non-zero remainder is the GCF.

Computing GCD of 36 and 24Result: 12
StepDivision Equation (A = B × Q + R)Remainder (R)
Step 136 = 24 × 1 + 1212
Step 224 = 12 × 2 + 00 (Terminated)
Therefore, the Greatest Common Factor of 24, 36 is 12.

About the Calculadora de MCD (Máximo Común Divisor)

The Greatest Common Factor (GCF) — also widely recognized as the Greatest Common Divisor (GCD) or Highest Common Factor (HCF) — is the largest positive integer that divides two or more integers without leaving a remainder. Whether you are reducing complex fractions to simplest terms, solving algebraic polynomials, factoring quadratic expressions, or distributing items into equal groups, our high-precision GCF calculator provides instant results alongside four comprehensive mathematical solution methods: the Euclidean Algorithm, Prime Factorization, the Listing Divisors method, and Common Division.

How to Use This Calculator

  1. 1Enter your integers separated by commas or spaces in the quick input bar (e.g., 24, 36, 60), or use the distinct number boxes.
  2. 2Click "Add Number" if you need to calculate the GCF of 3, 4, or up to 10 numbers simultaneously.
  3. 3View the primary GCF result card, coprime status indicator, complementary Least Common Multiple (LCM), and reduced fraction equivalent.
  4. 4Explore the interactive Solution Tabs below to see the exact step-by-step arithmetic: Euclidean Division steps, Prime Factorization exponent trees, or the complete factor listing.
  5. 5Use the one-click copy button to copy the final answer or mathematical explanation to your clipboard.

Formula & Calculation Methodology

There are four primary mathematical approaches to computing the GCF: 1. The Euclidean Algorithm (Division Method): Based on the principle that the greatest common divisor of two integers a and b (with a > b) is identical to the greatest common divisor of b and the remainder r = a mod b: gcd(a, b) = gcd(b, a mod b) Repeated divisions are executed until the remainder becomes zero. The last non-zero divisor is the GCF. For three or more numbers, the algorithm is associative: gcd(a, b, c) = gcd(gcd(a, b), c). 2. Prime Factorization Method: Deconstruct each integer into its unique prime powers: a = p₁^a₁ × p₂^a₂ × ... b = p₁^b₁ × p₂^b₂ × ... The GCF is formed by taking only the shared prime factors, each raised to the minimum exponent found across all numbers: GCF = ∏ p_i^min(a_i, b_i) 3. Listing Factors (Divisors): Enumerate all integer divisors for every number, identify the intersection set of common factors, and choose the maximum element. 4. Relation with LCM: For any two positive integers a and b: GCF(a, b) × LCM(a, b) = a × b Therefore: GCF(a, b) = (a × b) / LCM(a, b)

Worked Example: Finding the GCF of 54 and 24 with Euclidean Algorithm & Prime Factorization

Scenario: A woodworking carpenter has two wooden planks measuring 54 inches and 24 inches. What is the longest equal length each plank can be cut into without any leftover scrap wood?

Method 1 (Euclidean Algorithm): Step 1: 54 ÷ 24 = 2 remainder 6 → 54 = 24 × 2 + 6
Quotient 2, Remainder 6
Method 1 (Euclidean Algorithm): Step 2: 24 ÷ 6 = 4 remainder 0 → 24 = 6 × 4 + 0
Remainder is 0; the last non-zero divisor is 6.
Method 2 (Prime Factorization): Decompose 54: 54 = 2 × 3 × 3 × 3 = 2¹ × 3³
Primes of 54: 2¹ × 3³
Method 2 (Prime Factorization): Decompose 24: 24 = 2 × 2 × 2 × 3 = 2³ × 3¹
Primes of 24: 2³ × 3¹
Method 2: Take minimum powers of shared primes: Common primes: 2^min(1,3) × 3^min(3,1) = 2¹ × 3¹ = 2 × 3
GCF = 6 inches
Conclusion: The Greatest Common Factor of 54 and 24 is 6. The carpenter can cut both planks into equal 6-inch segments (yielding 9 segments from the first plank and 4 from the second) with zero waste.

Assumptions & Practical Limitations

  • GCF is defined strictly for integers. Non-integer floating point numbers are automatically rounded to the nearest integer.
  • Negative integers share the exact same divisors as their absolute counterparts: GCF(-a, b) = GCF(a, b). This calculator evaluates positive integers.
  • If the only common factor between numbers is 1, the numbers are termed "coprime" or "relatively prime" (e.g., 9 and 28).
  • Division by zero is undefined. GCF(a, 0) = |a| for non-zero a.

Frequently Asked Questions

There is zero mathematical difference. GCF (Greatest Common Factor) is standard in American primary and secondary education. GCD (Greatest Common Divisor) is preferred in advanced mathematics and computer science. HCF (Highest Common Factor) is the standard terminology throughout the UK, India, Australia, and Commonwealth nations.