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