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

HCF of 1897, 6808 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 1897, 6808 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 1897, 6808 is 1.

HCF(1897, 6808) = 1

HCF of 1897, 6808 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 1897, 6808 is 1.

Highest Common Factor of 1897,6808 using Euclid's algorithm

Highest Common Factor of 1897,6808 is 1

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

6808 = 1897 x 3 + 1117

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

1897 = 1117 x 1 + 780

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

1117 = 780 x 1 + 337

We consider the new divisor 780 and the new remainder 337,and apply the division lemma to get

780 = 337 x 2 + 106

We consider the new divisor 337 and the new remainder 106,and apply the division lemma to get

337 = 106 x 3 + 19

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

106 = 19 x 5 + 11

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

19 = 11 x 1 + 8

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

11 = 8 x 1 + 3

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

8 = 3 x 2 + 2

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

3 = 2 x 1 + 1

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 1897 and 6808 is 1

Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(8,3) = HCF(11,8) = HCF(19,11) = HCF(106,19) = HCF(337,106) = HCF(780,337) = HCF(1117,780) = HCF(1897,1117) = HCF(6808,1897) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 1897, 6808 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 1897, 6808?

Answer: HCF of 1897, 6808 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 1897, 6808 using Euclid's Algorithm?

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