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

HCF of 793, 85359 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 793, 85359 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 793, 85359 is 1.

HCF(793, 85359) = 1

HCF of 793, 85359 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 793, 85359 is 1.

Highest Common Factor of 793,85359 using Euclid's algorithm

Highest Common Factor of 793,85359 is 1

Step 1: Since 85359 > 793, we apply the division lemma to 85359 and 793, to get

85359 = 793 x 107 + 508

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

793 = 508 x 1 + 285

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

508 = 285 x 1 + 223

We consider the new divisor 285 and the new remainder 223,and apply the division lemma to get

285 = 223 x 1 + 62

We consider the new divisor 223 and the new remainder 62,and apply the division lemma to get

223 = 62 x 3 + 37

We consider the new divisor 62 and the new remainder 37,and apply the division lemma to get

62 = 37 x 1 + 25

We consider the new divisor 37 and the new remainder 25,and apply the division lemma to get

37 = 25 x 1 + 12

We consider the new divisor 25 and the new remainder 12,and apply the division lemma to get

25 = 12 x 2 + 1

We consider the new divisor 12 and the new remainder 1,and apply the division lemma to get

12 = 1 x 12 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 793 and 85359 is 1

Notice that 1 = HCF(12,1) = HCF(25,12) = HCF(37,25) = HCF(62,37) = HCF(223,62) = HCF(285,223) = HCF(508,285) = HCF(793,508) = HCF(85359,793) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 793, 85359 using Euclid's Algorithm?

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