GCF the 18 and also 48 is the largest possible number the divides 18 and 48 specifically without any remainder. The factors of 18 and also 48 are 1, 2, 3, 6, 9, 18 and 1, 2, 3, 4, 6, 8, 12, 16, 24, 48 respectively. There space 3 frequently used techniques to find the GCF the 18 and 48 - Euclidean algorithm, prime factorization, and long division.

You are watching: Find the greatest common factor of 18 and 48

 1 GCF that 18 and 48 2 List that Methods 3 Solved Examples 4 FAQs

Answer: GCF that 18 and also 48 is 6. Explanation:

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

The techniques to uncover the GCF of 18 and also 48 are described below.

Long department MethodUsing Euclid's AlgorithmListing common Factors

### GCF of 18 and also 48 by lengthy Division GCF of 18 and also 48 is the divisor that we acquire when the remainder i do not care 0 ~ 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 procedure until the remainder = 0.

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

### GCF the 18 and also 48 by Euclidean Algorithm

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

Here X = 48 and Y = 18

GCF(48, 18) = GCF(18, 48 mod 18) = GCF(18, 12)GCF(18, 12) = GCF(12, 18 mode 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 of 18 and 48 is 6.

See more: What Colors Make Brown? How Do You Make Tan Paint ? How To Make A Tan Color From Paint

### GCF of 18 and also 48 through Listing common Factors Factors of 18: 1, 2, 3, 6, 9, 18Factors of 48: 1, 2, 3, 4, 6, 8, 12, 16, 24, 48

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