What is the greatest common factor of 12 and 64?

GCF of two or more numbers can be found using Euclid's Division Lemma.

Euclid's Division Lemma: For any two numbers a and b(a>b) we can say a = bq+r.

Applying Euclid's Division Lemma to 64 and 12: 64 = 12 x 5 + 4

Since the remainder is not equal to zero we apply the division lemma to the divisor 12 and the remainder 4:

12 = 4 x 3 + 0

The last divisor is 4, which is the GCF(12,64).