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