Highest Common Factor of 2436, 8912, 76098 using Euclid's algorithm
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 2436, 8912, 76098 i.e. 2 the largest integer that leaves a remainder zero for all numbers.
HCF of 2436, 8912, 76098 is 2 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 2436, 8912, 76098 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 2436, 8912, 76098 is 2.
HCF(2436, 8912, 76098) = 2
HCF of 2436, 8912, 76098 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 2436, 8912, 76098 is 2.
Highest Common Factor of 2436,8912,76098 is 2
Step 1: Since 8912 > 2436, we apply the division lemma to 8912 and 2436, to get
8912 = 2436 x 3 + 1604
Step 2: Since the reminder 2436 ≠ 0, we apply division lemma to 1604 and 2436, to get
2436 = 1604 x 1 + 832
Step 3: We consider the new divisor 1604 and the new remainder 832, and apply the division lemma to get
1604 = 832 x 1 + 772
We consider the new divisor 832 and the new remainder 772,and apply the division lemma to get
832 = 772 x 1 + 60
We consider the new divisor 772 and the new remainder 60,and apply the division lemma to get
772 = 60 x 12 + 52
We consider the new divisor 60 and the new remainder 52,and apply the division lemma to get
60 = 52 x 1 + 8
We consider the new divisor 52 and the new remainder 8,and apply the division lemma to get
52 = 8 x 6 + 4
We consider the new divisor 8 and the new remainder 4,and apply the division lemma to get
8 = 4 x 2 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 4, the HCF of 2436 and 8912 is 4
Notice that 4 = HCF(8,4) = HCF(52,8) = HCF(60,52) = HCF(772,60) = HCF(832,772) = HCF(1604,832) = HCF(2436,1604) = HCF(8912,2436) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 76098 > 4, we apply the division lemma to 76098 and 4, to get
76098 = 4 x 19024 + 2
Step 2: Since the reminder 4 ≠ 0, we apply division lemma to 2 and 4, to get
4 = 2 x 2 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 2, the HCF of 4 and 76098 is 2
Notice that 2 = HCF(4,2) = HCF(76098,4) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 2436, 8912, 76098 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 2436, 8912, 76098?
Answer: HCF of 2436, 8912, 76098 is 2 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 2436, 8912, 76098 using Euclid's Algorithm?
Answer: For arbitrary numbers 2436, 8912, 76098 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.