An example should illustrate the process. Find the common factor of 38 and 14.
Dividing 38 by 14 gives a remainder of 10. Repeat with the smaller two numbers.
14 divide by 10 gives a remainder of 4.
10 divided by 4 gives a remainder of 2.
4 divided by 2 gives a remainder of 0.
The last non-zero number is the greatest common factor. In this case, 2.
The distributive property states that for nonzero values a and b and c, (a+b)/c = a/c + b/c
You can factor some numbers quickly by examining their digits. For example, the number 609 is obviously divisible by 3, because
600 / 3 = 200
9 / 3 = 3
So 609 = 3 x 203
This will not provide all of the prime factors, but it reduces the work required.
Get the greatest common factor first. For example, you might use Euclid's Algorithm - the first step is that the greatest common factor of 5030 and 100 is the same as the greatest common factor of 100 and 30 (where 30 is the remainder of the division of 5030 / 100). Once you get the greatest common factor, the common factors of the two numbers are simply all the factors of this greatest common factor.
The greatest common factor (GCF) refers to a factor that is COMMON to two or more numbers. You have only one number in the question! The greatest factor of any number is itself. So you do not need to use the division ladder or any other method!
The same as the greatest common factor for 77 and 7, where 7 is the remainder of the division of 161 by 77.
The GCF of 81 and 117 is 9.
You can't have the greatest common factor of just one number - for it to be common there needs to be at least 2 numbers.
The greatest common factor of 170 and 210 is 10
Same as the greatest common factor of 19 and 18 - where 18 is the remainder of the division of 94 by 19.
The same as the greatest common factor of 72 and 24 (24 is the remainder of the division of 96 / 72).
No.
That's the same as the greatest common factor of 28 and 10 (where 10 is the remainder of the division of 738 / 28).
Same as the greatest common factor of 50 and 20 - where 20 is the remainder of the division of 70 by 50.
Get the greatest common factor first. For example, you might use Euclid's Algorithm - the first step is that the greatest common factor of 5030 and 100 is the same as the greatest common factor of 100 and 30 (where 30 is the remainder of the division of 5030 / 100). Once you get the greatest common factor, the common factors of the two numbers are simply all the factors of this greatest common factor.
The greatest common factor (GCF) refers to a factor that is COMMON to two or more numbers. You have only one number in the question! The greatest factor of any number is itself. So you do not need to use the division ladder or any other method!
Same as the greatest common factor of 33 and 22 - where 22 is calculated as the remainder of the division of 154 by 33 (this is known as Euclid's algorithm).
The same as the greatest common factor for 77 and 7, where 7 is the remainder of the division of 161 by 77.
The GCF is 3.
The greatest factor that two or more numbers have in common is known as the greatest common factor, or GCF.