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