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