Skip to main content
Calkulon

Matemáticas

Simplificar Fracciones

Leyenda de variables

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

Guía detallada próximamente

Estamos preparando una guía educativa completa para el Simplificar Fracciones. Vuelve pronto para ver explicaciones paso a paso, fórmulas, ejemplos prácticos y consejos de expertos.

💡

Consejo Pro

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.

Dificultad:Intermedio

¿Sabías que?

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
Sin registro
Preciso
Fórmulas verificadas
Instantáneo
Resultados al instante
📱
Compatible móvil
Todos los dispositivos

Configuración