Highest Common Factor of 6789, 4044 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, 4044 i.e. 3 the largest integer that leaves a remainder zero for all numbers.
HCF of 6789, 4044 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, 4044 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, 4044 is 3.
HCF(6789, 4044) = 3
HCF of 6789, 4044 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, 4044 is 3.
Highest Common Factor of 6789,4044 is 3
Step 1: Since 6789 > 4044, we apply the division lemma to 6789 and 4044, to get
6789 = 4044 x 1 + 2745
Step 2: Since the reminder 4044 ≠ 0, we apply division lemma to 2745 and 4044, to get
4044 = 2745 x 1 + 1299
Step 3: We consider the new divisor 2745 and the new remainder 1299, and apply the division lemma to get
2745 = 1299 x 2 + 147
We consider the new divisor 1299 and the new remainder 147,and apply the division lemma to get
1299 = 147 x 8 + 123
We consider the new divisor 147 and the new remainder 123,and apply the division lemma to get
147 = 123 x 1 + 24
We consider the new divisor 123 and the new remainder 24,and apply the division lemma to get
123 = 24 x 5 + 3
We consider the new divisor 24 and the new remainder 3,and apply the division lemma to get
24 = 3 x 8 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 3, the HCF of 6789 and 4044 is 3
Notice that 3 = HCF(24,3) = HCF(123,24) = HCF(147,123) = HCF(1299,147) = HCF(2745,1299) = HCF(4044,2745) = HCF(6789,4044) .
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, 4044 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, 4044?
Answer: HCF of 6789, 4044 is 3 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 6789, 4044 using Euclid's Algorithm?
Answer: For arbitrary numbers 6789, 4044 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.