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.
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.
You need at least two numbers to find a GCF.
You don't; you need at least two numbers to find a GCF.
To find a pair of numbers with a given GCF, take the GCF number and double it. The pair of numbers is the GCF, and two times the GCF. For instance, two numbers with a GCF of 3 are 3 and 6.
You need at least two numbers to find a 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.
You need at least two numbers to find a GCF.
You need at least two numbers to find a GCF.
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. The GCF of 21 and 42 is 21.