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