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