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