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