Skip to main content
DigiCalcs

learn.howToCalculate

learn.whatIsHeading

The Greatest Common Factor (GCF), also called Greatest Common Divisor (GCD), is the largest integer that divides two or more numbers exactly. Used in simplifying fractions, finding common denominators, and solving Diophantine equations.

Przewodnik krok po kroku

  1. 1Prime factorization method: factor each number, take common prime factors with lowest powers
  2. 2Euclidean algorithm: GCF(a,b) = GCF(b, a mod b), repeat until remainder is 0
  3. 3GCF(a,b) × LCM(a,b) = a × b
  4. 4GCF of two primes is always 1 (they share no common factors)

Rozwiązane przykłady

Wejście
GCF(48, 18)
Wynik
6
48=2⁴×3, 18=2×3² → GCF=2×3=6
Wejście
GCF(100, 75)
Wynik
25
100/25=4, 75/25=3, both exact

Gotowy do obliczeń? Wypróbuj darmowy kalkulator GCF

Spróbuj sam →

Ustawienia