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