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