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