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