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 8807, 1018, 96938 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 8807, 1018, 96938 is 1 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 8807, 1018, 96938 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 8807, 1018, 96938 is 1.
HCF(8807, 1018, 96938) = 1
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 8807, 1018, 96938 is 1.
Step 1: Since 8807 > 1018, we apply the division lemma to 8807 and 1018, to get
8807 = 1018 x 8 + 663
Step 2: Since the reminder 1018 ≠ 0, we apply division lemma to 663 and 1018, to get
1018 = 663 x 1 + 355
Step 3: We consider the new divisor 663 and the new remainder 355, and apply the division lemma to get
663 = 355 x 1 + 308
We consider the new divisor 355 and the new remainder 308,and apply the division lemma to get
355 = 308 x 1 + 47
We consider the new divisor 308 and the new remainder 47,and apply the division lemma to get
308 = 47 x 6 + 26
We consider the new divisor 47 and the new remainder 26,and apply the division lemma to get
47 = 26 x 1 + 21
We consider the new divisor 26 and the new remainder 21,and apply the division lemma to get
26 = 21 x 1 + 5
We consider the new divisor 21 and the new remainder 5,and apply the division lemma to get
21 = 5 x 4 + 1
We consider the new divisor 5 and the new remainder 1,and apply the division lemma to get
5 = 1 x 5 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 8807 and 1018 is 1
Notice that 1 = HCF(5,1) = HCF(21,5) = HCF(26,21) = HCF(47,26) = HCF(308,47) = HCF(355,308) = HCF(663,355) = HCF(1018,663) = HCF(8807,1018) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 96938 > 1, we apply the division lemma to 96938 and 1, to get
96938 = 1 x 96938 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 1 and 96938 is 1
Notice that 1 = HCF(96938,1) .
Here are some samples of HCF using Euclid's Algorithm calculations.
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 8807, 1018, 96938?
Answer: HCF of 8807, 1018, 96938 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 8807, 1018, 96938 using Euclid's Algorithm?
Answer: For arbitrary numbers 8807, 1018, 96938 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.