Highest Common Factor of 7648, 8839, 39489 using Euclid's algorithm
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 7648, 8839, 39489 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 7648, 8839, 39489 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 7648, 8839, 39489 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 7648, 8839, 39489 is 1.
HCF(7648, 8839, 39489) = 1
HCF of 7648, 8839, 39489 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 7648, 8839, 39489 is 1.
Highest Common Factor of 7648,8839,39489 is 1
Step 1: Since 8839 > 7648, we apply the division lemma to 8839 and 7648, to get
8839 = 7648 x 1 + 1191
Step 2: Since the reminder 7648 ≠ 0, we apply division lemma to 1191 and 7648, to get
7648 = 1191 x 6 + 502
Step 3: We consider the new divisor 1191 and the new remainder 502, and apply the division lemma to get
1191 = 502 x 2 + 187
We consider the new divisor 502 and the new remainder 187,and apply the division lemma to get
502 = 187 x 2 + 128
We consider the new divisor 187 and the new remainder 128,and apply the division lemma to get
187 = 128 x 1 + 59
We consider the new divisor 128 and the new remainder 59,and apply the division lemma to get
128 = 59 x 2 + 10
We consider the new divisor 59 and the new remainder 10,and apply the division lemma to get
59 = 10 x 5 + 9
We consider the new divisor 10 and the new remainder 9,and apply the division lemma to get
10 = 9 x 1 + 1
We consider the new divisor 9 and the new remainder 1,and apply the division lemma to get
9 = 1 x 9 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 7648 and 8839 is 1
Notice that 1 = HCF(9,1) = HCF(10,9) = HCF(59,10) = HCF(128,59) = HCF(187,128) = HCF(502,187) = HCF(1191,502) = HCF(7648,1191) = HCF(8839,7648) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 39489 > 1, we apply the division lemma to 39489 and 1, to get
39489 = 1 x 39489 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 1 and 39489 is 1
Notice that 1 = HCF(39489,1) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 7648, 8839, 39489 using Euclid's Algorithm
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 7648, 8839, 39489?
Answer: HCF of 7648, 8839, 39489 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 7648, 8839, 39489 using Euclid's Algorithm?
Answer: For arbitrary numbers 7648, 8839, 39489 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.
