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