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