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