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

You are watching: Greatest common factor of 48 and 72

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

Answer: GCF of 48 and also 72 is 24.

*

Explanation:

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


The methods to discover the GCF that 48 and also 72 are described below.

Using Euclid's AlgorithmPrime factorization MethodLong department Method

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

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|, wherein X ≠ 0)

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

GCF the 48 and 72 by prime Factorization

*

Prime administrate of 48 and 72 is (2 × 2 × 2 × 2 × 3) and also (2 × 2 × 2 × 3 × 3) respectively. Together visible, 48 and 72 have typical prime factors. Hence, the GCF of 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 acquire when the remainder i do not care 0 after doing long division repeatedly.

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

See more: One Quart Equals How Many Fluid Ounces, Quarts To Fluid Ounces Conversion (Qt To Fl Oz)

The equivalent divisor (24) is the GCF that 48 and also 72.