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