What is GCD (Greatest Common Divisor)?

GCD is the largest number that divides both input numbers without leaving a remainder. For example, GCD(12, 18) = 6, because 6 divides both 12 and 18.

What is LCM (Least Common Multiple)?

LCM is the smallest number that is a multiple of both input numbers. For example, LCM(12, 18) = 36, because 36 is the smallest number divisible by both 12 and 18.

What is the Euclidean algorithm?

The Euclidean algorithm is an efficient method to compute GCD by repeatedly dividing and taking remainders: GCD(a, b) = GCD(b, a mod b) until b = 0. It is much faster than prime factorization for large numbers.

How are GCD and LCM related?

They are related by the formula: GCD(a, b) × LCM(a, b) = a × b. This identity is useful for computing LCM once GCD is known.

What is GCD of two coprime numbers?

Coprime numbers (also called relatively prime) have a GCD of 1, meaning they share no common factors other than 1. For example, GCD(7, 11) = 1.

Kalkulator KPK dan FPB

Kalkulator KPK dan FPB gratis. Temukan KPK dan FPB dari dua atau lebih bilangan bulat.

Hitung Kelipatan Persekutuan terKecil (KPK) dan Faktor Persekutuan terBesar (FPB).

GCD (a, b) = Euclidean algorithm; LCM (a, b) = \frac{a \times b}{GCD ( a , b )}

Kalkulator terkait

Kalkulator Faktorisasi Prima

Uraikan bilangan bulat menjadi faktor-faktor primanya.

Kalkulator Faktorial — n! untuk Bilangan Bulat

Hitung faktorial dari bilangan bulat 0 sampai 170, termasuk bilangan besar.

Kalkulator Kombinasi dan Permutasi

Hitung kombinasi C(n,k) dan permutasi P(n,k) dengan mudah.

Kalkulator Persentase

Hitung persentase dari nilai apa pun — kenaikan, penurunan, perbandingan.