GCF the 18 and also 30 is the largest feasible number the divides 18 and 30 exactly without any kind of remainder. The components of 18 and also 30 space 1, 2, 3, 6, 9, 18 and 1, 2, 3, 5, 6, 10, 15, 30 respectively. There room 3 typically used methods to discover the GCF of 18 and 30 - Euclidean algorithm, element factorization, and also long division.

You are watching: What is the greatest common factor of 18 and 30

1. | GCF the 18 and also 30 |

2. | List the 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 also y(30), is the biggest positive integer m(6) that divides both x(18) and also y(30) without any remainder.

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

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

GCF the 18 and 30 is the divisor the we get when the remainder i do not care 0 after doing long department repeatedly.

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

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

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

### GCF of 18 and 30 by Listing usual Factors

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

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

There are 4 typical 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 also 30 by Euclidean Algorithm

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

See more: Design A Synthesis Of 2-Butanone From Ethyne., Butan−2−One From Ethyne

Here X = 30 and also Y = 18

GCF(30, 18) = GCF(18, 30 mod 18) = GCF(18, 12)GCF(18, 12) = GCF(12, 18 mode 12) = GCF(12, 6)GCF(12, 6) = GCF(6, 12 mode 6) = GCF(6, 0)GCF(6, 0) = 6 (∵ GCF(X, 0) = |X|, wherein X ≠ 0)Therefore, the value of GCF that 18 and 30 is 6.