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