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