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 9918, 2665 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 9918, 2665 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 9918, 2665 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 9918, 2665 is 1.
HCF(9918, 2665) = 1
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 9918, 2665 is 1.
Step 1: Since 9918 > 2665, we apply the division lemma to 9918 and 2665, to get
9918 = 2665 x 3 + 1923
Step 2: Since the reminder 2665 ≠ 0, we apply division lemma to 1923 and 2665, to get
2665 = 1923 x 1 + 742
Step 3: We consider the new divisor 1923 and the new remainder 742, and apply the division lemma to get
1923 = 742 x 2 + 439
We consider the new divisor 742 and the new remainder 439,and apply the division lemma to get
742 = 439 x 1 + 303
We consider the new divisor 439 and the new remainder 303,and apply the division lemma to get
439 = 303 x 1 + 136
We consider the new divisor 303 and the new remainder 136,and apply the division lemma to get
303 = 136 x 2 + 31
We consider the new divisor 136 and the new remainder 31,and apply the division lemma to get
136 = 31 x 4 + 12
We consider the new divisor 31 and the new remainder 12,and apply the division lemma to get
31 = 12 x 2 + 7
We consider the new divisor 12 and the new remainder 7,and apply the division lemma to get
12 = 7 x 1 + 5
We consider the new divisor 7 and the new remainder 5,and apply the division lemma to get
7 = 5 x 1 + 2
We consider the new divisor 5 and the new remainder 2,and apply the division lemma to get
5 = 2 x 2 + 1
We consider the new divisor 2 and the new remainder 1,and apply the division lemma to get
2 = 1 x 2 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 9918 and 2665 is 1
Notice that 1 = HCF(2,1) = HCF(5,2) = HCF(7,5) = HCF(12,7) = HCF(31,12) = HCF(136,31) = HCF(303,136) = HCF(439,303) = HCF(742,439) = HCF(1923,742) = HCF(2665,1923) = HCF(9918,2665) .
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 9918, 2665?
Answer: HCF of 9918, 2665 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 9918, 2665 using Euclid's Algorithm?
Answer: For arbitrary numbers 9918, 2665 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.