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