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