Euclid's Division Lemma Prime Factorisation Calculator Factors of a Number Calculator LCM Calculator GCF Calculator Factor Tree Calculator LCM of Decimals LCM of Fractions GCF of Decimals GCF of Fractions

Highest Common Factor of 36, 48, 60, 108 using Euclid's algorithm

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

HCF of 36, 48, 60, 108 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 36, 48, 60, 108 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 36, 48, 60, 108 is 12.

HCF(36, 48, 60, 108) = 12

HCF of 36, 48, 60, 108 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 36, 48, 60, 108 is 12.

Highest Common Factor of 36,48,60,108 using Euclid's algorithm

Step 1: Since 48 > 36, we apply the division lemma to 48 and 36, to get

48 = 36 x 1 + 12

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

36 = 12 x 3 + 0

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

Notice that 12 = HCF(36,12) = HCF(48,36) .


We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma

Step 1: Since 60 > 12, we apply the division lemma to 60 and 12, to get

60 = 12 x 5 + 0

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

Notice that 12 = HCF(60,12) .


We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma

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

108 = 12 x 9 + 0

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

Notice that 12 = HCF(108,12) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 36, 48, 60, 108 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 36, 48, 60, 108?

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

3. How to find HCF of 36, 48, 60, 108 using Euclid's Algorithm?

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