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

HCF of 5136, 8285 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 5136, 8285 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 5136, 8285 is 1.

HCF(5136, 8285) = 1

HCF of 5136, 8285 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 5136, 8285 is 1.

Highest Common Factor of 5136,8285 using Euclid's algorithm

Highest Common Factor of 5136,8285 is 1

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

8285 = 5136 x 1 + 3149

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

5136 = 3149 x 1 + 1987

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

3149 = 1987 x 1 + 1162

We consider the new divisor 1987 and the new remainder 1162,and apply the division lemma to get

1987 = 1162 x 1 + 825

We consider the new divisor 1162 and the new remainder 825,and apply the division lemma to get

1162 = 825 x 1 + 337

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

825 = 337 x 2 + 151

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

337 = 151 x 2 + 35

We consider the new divisor 151 and the new remainder 35,and apply the division lemma to get

151 = 35 x 4 + 11

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

35 = 11 x 3 + 2

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

11 = 2 x 5 + 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 5136 and 8285 is 1

Notice that 1 = HCF(2,1) = HCF(11,2) = HCF(35,11) = HCF(151,35) = HCF(337,151) = HCF(825,337) = HCF(1162,825) = HCF(1987,1162) = HCF(3149,1987) = HCF(5136,3149) = HCF(8285,5136) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 5136, 8285 using Euclid's Algorithm?

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