GCF that 48 and 72 is the largest possible number that divides 48 and 72 specifically without any kind of remainder. The determinants 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 room 3 commonly used techniques to uncover the GCF of 48 and also 72 - long division, prime factorization, and 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 of 48 and also 72 is 24.

**Explanation: **

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

The approaches to discover the GCF the 48 and 72 are explained below.

Using Euclid's AlgorithmPrime administrate MethodLong department Method### GCF of 48 and also 72 through Euclidean Algorithm

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

Here X = 72 and also Y = 48

GCF(72, 48) = GCF(48, 72 mode 48) = GCF(48, 24)GCF(48, 24) = GCF(24, 48 mod 24) = GCF(24, 0)GCF(24, 0) = 24 (∵ GCF(X, 0) = |X|, where X ≠ 0)Therefore, the worth of GCF the 48 and 72 is 24.

### GCF the 48 and also 72 by prime Factorization

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

### GCF of 48 and 72 by long Division

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

**Step 2:**because the remainder ≠ 0, we will certainly divide the divisor of action 1 (48) through the remainder (24).

**Step 3:**Repeat this procedure until the remainder = 0.

See more: How Many Seconds In One Day ? How Many Seconds Are In A 24 Hour Day

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