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