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