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