📐

Greatest Common Factor (GCF

Math Free Instant Private
Math

### Discrete Mathematics & Number Theory: GCF vs. LCM The Greatest Common Factor (GCF)—also called the Greatest Common Divisor (GCD) or Highest Common Factor (HCF)—is the largest positive integer...

Reviewed by Miss Saima · MA Mathematics
Last updated:
Editorial Guidelines

⚙ Input Values

📊 Results

Primary GCF & LCM Result
GCF(48, 72, and 120) = 24 | LCM = 720
Greatest Common Factor (GCF / GCD / HCF)
24
Least Common Multiple (LCM)
720
Prime Factorization: Number A
48 = 2^4 × 3
Prime Factorization: Number B
72 = 2^3 × 3^2
Prime Factorization: Number C
120 = 2^3 × 3 × 5
All Positive Common Factors (Divisors)
{ 1, 2, 3, 4, 6, 8, 12, 24 } (8 common divisors)
✦ Number Theory & Euclidean Algorithm Diagnostic
Number Theory: The Greatest Common Factor (GCF/GCD/HCF) of 48, 72, and 120 is 24. The Least Common Multiple (LCM) is 720. All positive common divisors: { 1, 2, 3, 4, 6, 8, 12, 24 }. Prime factorizations: 48 = 2^4 × 3; 72 = 2^3 × 3^2; 120 = 2^3 × 3 × 5.
Embed on Your Website

Copy and paste this code into your website.

<iframe src="https://calcusolve.com/calculator/greatest-common-factor-calculator?embed=true" width="100%" height="600" frameborder="0" loading="lazy" title="Greatest Common Factor (GCF"></iframe>

📐 Formula

Euclidean algorithm & prime factorization formulas for GCF and LCM: Division: a = b × q + r (a, b) = (b, r) between GCF and LCM: LCM(a, b) = (|a × b| ÷ GCF)(a, b) Numbers: GCF(a, b, c) = GCF(GCF(a, b), c) Numbers: LCM(a, b, c) = LCM(LCM(a, b), c)

💡 Practical Example

✅

For example, finding the GCF and LCM of 48, 72, and 120: Prime factorizations are \, \, and \. The Greatest Common Factor is \. The Least Common Multiple is \. The set of all common divisors is { 1, 2, 3, 4, 6, 8, 12, 24 }.

📖 About Greatest Common Factor (GCF

Discrete Mathematics & Number Theory: GCF vs. LCM

The Greatest Common Factor (GCF)—also called the Greatest Common Divisor (GCD) or Highest Common Factor (HCF)—is the largest positive integer that divides evenly into two or more given numbers without a remainder.

Methods to Find GCF

  • The Euclidean Algorithm: Repeatedly taking the remainder \ until the remainder reaches zero. This is the fastest algorithmic method.
  • Prime Factorization Method: Express each number as a product of prime numbers, then take the minimum power of all shared prime factors.

How to Use This Calculator

Enter your First Integer (Number A) (e.g. 48), Second Integer (Number B) (e.g. 72), and Third Integer (Number C, Optional - set 0 to ignore) (e.g. 120 (or 0)). Results update instantly as you type — adjust any value to compare scenarios.

The Formula

Euclidean algorithm & prime factorization formulas for GCF and LCM: Division: a = b · q + r (a, b) = (b, r) between GCF and LCM: LCM(a, b) = (|a × b|) / (GCF(a, b)) Numbers: GCF(a, b, c) = GCF(GCF(a, b), c) Numbers: LCM(a, b, c) = LCM(LCM(a, b), c)

Worked Example

For example, finding the GCF and LCM of 48, 72, and 120: Prime factorizations are and . The Greatest Common Factor is . The Least Common Multiple is . The set of all common divisors is 1, 2, 3, 4, 6, 8, 12, 24 .

Understanding Your Result

Unit conversion precision: round to the same number of significant figures as your original measurement. Converting 6 feet to meters gives 1.8288 m — but if your measurement was approximate (±1 inch), expressing more than 2 decimal places is false precision. For international trade and technical specifications, SI units (meters, kilograms, liters) are the standard. US customary units (feet, pounds, gallons) differ from Imperial UK units: 1 US gallon = 3.785 L vs. 1 UK gallon = 4.546 L.

💡 Mathematical Rigor & Applied Context

  • This calculator applies exact mathematical definitions following conventions established by NIST and international standards bodies.
  • Rounding errors accumulate across multi-step calculations. For precision-critical work, maintain extra significant figures through all intermediate steps.
  • Many mathematical concepts have multiple valid formulations — if a result seems unexpected, verify which convention or definition applies to your context.
  • Dimensional analysis (unit tracking) is the fastest way to catch formula errors. Every term in an equation must have consistent, compatible units.
  • Numerical methods used in digital calculators introduce floating-point precision limits (~15 significant digits for IEEE 754 double precision).
  • For statistical and probabilistic calculations, always specify whether you are working with population parameters or sample statistics — formulas differ.
  • Visualizing a problem geometrically or testing with known boundary values (zero, infinity, negative) reveals hidden errors faster than algebraic checking.
  • When in doubt, validate your result against a simplified hand calculation or a published worked example from a textbook or standards document.

Results are for informational and educational purposes only. Always verify critical decisions with a qualified professional.

❓ Frequently Asked Questions

What is the Greatest Common Factor (GCF)?

The GCF is the largest positive integer that divides two or more non-zero integers with zero remainder (e.g., GCF of 12 and 18 is 6).

What is the difference between GCF and LCM?

The GCF is the largest factor that divides into the numbers. The LCM (Least Common Multiple) is the smallest positive integer that is a multiple of all the numbers.

How do you find the GCF of two numbers using the Euclidean algorithm?

Divide the larger number by the smaller number and find the remainder. Replace the larger number with the smaller, and the smaller with the remainder. Repeat until remainder is 0; the last non-zero remainder is the GCF.

What does it mean if the GCF of two numbers is 1?

If GCF(a, b) = 1, the two numbers are 'coprime' or 'relatively prime' (e.g., 8 and 9 share no factors other than 1).

Can the GCF be negative?

By mathematical convention, the GCF is always defined as a positive integer, regardless of whether the input numbers are positive or negative.

Try Other Calculators