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

HCF of 771, 480, 809 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 771, 480, 809 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 771, 480, 809 is 1.

HCF(771, 480, 809) = 1

HCF of 771, 480, 809 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 771, 480, 809 is 1.

Highest Common Factor of 771,480,809 using Euclid's algorithm

Highest Common Factor of 771,480,809 is 1

Step 1: Since 771 > 480, we apply the division lemma to 771 and 480, to get

771 = 480 x 1 + 291

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

480 = 291 x 1 + 189

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

291 = 189 x 1 + 102

We consider the new divisor 189 and the new remainder 102,and apply the division lemma to get

189 = 102 x 1 + 87

We consider the new divisor 102 and the new remainder 87,and apply the division lemma to get

102 = 87 x 1 + 15

We consider the new divisor 87 and the new remainder 15,and apply the division lemma to get

87 = 15 x 5 + 12

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

15 = 12 x 1 + 3

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

12 = 3 x 4 + 0

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

Notice that 3 = HCF(12,3) = HCF(15,12) = HCF(87,15) = HCF(102,87) = HCF(189,102) = HCF(291,189) = HCF(480,291) = HCF(771,480) .

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

Step 1: Since 809 > 3, we apply the division lemma to 809 and 3, to get

809 = 3 x 269 + 2

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

3 = 2 x 1 + 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 3 and 809 is 1

Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(809,3) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 771, 480, 809 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 771, 480, 809?

Answer: HCF of 771, 480, 809 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 771, 480, 809 using Euclid's Algorithm?

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