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