# Highest Common Factor of 108, 24 using Euclid's algorithm

HCF Calculator using the Euclid Division Algorithm helps you to find the Highest common factor (HCF) easily for 108, 24 i.e. 12 the largest integer that leaves a remainder zero for all numbers.

HCF of 108, 24 is 12 the largest number which exactly divides all the numbers i.e. where the remainder is zero. Let us get into the working of this example.

Consider we have numbers 108, 24 and we need to find the HCF of these numbers. To do so, we need to choose the largest integer first and then as per Euclid's Division Lemma a = bq + r where 0 ≤ r ≤ b

Highest common factor (HCF) of 108, 24 is 12.

HCF(108, 24) = 12

## HCF of 108, 24 using Euclid's algorithm

Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.

HCF of:

Highest common factor (HCF) of 108, 24 is 12.

### Highest Common Factor of 108,24 using Euclid's algorithm

Step 1: Since 108 > 24, we apply the division lemma to 108 and 24, to get

108 = 24 x 4 + 12

Step 2: Since the reminder 24 ≠ 0, we apply division lemma to 12 and 24, to get

24 = 12 x 2 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 12, the HCF of 108 and 24 is 12

Notice that 12 = HCF(24,12) = HCF(108,24) .

### HCF using Euclid's Algorithm Calculation Examples

Here are some samples of HCF using Euclid's Algorithm calculations.

### Frequently Asked Questions on HCF of 108, 24 using Euclid's Algorithm

1. What is the Euclid division algorithm?

Answer: Euclid's Division Algorithm is a technique to compute the Highest Common Factor (HCF) of given positive integers.

2. what is the HCF of 108, 24?

Answer: HCF of 108, 24 is 12 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 108, 24 using Euclid's Algorithm?

Answer: For arbitrary numbers 108, 24 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.