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