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

You are watching: What is the gcf of 18 and 30

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

Answer: GCF that 18 and also 30 is 6.

*

Explanation:

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


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

Long department MethodListing typical FactorsUsing Euclid's Algorithm

GCF that 18 and 30 by lengthy Division

*

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

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

The corresponding divisor (6) is the GCF that 18 and also 30.

GCF the 18 and 30 through Listing typical Factors

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

There are 4 typical factors that 18 and also 30, that room 1, 2, 3, and 6. Therefore, the greatest typical factor of 18 and also 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 also mod is the modulo operator.

See more: How Many Neutrons Are There In A Chromium Atom With A Mass Number Of 54 ?

Here X = 30 and also Y = 18

GCF(30, 18) = GCF(18, 30 mode 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|, wherein X ≠ 0)

Therefore, the value of GCF the 18 and 30 is 6.