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