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 391, 868, 85 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 391, 868, 85 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 391, 868, 85 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 391, 868, 85 is 1.
HCF(391, 868, 85) = 1
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 391, 868, 85 is 1.
Step 1: Since 868 > 391, we apply the division lemma to 868 and 391, to get
868 = 391 x 2 + 86
Step 2: Since the reminder 391 ≠ 0, we apply division lemma to 86 and 391, to get
391 = 86 x 4 + 47
Step 3: We consider the new divisor 86 and the new remainder 47, and apply the division lemma to get
86 = 47 x 1 + 39
We consider the new divisor 47 and the new remainder 39,and apply the division lemma to get
47 = 39 x 1 + 8
We consider the new divisor 39 and the new remainder 8,and apply the division lemma to get
39 = 8 x 4 + 7
We consider the new divisor 8 and the new remainder 7,and apply the division lemma to get
8 = 7 x 1 + 1
We consider the new divisor 7 and the new remainder 1,and apply the division lemma to get
7 = 1 x 7 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 391 and 868 is 1
Notice that 1 = HCF(7,1) = HCF(8,7) = HCF(39,8) = HCF(47,39) = HCF(86,47) = HCF(391,86) = HCF(868,391) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 85 > 1, we apply the division lemma to 85 and 1, to get
85 = 1 x 85 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 1 and 85 is 1
Notice that 1 = HCF(85,1) .
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 391, 868, 85?
Answer: HCF of 391, 868, 85 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 391, 868, 85 using Euclid's Algorithm?
Answer: For arbitrary numbers 391, 868, 85 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.