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