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