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