Skip to main content

So berechnen Sie Gcf

learn.whatIsHeading

The Greatest Common Factor (GCF), also called Greatest Common Divisor (GCD), is the largest positive integer that divides both numbers without a remainder. It is used to simplify fractions and solve equations.

Schritt-für-Schritt-Anleitung

  1. 1Euclidean Algorithm: repeatedly divide, then swap: GCF(a,b) = GCF(b, a mod b)
  2. 2Continue until remainder = 0
  3. 3The last non-zero remainder is the GCF

Gelöste Beispiele

Eingabe
GCF(48, 18)
Ergebnis
6
48=6×8, 18=6×3
Eingabe
GCF(100, 75)
Ergebnis
25
GCF(100,75)=GCF(75,25)=GCF(25,0)=25

Einstellungen