Skip to main content
Calkulon

Matematik

Forenkle Brøker

Variabelbeskrivelse

a/b= fraction to simplifyGCD= greatest common divisor

Simplify a fraction

Divide both by their greatest common divisor.

Finding the GCD (Euclidean Algorithm)

Repeatedly divide until remainder is 0.

Step 1
Stop when

Detaljeret guide kommer snart

Vi arbejder på en omfattende uddannelsesguide til Forenkle Brøker. Kom snart tilbage for trin-for-trin forklaringer, formler, eksempler fra virkeligheden og eksperttips.

💡

Pro Tip

Quick check: if both numbers are even, divide both by 2. Keep doing this until at least one is odd. Then check for other common factors.

Sværhedsgrad:Mellemliggende

Vidste du?

Euclid's algorithm for finding the GCF (and thus simplifying fractions) is one of the oldest algorithms still in use — it appears in Euclid's Elements written around 300 BC.

Mathematically verified
Reviewed May 2026
Used 45K+ times
Our methodology
🔒
100% Gratis
Ingen registrering
Præcis
Verificerede formler
Øjeblikkelig
Resultater med det samme
📱
Mobilvenlig
Alle enheder

Indstillinger

PrivatlivVilkårOm© 2026 Calkulon