GCF the 48 and 72 is the largest feasible number the divides 48 and also 72 specifically without any type of remainder. The components of 48 and also 72 are 1, 2, 3, 4, 6, 8, 12, 16, 24, 48 and also 1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72 respectively. There room 3 typically used techniques to find the GCF of 48 and also 72 - long division, prime factorization, and also Euclidean algorithm.

You are watching: Greatest common factor of 72 and 48

1.GCF of 48 and 72
2.List the Methods
3.Solved Examples
4.FAQs

Answer: GCF of 48 and 72 is 24.

*

Explanation:

The GCF of two non-zero integers, x(48) and y(72), is the greatest positive essence m(24) the divides both x(48) and also y(72) without any type of remainder.


The methods to uncover the GCF the 48 and 72 are described below.

Using Euclid's AlgorithmPrime administrate MethodLong division Method

GCF the 48 and also 72 through 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.

Here X = 72 and also Y = 48

GCF(72, 48) = GCF(48, 72 mod 48) = GCF(48, 24)GCF(48, 24) = GCF(24, 48 mod 24) = GCF(24, 0)GCF(24, 0) = 24 (∵ GCF(X, 0) = |X|, whereby X ≠ 0)

Therefore, the worth of GCF of 48 and 72 is 24.

GCF of 48 and also 72 by element Factorization

*

Prime administer of 48 and 72 is (2 × 2 × 2 × 2 × 3) and (2 × 2 × 2 × 3 × 3) respectively. As visible, 48 and also 72 have common prime factors. Hence, the GCF the 48 and 72 is 2 × 2 × 2 × 3 = 24.

GCF that 48 and also 72 by lengthy Division

*

GCF of 48 and also 72 is the divisor that we obtain when the remainder becomes 0 after doing long division repeatedly.

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

See more: Ti-84 Invalid Dim Error Messages, What Does Invalid Dim On A Ti

The matching divisor (24) is the GCF of 48 and 72.