There are two main methods: prime factorisation and repeated differencing (Euclid's method).
Prime factorisation: this requires each number to be expressed as a product of their prime factors. The prime factorisations are compared to find common factors. The GCF is the product of these factors.
Euclid's method: this involves replacing the larger of the two numbers by the difference between the two numbers. Repeat with the new pair. You will either reach a point where the two numbers are the same - which is the GCF - or reach 1 in which case the numbers are coprime.
Chat with our AI personalities
Example: 30 and 42
Factor them.
2 x 3 x 5 = 30
2 x 3 x 7 = 42
Select the common factors.
2 x 3 = 6, the GCF
You need at least two numbers to find a GCF. If that's 72 and 96, the GCF is 24.
You need at least two numbers to find a GCF.
You need at least two numbers to find a GCF. If that's 16 and 66, the GCF is 2.
You need at least two numbers to find a GCF.
You need at least two numbers to find a GCF.