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

HCF of 6806, 4913 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 6806, 4913 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 6806, 4913 is 1.

HCF(6806, 4913) = 1

HCF of 6806, 4913 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 6806, 4913 is 1.

Highest Common Factor of 6806,4913 using Euclid's algorithm

Highest Common Factor of 6806,4913 is 1

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

6806 = 4913 x 1 + 1893

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

4913 = 1893 x 2 + 1127

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

1893 = 1127 x 1 + 766

We consider the new divisor 1127 and the new remainder 766,and apply the division lemma to get

1127 = 766 x 1 + 361

We consider the new divisor 766 and the new remainder 361,and apply the division lemma to get

766 = 361 x 2 + 44

We consider the new divisor 361 and the new remainder 44,and apply the division lemma to get

361 = 44 x 8 + 9

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

44 = 9 x 4 + 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 6806 and 4913 is 1

Notice that 1 = HCF(8,1) = HCF(9,8) = HCF(44,9) = HCF(361,44) = HCF(766,361) = HCF(1127,766) = HCF(1893,1127) = HCF(4913,1893) = HCF(6806,4913) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 6806, 4913 using Euclid's Algorithm?

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