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