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