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