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