learn.howToCalculate

learn.whatIsHeading

The Greatest Common Factor (GCF), also called Greatest Common Divisor (GCD), is the largest positive integer that divides both numbers without a remainder. It is used to simplify fractions and solve equations.

Hướng dẫn từng bước

1. 1Euclidean Algorithm: repeatedly divide, then swap: GCF(a,b) = GCF(b, a mod b)
2. 2Continue until remainder = 0
3. 3The last non-zero remainder is the GCF

Ví dụ có lời giải