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 6780, 9739 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 6780, 9739 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 6780, 9739 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 6780, 9739 is 1.
HCF(6780, 9739) = 1
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 6780, 9739 is 1.
Step 1: Since 9739 > 6780, we apply the division lemma to 9739 and 6780, to get
9739 = 6780 x 1 + 2959
Step 2: Since the reminder 6780 ≠ 0, we apply division lemma to 2959 and 6780, to get
6780 = 2959 x 2 + 862
Step 3: We consider the new divisor 2959 and the new remainder 862, and apply the division lemma to get
2959 = 862 x 3 + 373
We consider the new divisor 862 and the new remainder 373,and apply the division lemma to get
862 = 373 x 2 + 116
We consider the new divisor 373 and the new remainder 116,and apply the division lemma to get
373 = 116 x 3 + 25
We consider the new divisor 116 and the new remainder 25,and apply the division lemma to get
116 = 25 x 4 + 16
We consider the new divisor 25 and the new remainder 16,and apply the division lemma to get
25 = 16 x 1 + 9
We consider the new divisor 16 and the new remainder 9,and apply the division lemma to get
16 = 9 x 1 + 7
We consider the new divisor 9 and the new remainder 7,and apply the division lemma to get
9 = 7 x 1 + 2
We consider the new divisor 7 and the new remainder 2,and apply the division lemma to get
7 = 2 x 3 + 1
We consider the new divisor 2 and the new remainder 1,and apply the division lemma to get
2 = 1 x 2 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 6780 and 9739 is 1
Notice that 1 = HCF(2,1) = HCF(7,2) = HCF(9,7) = HCF(16,9) = HCF(25,16) = HCF(116,25) = HCF(373,116) = HCF(862,373) = HCF(2959,862) = HCF(6780,2959) = HCF(9739,6780) .
Here are some samples of HCF using Euclid's Algorithm calculations.
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 6780, 9739?
Answer: HCF of 6780, 9739 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 6780, 9739 using Euclid's Algorithm?
Answer: For arbitrary numbers 6780, 9739 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.