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