Skip to main content
Calkulon

Matematika

Sederhanakan Pecahan

Hitung

Pecahan 1

/
Coba:

Keterangan variabel

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

Panduan lengkap segera hadir

Kami sedang menyiapkan panduan edukasi lengkap untuk Sederhanakan Pecahan. Kembali lagi segera untuk penjelasan langkah demi langkah, rumus, contoh nyata, dan tips ahli.

💡

Tip 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.

Kesulitan:Menengah

Tahukah Anda?

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
Tanpa registrasi
Akurat
Formula terverifikasi
Instan
Hasil langsung
📱
Ramah mobile
Semua perangkat

Pengaturan

PrivasiKetentuanTentang© 2026 Calkulon