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