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