Created By : Jatin Gogia
Reviewed By : Rajasekhar Valipishetty
Last Updated : Apr 06, 2023
HCF Calculator using the Euclid Division Algorithm helps you to find the Highest common factor (HCF) easily for 508, 732, 367, 51 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 508, 732, 367, 51 is 1 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 508, 732, 367, 51 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 508, 732, 367, 51 is 1.
HCF(508, 732, 367, 51) = 1
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 508, 732, 367, 51 is 1.
Step 1: Since 732 > 508, we apply the division lemma to 732 and 508, to get
732 = 508 x 1 + 224
Step 2: Since the reminder 508 ≠ 0, we apply division lemma to 224 and 508, to get
508 = 224 x 2 + 60
Step 3: We consider the new divisor 224 and the new remainder 60, and apply the division lemma to get
224 = 60 x 3 + 44
We consider the new divisor 60 and the new remainder 44,and apply the division lemma to get
60 = 44 x 1 + 16
We consider the new divisor 44 and the new remainder 16,and apply the division lemma to get
44 = 16 x 2 + 12
We consider the new divisor 16 and the new remainder 12,and apply the division lemma to get
16 = 12 x 1 + 4
We consider the new divisor 12 and the new remainder 4,and apply the division lemma to get
12 = 4 x 3 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 4, the HCF of 508 and 732 is 4
Notice that 4 = HCF(12,4) = HCF(16,12) = HCF(44,16) = HCF(60,44) = HCF(224,60) = HCF(508,224) = HCF(732,508) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 367 > 4, we apply the division lemma to 367 and 4, to get
367 = 4 x 91 + 3
Step 2: Since the reminder 4 ≠ 0, we apply division lemma to 3 and 4, to get
4 = 3 x 1 + 1
Step 3: We consider the new divisor 3 and the new remainder 1, and apply the division lemma to get
3 = 1 x 3 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 4 and 367 is 1
Notice that 1 = HCF(3,1) = HCF(4,3) = HCF(367,4) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 51 > 1, we apply the division lemma to 51 and 1, to get
51 = 1 x 51 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 1 and 51 is 1
Notice that 1 = HCF(51,1) .
Here are some samples of HCF using Euclid's Algorithm calculations.
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 508, 732, 367, 51?
Answer: HCF of 508, 732, 367, 51 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 508, 732, 367, 51 using Euclid's Algorithm?
Answer: For arbitrary numbers 508, 732, 367, 51 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.