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

HCF of 936, 686, 975, 489 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 936, 686, 975, 489 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 936, 686, 975, 489 is 1.

HCF(936, 686, 975, 489) = 1

HCF of 936, 686, 975, 489 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 936, 686, 975, 489 is 1.

Highest Common Factor of 936,686,975,489 using Euclid's algorithm

Highest Common Factor of 936,686,975,489 is 1

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

936 = 686 x 1 + 250

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

686 = 250 x 2 + 186

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

250 = 186 x 1 + 64

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

186 = 64 x 2 + 58

We consider the new divisor 64 and the new remainder 58,and apply the division lemma to get

64 = 58 x 1 + 6

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

58 = 6 x 9 + 4

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

6 = 4 x 1 + 2

We consider the new divisor 4 and the new remainder 2,and apply the division lemma to get

4 = 2 x 2 + 0

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

Notice that 2 = HCF(4,2) = HCF(6,4) = HCF(58,6) = HCF(64,58) = HCF(186,64) = HCF(250,186) = HCF(686,250) = HCF(936,686) .

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

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

975 = 2 x 487 + 1

Step 2: Since the reminder 2 ≠ 0, we apply division lemma to 1 and 2, 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 2 and 975 is 1

Notice that 1 = HCF(2,1) = HCF(975,2) .

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

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

489 = 1 x 489 + 0

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

Notice that 1 = HCF(489,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 936, 686, 975, 489 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 936, 686, 975, 489?

Answer: HCF of 936, 686, 975, 489 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 936, 686, 975, 489 using Euclid's Algorithm?

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