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