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

HCF of 6949, 6851, 31790 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 6949, 6851, 31790 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 6949, 6851, 31790 is 1.

HCF(6949, 6851, 31790) = 1

HCF of 6949, 6851, 31790 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 6949, 6851, 31790 is 1.

Highest Common Factor of 6949,6851,31790 using Euclid's algorithm

Highest Common Factor of 6949,6851,31790 is 1

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

6949 = 6851 x 1 + 98

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

6851 = 98 x 69 + 89

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

98 = 89 x 1 + 9

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

89 = 9 x 9 + 8

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

9 = 8 x 1 + 1

We consider the new divisor 8 and the new remainder 1,and apply the division lemma to get

8 = 1 x 8 + 0

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

Notice that 1 = HCF(8,1) = HCF(9,8) = HCF(89,9) = HCF(98,89) = HCF(6851,98) = HCF(6949,6851) .

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

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

31790 = 1 x 31790 + 0

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

Notice that 1 = HCF(31790,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 6949, 6851, 31790 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 6949, 6851, 31790?

Answer: HCF of 6949, 6851, 31790 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 6949, 6851, 31790 using Euclid's Algorithm?

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