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