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