GCF the 18 and also 30 is the largest possible number that divides 18 and 30 precisely without any remainder. The factors of 18 and 30 are 1, 2, 3, 6, 9, 18 and also 1, 2, 3, 5, 6, 10, 15, 30 respectively. There space 3 commonly used methods to find the GCF of 18 and also 30 - Euclidean algorithm, prime factorization, and long division.

You are watching: What are the common factors of 18 and 30

1.GCF the 18 and also 30
2.List that Methods
3.Solved Examples
4.FAQs

Answer: GCF the 18 and 30 is 6.

*

Explanation:

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


Let's look in ~ the various methods for finding the GCF that 18 and also 30.

Long department MethodListing usual FactorsUsing Euclid's Algorithm

GCF of 18 and also 30 by long Division

*

GCF the 18 and also 30 is the divisor the we obtain when the remainder becomes 0 after doing long department repeatedly.

Step 2: because the remainder ≠ 0, we will divide the divisor of step 1 (18) by the remainder (12).Step 3: Repeat this process until the remainder = 0.

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

GCF the 18 and 30 by Listing usual Factors

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

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

GCF the 18 and 30 by Euclidean Algorithm

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

See more: Charleston To Myrtle Beach Distance Between Charleston And Myrtle Beach, Sc

Here X = 30 and 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 value of GCF that 18 and also 30 is 6.