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