0
Euclidean Algorithm
It is not necessary to actually list the factors of all numbers to get the GCF for only two numbers. You can use the Euclidean algorithm.
(1) Divide the larger number by the smaller one.
(2) If there is no remainder, the GCF is the same as the smaller number.
(3) Repeat step 1 with the smaller number and the remainder.
Example:
GCF of 51 and 85.
85/51 = 1 R 34
51/34 = 1 R 17
34/17 = 2 R 0<== By step 2, we are done. Our answer is 17.
Lets try one that doesn't reduce -- GCF(17,39)
39/17 = 2 R 5
17/5 = 3 R 2
5/2 = 2 R 1
2/1 = 2 R 0, so our answer, the GCF, is 1.
Wiki User
∙ 7y ago
Wiki User
∙ 7y agoIf the two numbers are the same then the GCF is the common value. Otherwise:
- find the difference between the larger number and the smaller number.
- replace the larger of the two numbers by this difference.
- if the two numbers are the same then that is the GCF, but if not go back to step 1.
Add your answer:
Earn +20 pts
How do you use the greatest common factor subtraction method?
If you have two numbers A and B, and A > B, then GCF(A, B) = (A-B, B) Thus the problem of finding the GCF of A and B has been reduced to finding the GCF of B and a smaller number, A-B. This process can be continued until the two numbers are the same: and that number is the GCF.
How do you use prime factorization find the GCF of two numbers?
The first step of finding the GCF is to split the numbers into their prime factors. For instance, if I wanted to find the GCF of 30 and 105, I would split these up into: 30 = 2x3x5 105 = 3x5x7 The next step would be to identify any common prime factors. In this case both numbers have 3 and 5 as prime factors, so these would be the ones we use. To find the GCF, you simply multiply these two numbers together: 3x5 = 15 So 15 would be the GCF in that case.
What is the gcf of 75 100 and 175?
It's the same as gcf(gcf(75, 100), 175). In other words, you can first use Euclid's algorithm to find the gcf of 75 and 100; then you can calculate the gcf of the result with 175. To help you get started, by Euclid's algorithm, the gcf of 75 and 100 is the same as the gcf of 75 and 25 (where 25 is the remnainder of the division of 100 / 75).
How do use the distributive property for the gcf of 12 and 72?
It's not necessary. Since 12 is a factor of 72, it is automatically the GCF.
How do you find the gcf of 24 and 36 using distributive property?
Some people use the distributive property to add 24 and 36, but you wouldn't use it to find the GCF which, by the way, is 12.
When do you use GCF and LCM?
Gcf you use when you are finding the greatest factor for the numbers. Lcm you use when you are finding the smallest multiple in the numbers factors
How do you use the greatest common factor subtraction method?
If you have two numbers A and B, and A > B, then GCF(A, B) = (A-B, B) Thus the problem of finding the GCF of A and B has been reduced to finding the GCF of B and a smaller number, A-B. This process can be continued until the two numbers are the same: and that number is the GCF.
What is the gcf of 50 and 54 with method?
The GCF of 50 and 54 is 2. Use whatever method you wish.
How do you use continuous division method to find the GCF of 160?
It doesn't matter what method you use, you need at least two numbers to find a GCF.
How do you use continuous division method to find the gcf of 12 and15?
The gcf is 3.
How does finding the gcf help you solve real world problems?
Finding the LCM will help you add and subtract fractions. Finding the GCF will help you reduce fractions.
What is the GCF of 126 using prime factorization?
You need at least two numbers to find a GCF, whichever method you use.
Can you use euclids formula to generate integers 9, 12, andv15?
im not sure how to answer it
How do you use continuous division method to findthe gcf of 17 and 51?
It works out as 17
How do you use cake method LCM and GCF of 16 35?
Methods aren't necessary. The only common factor (which makes it the GCF) of 16 and 35 is 1.
How would you determine that a factor is the greatest common factor?
If you need to determine the greatest common factor (gcf), there are several methods you can use. By definition it is the largest number that divides all numbers in question.1st method-------------You typically factor each number in its unique prime factorization.You then use only those prime factors that occur in all of these numbers and multiply them.2nd method-------------Another way to compute it is as follows.First determine the gcf of two numbers as follows:gcf(x,y) = gcf(x-y,y) if x>y,gcf(x,y) = gcf(y,y-x) if y>x.gcf(x,y) = x if x=y.Repeat this schema until you found it (using the third line).Then use this to compute the gcf between this found gcf and another number, and so on, i.e.,gcf(x,y,z) = gcf(gcf(x,y),z).Example:----------gcf(60,42)1st method:-------------60 = 2 x 2 x 3 x 542 = 2 x 3 x 7So gcf(60,42) = 2 x 3 = 62nd method:--------------(60,42) = (18,42) = (18, 24) = (18, 6) = (12,6) = (6,6) = 6Exercise.Prove that the second method always gives the same answer as the first method.
What method do we use to find the LCD of two or more fraction?
By finding the lowest common multiple of the denominators.
