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