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