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

HCF of 1194, 6828, 22351 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 1194, 6828, 22351 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 1194, 6828, 22351 is 1.

HCF(1194, 6828, 22351) = 1

HCF of 1194, 6828, 22351 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 1194, 6828, 22351 is 1.

Highest Common Factor of 1194,6828,22351 using Euclid's algorithm

Highest Common Factor of 1194,6828,22351 is 1

Step 1: Since 6828 > 1194, we apply the division lemma to 6828 and 1194, to get

6828 = 1194 x 5 + 858

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

1194 = 858 x 1 + 336

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

858 = 336 x 2 + 186

We consider the new divisor 336 and the new remainder 186,and apply the division lemma to get

336 = 186 x 1 + 150

We consider the new divisor 186 and the new remainder 150,and apply the division lemma to get

186 = 150 x 1 + 36

We consider the new divisor 150 and the new remainder 36,and apply the division lemma to get

150 = 36 x 4 + 6

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

36 = 6 x 6 + 0

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

Notice that 6 = HCF(36,6) = HCF(150,36) = HCF(186,150) = HCF(336,186) = HCF(858,336) = HCF(1194,858) = HCF(6828,1194) .

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

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

22351 = 6 x 3725 + 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 22351 is 1

Notice that 1 = HCF(6,1) = HCF(22351,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 1194, 6828, 22351 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 1194, 6828, 22351?

Answer: HCF of 1194, 6828, 22351 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 1194, 6828, 22351 using Euclid's Algorithm?

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