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

HCF of 585, 801, 812 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 585, 801, 812 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 585, 801, 812 is 1.

HCF(585, 801, 812) = 1

HCF of 585, 801, 812 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 585, 801, 812 is 1.

Highest Common Factor of 585,801,812 using Euclid's algorithm

Highest Common Factor of 585,801,812 is 1

Step 1: Since 801 > 585, we apply the division lemma to 801 and 585, to get

801 = 585 x 1 + 216

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

585 = 216 x 2 + 153

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

216 = 153 x 1 + 63

We consider the new divisor 153 and the new remainder 63,and apply the division lemma to get

153 = 63 x 2 + 27

We consider the new divisor 63 and the new remainder 27,and apply the division lemma to get

63 = 27 x 2 + 9

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

27 = 9 x 3 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 9, the HCF of 585 and 801 is 9

Notice that 9 = HCF(27,9) = HCF(63,27) = HCF(153,63) = HCF(216,153) = HCF(585,216) = HCF(801,585) .

We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma

Step 1: Since 812 > 9, we apply the division lemma to 812 and 9, to get

812 = 9 x 90 + 2

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

9 = 2 x 4 + 1

Step 3: 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 9 and 812 is 1

Notice that 1 = HCF(2,1) = HCF(9,2) = HCF(812,9) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 585, 801, 812 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 585, 801, 812?

Answer: HCF of 585, 801, 812 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 585, 801, 812 using Euclid's Algorithm?

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