Highest Common Factor of 1225, 6885 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 1225, 6885 i.e. 5 the largest integer that leaves a remainder zero for all numbers.
HCF of 1225, 6885 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 1225, 6885 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 1225, 6885 is 5.
HCF(1225, 6885) = 5
HCF of 1225, 6885 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 1225, 6885 is 5.
Highest Common Factor of 1225,6885 is 5
Step 1: Since 6885 > 1225, we apply the division lemma to 6885 and 1225, to get
6885 = 1225 x 5 + 760
Step 2: Since the reminder 1225 ≠ 0, we apply division lemma to 760 and 1225, to get
1225 = 760 x 1 + 465
Step 3: We consider the new divisor 760 and the new remainder 465, and apply the division lemma to get
760 = 465 x 1 + 295
We consider the new divisor 465 and the new remainder 295,and apply the division lemma to get
465 = 295 x 1 + 170
We consider the new divisor 295 and the new remainder 170,and apply the division lemma to get
295 = 170 x 1 + 125
We consider the new divisor 170 and the new remainder 125,and apply the division lemma to get
170 = 125 x 1 + 45
We consider the new divisor 125 and the new remainder 45,and apply the division lemma to get
125 = 45 x 2 + 35
We consider the new divisor 45 and the new remainder 35,and apply the division lemma to get
45 = 35 x 1 + 10
We consider the new divisor 35 and the new remainder 10,and apply the division lemma to get
35 = 10 x 3 + 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 1225 and 6885 is 5
Notice that 5 = HCF(10,5) = HCF(35,10) = HCF(45,35) = HCF(125,45) = HCF(170,125) = HCF(295,170) = HCF(465,295) = HCF(760,465) = HCF(1225,760) = HCF(6885,1225) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 1225, 6885 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 1225, 6885?
Answer: HCF of 1225, 6885 is 5 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 1225, 6885 using Euclid's Algorithm?
Answer: For arbitrary numbers 1225, 6885 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.