Skip to main content
Calkulon

Matematikk

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

Detaljert guide kommer snart

Vi jobber med en omfattende veiledning for Forenkle Brøker. Kom tilbake snart for trinnvise forklaringer, formler, eksempler fra virkeligheten og eksperttips.

💡

Pro Tips

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.

Vanskelighetsgrad:Middels

Visste 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
Nøyaktig
Verifiserte formler
Øyeblikkelig
Resultater med én gang
📱
Mobilevennlig
Alle enheter

Innstillinger

PersonvernVilkårOm© 2026 Calkulon