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