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