GCF that 48 and 72 is the largest possible number that divides 48 and also 72 precisely without any type of remainder. The factors of 48 and also 72 are 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 are 3 commonly used techniques to discover the GCF the 48 and 72 - long division, prime factorization, and also Euclidean algorithm.

You are watching: What is the gcf of 48 and 72

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

Answer: GCF the 48 and also 72 is 24.

*

Explanation:

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


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

Using Euclid's AlgorithmPrime administrate MethodLong department Method

GCF of 48 and also 72 by Euclidean Algorithm

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

Here X = 72 and Y = 48

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

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

GCF of 48 and 72 by element Factorization

*

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

GCF of 48 and 72 by long Division

*

GCF the 48 and 72 is the divisor that we gain 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 action 1 (48) by the remainder (24).Step 3: Repeat this procedure until the remainder = 0.

See more: What Does The Green Light Mean Ing, The Great Gatsby: Central Idea Essay

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