Highest Common Factor of 828, 1158, 9089 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 828, 1158, 9089 i.e. 1 the largest integer that leaves a remainder zero for all numbers.

HCF of 828, 1158, 9089 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, 1158, 9089 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, 1158, 9089 is 1.

HCF(828, 1158, 9089) = 1

HCF of 828, 1158, 9089 using Euclid's algorithm

Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.

HCF of:

Highest common factor (HCF) of 828, 1158, 9089 is 1.

Highest Common Factor of 828,1158,9089 using Euclid's algorithm

Highest Common Factor of 828,1158,9089 is 1

Step 1: Since 1158 > 828, we apply the division lemma to 1158 and 828, to get

1158 = 828 x 1 + 330

Step 2: Since the reminder 828 ≠ 0, we apply division lemma to 330 and 828, to get

828 = 330 x 2 + 168

Step 3: We consider the new divisor 330 and the new remainder 168, and apply the division lemma to get

330 = 168 x 1 + 162

We consider the new divisor 168 and the new remainder 162,and apply the division lemma to get

168 = 162 x 1 + 6

We consider the new divisor 162 and the new remainder 6,and apply the division lemma to get

162 = 6 x 27 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 6, the HCF of 828 and 1158 is 6

Notice that 6 = HCF(162,6) = HCF(168,162) = HCF(330,168) = HCF(828,330) = HCF(1158,828) .

We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma

Step 1: Since 9089 > 6, we apply the division lemma to 9089 and 6, to get

9089 = 6 x 1514 + 5

Step 2: Since the reminder 6 ≠ 0, we apply division lemma to 5 and 6, to get

6 = 5 x 1 + 1

Step 3: We consider the new divisor 5 and the new remainder 1, and apply the division lemma to get

5 = 1 x 5 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 6 and 9089 is 1

Notice that 1 = HCF(5,1) = HCF(6,5) = HCF(9089,6) .

HCF using Euclid's Algorithm Calculation Examples

Here are some samples of HCF using Euclid's Algorithm calculations.

Frequently Asked Questions on HCF of 828, 1158, 9089 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 828, 1158, 9089?

Answer: HCF of 828, 1158, 9089 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 828, 1158, 9089 using Euclid's Algorithm?

Answer: For arbitrary numbers 828, 1158, 9089 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.