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