# Highest Common Factor of 5145, 8943 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 5145, 8943 i.e. 3 the largest integer that leaves a remainder zero for all numbers.

HCF of 5145, 8943 is 3 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 5145, 8943 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 5145, 8943 is 3.

HCF(5145, 8943) = 3

## HCF of 5145, 8943 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 5145, 8943 is 3. ### Highest Common Factor of 5145,8943 is 3

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

8943 = 5145 x 1 + 3798

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

5145 = 3798 x 1 + 1347

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

3798 = 1347 x 2 + 1104

We consider the new divisor 1347 and the new remainder 1104,and apply the division lemma to get

1347 = 1104 x 1 + 243

We consider the new divisor 1104 and the new remainder 243,and apply the division lemma to get

1104 = 243 x 4 + 132

We consider the new divisor 243 and the new remainder 132,and apply the division lemma to get

243 = 132 x 1 + 111

We consider the new divisor 132 and the new remainder 111,and apply the division lemma to get

132 = 111 x 1 + 21

We consider the new divisor 111 and the new remainder 21,and apply the division lemma to get

111 = 21 x 5 + 6

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

21 = 6 x 3 + 3

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

6 = 3 x 2 + 0

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

Notice that 3 = HCF(6,3) = HCF(21,6) = HCF(111,21) = HCF(132,111) = HCF(243,132) = HCF(1104,243) = HCF(1347,1104) = HCF(3798,1347) = HCF(5145,3798) = HCF(8943,5145) .

### HCF using Euclid's Algorithm Calculation Examples

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

### Frequently Asked Questions on HCF of 5145, 8943 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 5145, 8943?

Answer: HCF of 5145, 8943 is 3 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 5145, 8943 using Euclid's Algorithm?

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