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