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

HCF of 836, 485, 390 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 836, 485, 390 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 836, 485, 390 is 1.

HCF(836, 485, 390) = 1

HCF of 836, 485, 390 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 836, 485, 390 is 1.

Highest Common Factor of 836,485,390 using Euclid's algorithm

Highest Common Factor of 836,485,390 is 1

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

836 = 485 x 1 + 351

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

485 = 351 x 1 + 134

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

351 = 134 x 2 + 83

We consider the new divisor 134 and the new remainder 83,and apply the division lemma to get

134 = 83 x 1 + 51

We consider the new divisor 83 and the new remainder 51,and apply the division lemma to get

83 = 51 x 1 + 32

We consider the new divisor 51 and the new remainder 32,and apply the division lemma to get

51 = 32 x 1 + 19

We consider the new divisor 32 and the new remainder 19,and apply the division lemma to get

32 = 19 x 1 + 13

We consider the new divisor 19 and the new remainder 13,and apply the division lemma to get

19 = 13 x 1 + 6

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

13 = 6 x 2 + 1

We consider the new divisor 6 and the new remainder 1,and apply the division lemma 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 836 and 485 is 1

Notice that 1 = HCF(6,1) = HCF(13,6) = HCF(19,13) = HCF(32,19) = HCF(51,32) = HCF(83,51) = HCF(134,83) = HCF(351,134) = HCF(485,351) = HCF(836,485) .

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

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

390 = 1 x 390 + 0

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

Notice that 1 = HCF(390,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 836, 485, 390 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 836, 485, 390?

Answer: HCF of 836, 485, 390 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 836, 485, 390 using Euclid's Algorithm?

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