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

HCF of 361, 212, 984 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 361, 212, 984 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 361, 212, 984 is 1.

HCF(361, 212, 984) = 1

HCF of 361, 212, 984 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 361, 212, 984 is 1.

Highest Common Factor of 361,212,984 using Euclid's algorithm

Highest Common Factor of 361,212,984 is 1

Step 1: Since 361 > 212, we apply the division lemma to 361 and 212, to get

361 = 212 x 1 + 149

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

212 = 149 x 1 + 63

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

149 = 63 x 2 + 23

We consider the new divisor 63 and the new remainder 23,and apply the division lemma to get

63 = 23 x 2 + 17

We consider the new divisor 23 and the new remainder 17,and apply the division lemma to get

23 = 17 x 1 + 6

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

17 = 6 x 2 + 5

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

6 = 5 x 1 + 1

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 361 and 212 is 1

Notice that 1 = HCF(5,1) = HCF(6,5) = HCF(17,6) = HCF(23,17) = HCF(63,23) = HCF(149,63) = HCF(212,149) = HCF(361,212) .


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

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

984 = 1 x 984 + 0

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

Notice that 1 = HCF(984,1) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 361, 212, 984 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 361, 212, 984?

Answer: HCF of 361, 212, 984 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 361, 212, 984 using Euclid's Algorithm?

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