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

HCF of 5133, 8298 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 5133, 8298 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 5133, 8298 is 3.

HCF(5133, 8298) = 3

HCF of 5133, 8298 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 5133, 8298 is 3.

Highest Common Factor of 5133,8298 using Euclid's algorithm

Highest Common Factor of 5133,8298 is 3

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

8298 = 5133 x 1 + 3165

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

5133 = 3165 x 1 + 1968

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

3165 = 1968 x 1 + 1197

We consider the new divisor 1968 and the new remainder 1197,and apply the division lemma to get

1968 = 1197 x 1 + 771

We consider the new divisor 1197 and the new remainder 771,and apply the division lemma to get

1197 = 771 x 1 + 426

We consider the new divisor 771 and the new remainder 426,and apply the division lemma to get

771 = 426 x 1 + 345

We consider the new divisor 426 and the new remainder 345,and apply the division lemma to get

426 = 345 x 1 + 81

We consider the new divisor 345 and the new remainder 81,and apply the division lemma to get

345 = 81 x 4 + 21

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

81 = 21 x 3 + 18

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

21 = 18 x 1 + 3

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

18 = 3 x 6 + 0

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

Notice that 3 = HCF(18,3) = HCF(21,18) = HCF(81,21) = HCF(345,81) = HCF(426,345) = HCF(771,426) = HCF(1197,771) = HCF(1968,1197) = HCF(3165,1968) = HCF(5133,3165) = HCF(8298,5133) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 5133, 8298 using Euclid's Algorithm?

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