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