Highest Common Factor of 861, 4979 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 861, 4979 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 861, 4979 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 861, 4979 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 861, 4979 is 1.
HCF(861, 4979) = 1
HCF of 861, 4979 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 861, 4979 is 1.
Highest Common Factor of 861,4979 is 1
Step 1: Since 4979 > 861, we apply the division lemma to 4979 and 861, to get
4979 = 861 x 5 + 674
Step 2: Since the reminder 861 ≠ 0, we apply division lemma to 674 and 861, to get
861 = 674 x 1 + 187
Step 3: We consider the new divisor 674 and the new remainder 187, and apply the division lemma to get
674 = 187 x 3 + 113
We consider the new divisor 187 and the new remainder 113,and apply the division lemma to get
187 = 113 x 1 + 74
We consider the new divisor 113 and the new remainder 74,and apply the division lemma to get
113 = 74 x 1 + 39
We consider the new divisor 74 and the new remainder 39,and apply the division lemma to get
74 = 39 x 1 + 35
We consider the new divisor 39 and the new remainder 35,and apply the division lemma to get
39 = 35 x 1 + 4
We consider the new divisor 35 and the new remainder 4,and apply the division lemma to get
35 = 4 x 8 + 3
We consider the new divisor 4 and the new remainder 3,and apply the division lemma to get
4 = 3 x 1 + 1
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 861 and 4979 is 1
Notice that 1 = HCF(3,1) = HCF(4,3) = HCF(35,4) = HCF(39,35) = HCF(74,39) = HCF(113,74) = HCF(187,113) = HCF(674,187) = HCF(861,674) = HCF(4979,861) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 861, 4979 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 861, 4979?
Answer: HCF of 861, 4979 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 861, 4979 using Euclid's Algorithm?
Answer: For arbitrary numbers 861, 4979 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.
