GCF the 18 and 30 is the largest possible number the divides 18 and 30 specifically without any remainder. The determinants of 18 and 30 are 1, 2, 3, 6, 9, 18 and 1, 2, 3, 5, 6, 10, 15, 30 respectively. There are 3 generally used approaches to discover the GCF the 18 and also 30 - Euclidean algorithm, prime factorization, and long division.

You are watching: What factors do 18 and 30 have in common

1. | GCF the 18 and 30 |

2. | List of Methods |

3. | Solved Examples |

4. | FAQs |

**Answer:** GCF of 18 and 30 is 6.

**Explanation: **

The GCF of two non-zero integers, x(18) and y(30), is the greatest positive integer m(6) the divides both x(18) and also y(30) without any kind of remainder.

Let's look in ~ the different methods for finding the GCF the 18 and 30.

Long department MethodListing usual FactorsUsing Euclid's Algorithm### GCF the 18 and also 30 by lengthy Division

GCF of 18 and 30 is the divisor that we gain when the remainder becomes 0 after ~ doing long division repeatedly.

**Step 2:**since the remainder ≠ 0, we will certainly divide the divisor of action 1 (18) through the remainder (12).

**Step 3:**Repeat this process until the remainder = 0.

The equivalent divisor (6) is the GCF the 18 and 30.

### GCF of 18 and also 30 through Listing common Factors

**Factors that 18:**1, 2, 3, 6, 9, 18

**Factors of 30:**1, 2, 3, 5, 6, 10, 15, 30

There space 4 common factors the 18 and 30, that space 1, 2, 3, and also 6. Therefore, the greatest common factor that 18 and 30 is 6.

### GCF the 18 and 30 by Euclidean Algorithm

As per the Euclidean Algorithm, GCF(X, Y) = GCF(Y, X mode Y)where X > Y and mod is the modulo operator.

See more: 1997 Polaris Sportsman 400 4X4 2 Stroke, 1997 Polaris Sportsman 400L (W97Ac38C) Oem Parts

Here X = 30 and also Y = 18

GCF(30, 18) = GCF(18, 30 mod 18) = GCF(18, 12)GCF(18, 12) = GCF(12, 18 mod 12) = GCF(12, 6)GCF(12, 6) = GCF(6, 12 mod 6) = GCF(6, 0)GCF(6, 0) = 6 (∵ GCF(X, 0) = |X|, whereby X ≠ 0)Therefore, the worth of GCF that 18 and also 30 is 6.