Highest Common Factor of 840, 490, 788 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, 490, 788 i.e. 2 the largest integer that leaves a remainder zero for all numbers.
HCF of 840, 490, 788 is 2 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, 490, 788 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, 490, 788 is 2.
HCF(840, 490, 788) = 2
HCF of 840, 490, 788 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, 490, 788 is 2.
Highest Common Factor of 840,490,788 is 2
Step 1: Since 840 > 490, we apply the division lemma to 840 and 490, to get
840 = 490 x 1 + 350
Step 2: Since the reminder 490 ≠ 0, we apply division lemma to 350 and 490, to get
490 = 350 x 1 + 140
Step 3: We consider the new divisor 350 and the new remainder 140, and apply the division lemma to get
350 = 140 x 2 + 70
We consider the new divisor 140 and the new remainder 70, and apply the division lemma to get
140 = 70 x 2 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 70, the HCF of 840 and 490 is 70
Notice that 70 = HCF(140,70) = HCF(350,140) = HCF(490,350) = HCF(840,490) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 788 > 70, we apply the division lemma to 788 and 70, to get
788 = 70 x 11 + 18
Step 2: Since the reminder 70 ≠ 0, we apply division lemma to 18 and 70, to get
70 = 18 x 3 + 16
Step 3: We consider the new divisor 18 and the new remainder 16, and apply the division lemma to get
18 = 16 x 1 + 2
We consider the new divisor 16 and the new remainder 2, and apply the division lemma to get
16 = 2 x 8 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 2, the HCF of 70 and 788 is 2
Notice that 2 = HCF(16,2) = HCF(18,16) = HCF(70,18) = HCF(788,70) .
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, 490, 788 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, 490, 788?
Answer: HCF of 840, 490, 788 is 2 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 840, 490, 788 using Euclid's Algorithm?
Answer: For arbitrary numbers 840, 490, 788 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.