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