Study guides

☆☆

Q: How do you use continuous division method to find the gcf of 9 and 12?

Write your answer...

Submit

Still have questions?

Continue Learning about Other Math

5

division ladder for 12,16,28 and the gcf of all them

No matter what you use, you still need at least two numbers to find a GCF.

By Euclid's algorithm, it is the same as the gcf of 45787 and 24088 (the latter is the remainder of the division of 69875 by 45787).

9

Related questions

The gcf is 3.

It doesn't matter what method you use, you need at least two numbers to find a GCF.

The GCF is 7.The LCM is 70.

34

It works out as 17

The GCF of consecutive integers is 1.

The GCF is 9.

It is: 15

Basically, you repeatedly calculate the remainder of a division, and use it for the next step, with the smaller of the two original numbers. Here is an example: gcf(14, 10) = gcf(10, 4) (4 is the remainder of the division of 14 / 10). gcf (10, 4) = gcf(4, 2) (2 is the remainder of the division of 10 / 2). gcf (4, 2) = gcf(2, 0) (0 is the remainder of the division of 4 / 2). gcf(2, 0) = 2 (if one of the numbers is 0, the gcf is the other number).

To start, factor 195 and 299 into prime factors: 195 = 3*5*13 299 = 13*23 13 is the only shared factor, so it is the GCF.

Since 9 is a factor of 27, it is automatically the GCF.

You need at least two numbers to find a GCF whatever method you use.

People also asked