answersLogoWhite

0

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).

User Avatar

Wiki User

13y ago

Still curious? Ask our experts.

Chat with our AI personalities

DevinDevin
I've poured enough drinks to know that people don't always want advice—they just want to talk.
Chat with Devin
RossRoss
Every question is just a happy little opportunity.
Chat with Ross
ViviVivi
Your ride-or-die bestie who's seen you through every high and low.
Chat with Vivi
More answers

The GCF of 12 and 64 is 4.

User Avatar

Wiki User

8y ago
User Avatar

GCF of 12 and 64 is 4.

User Avatar

Wiki User

14y ago
User Avatar

GCF(64, 12) = 4

User Avatar

Wiki User

13y ago
User Avatar

Add your answer:

Earn +20 pts
Q: What is the greatest common factor of 12 and 64?
Write your answer...
Submit
Still have questions?
magnify glass
imp