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 1612, 5836, 18928 i.e. 4 the largest integer that leaves a remainder zero for all numbers.
HCF of 1612, 5836, 18928 is 4 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 1612, 5836, 18928 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 1612, 5836, 18928 is 4.
HCF(1612, 5836, 18928) = 4
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 1612, 5836, 18928 is 4.
Step 1: Since 5836 > 1612, we apply the division lemma to 5836 and 1612, to get
5836 = 1612 x 3 + 1000
Step 2: Since the reminder 1612 ≠ 0, we apply division lemma to 1000 and 1612, to get
1612 = 1000 x 1 + 612
Step 3: We consider the new divisor 1000 and the new remainder 612, and apply the division lemma to get
1000 = 612 x 1 + 388
We consider the new divisor 612 and the new remainder 388,and apply the division lemma to get
612 = 388 x 1 + 224
We consider the new divisor 388 and the new remainder 224,and apply the division lemma to get
388 = 224 x 1 + 164
We consider the new divisor 224 and the new remainder 164,and apply the division lemma to get
224 = 164 x 1 + 60
We consider the new divisor 164 and the new remainder 60,and apply the division lemma to get
164 = 60 x 2 + 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 1612 and 5836 is 4
Notice that 4 = HCF(12,4) = HCF(16,12) = HCF(44,16) = HCF(60,44) = HCF(164,60) = HCF(224,164) = HCF(388,224) = HCF(612,388) = HCF(1000,612) = HCF(1612,1000) = HCF(5836,1612) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 18928 > 4, we apply the division lemma to 18928 and 4, to get
18928 = 4 x 4732 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 4, the HCF of 4 and 18928 is 4
Notice that 4 = HCF(18928,4) .
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 1612, 5836, 18928?
Answer: HCF of 1612, 5836, 18928 is 4 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 1612, 5836, 18928 using Euclid's Algorithm?
Answer: For arbitrary numbers 1612, 5836, 18928 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.