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