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