Skip to main content
Calkulon

Matematik

Förenkla Bråk

Variabelbeskrivning

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

Detaljerad guide kommer snart

Vi arbetar på en omfattande utbildningsguide för Förenkla Bråk. Kom tillbaka snart för steg-för-steg-förklaringar, formler, verkliga exempel och experttips.

💡

Proffstips

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årighetsgrad:Medel

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
Korrekt
Verifierade formler
Omedelbar
Resultat direkt
📱
Mobilanpassad
Alla enheter

Inställningar

IntegritetVillkorOm© 2026 Calkulon