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

HCF of 198, 771, 368 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 198, 771, 368 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 198, 771, 368 is 1.

HCF(198, 771, 368) = 1

HCF of 198, 771, 368 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 198, 771, 368 is 1.

Highest Common Factor of 198,771,368 using Euclid's algorithm

Highest Common Factor of 198,771,368 is 1

Step 1: Since 771 > 198, we apply the division lemma to 771 and 198, to get

771 = 198 x 3 + 177

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

198 = 177 x 1 + 21

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

177 = 21 x 8 + 9

We consider the new divisor 21 and the new remainder 9,and apply the division lemma to get

21 = 9 x 2 + 3

We consider the new divisor 9 and the new remainder 3,and apply the division lemma to get

9 = 3 x 3 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 3, the HCF of 198 and 771 is 3

Notice that 3 = HCF(9,3) = HCF(21,9) = HCF(177,21) = HCF(198,177) = HCF(771,198) .

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

Step 1: Since 368 > 3, we apply the division lemma to 368 and 3, to get

368 = 3 x 122 + 2

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

3 = 2 x 1 + 1

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

2 = 1 x 2 + 0

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

Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(368,3) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 198, 771, 368 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 198, 771, 368?

Answer: HCF of 198, 771, 368 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 198, 771, 368 using Euclid's Algorithm?

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