answersLogoWhite

0

An algorithm isn't necessary in this case. The factors of 4 are 1, 2 and 4 and the factors of 6 are 1, 2, 3 and 6. Just by looking at them we can tell that the common factors are 1 and 2 and that the greatest of these is 2.

User Avatar

Wiki User

12y ago

What else can I help you with?

Related Questions

How do you redce fractions?

To reduce a fraction, you divide both the numerator (top number) and the denominator (bottom number) by their greatest common divisor (GCD). First, determine the GCD of the two numbers, which can be found using methods like listing factors or the Euclidean algorithm. Once you have the GCD, divide both the numerator and denominator by this number to simplify the fraction to its lowest terms. For example, to reduce 8/12, the GCD is 4; dividing both by 4 gives you 2/3.


What is the GCD of 4 and 5?

GCD(4, 5) = 1.


What is the GCD of 360 and 364?

GCD: 4


What is the gcd of 4 and 20?

The Greatest Common Divisor (GCD) for 4 20 is 4


What is the greatest common factor for 14 and 56?

since 14 = 14 x 1 and 56 = 14 x 4 the answer is 14, since it divides evenly into both and clearly nothing larger will.There is a clever algorithm that can help you work this out in the general case:GCD(14, 56) = GCD(14, 56 - 14) = GCD(14, 42)This step (subtract the smaller from the larger) relies on the fact that any number that divides both 14 and 56 also divides 56 - 14.Repeat this:GCD(14, 42) = GCD(14, 42 - 14) = GCD(14, 28)GCD(14, 28) = GCD(14, 28 - 14) = GCD(14, 14)which is clearly 14.This is called Euclid's Algorithm.


What is the GCD of 8 and 12?

Greatest Common Divisor (GCD) for 12 8 is 4.


What is the GCD of 12 and 40?

GCD(12, 40) = 4


How do you simplify 4 and 8?

To simplify the numbers 4 and 8, you can find their greatest common divisor (GCD), which is 4. Dividing both numbers by their GCD, you get 4 ÷ 4 = 1 and 8 ÷ 4 = 2. Therefore, the simplified form of 4 and 8 is 1 and 2, respectively.


Gcd of 4 and 8?

4


What is the GCD of 4?

two


What is the LCM of 42 and 7?

The LCM of any two numbers can be found with the following formula:LCM(a,b) = (ab) / GCD (a,b).The GCD of two numbers is best found with the Euclidean algorithm which is as follows:GCD(a,b) =a --if b = 0or GCD(b, a mod b) otherwiseIn the example given we have GCD(42,7) = GCD(7, 0) = 7Then LCM(42,7) = (7*42)/7 = 42Note: mod is the operation of dividing one number by another and taking the remainder. e.g. 7 mod 4 = 3, 12 mod 6 = 0.


What is the GCD of 36 and 20?

The Greatest Common Divisor (GCD) for 36 20 is 4.