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