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

HCF of 772, 911, 909 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 772, 911, 909 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 772, 911, 909 is 1.

HCF(772, 911, 909) = 1

HCF of 772, 911, 909 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 772, 911, 909 is 1.

Highest Common Factor of 772,911,909 using Euclid's algorithm

Highest Common Factor of 772,911,909 is 1

Step 1: Since 911 > 772, we apply the division lemma to 911 and 772, to get

911 = 772 x 1 + 139

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

772 = 139 x 5 + 77

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

139 = 77 x 1 + 62

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

77 = 62 x 1 + 15

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

62 = 15 x 4 + 2

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

15 = 2 x 7 + 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 772 and 911 is 1

Notice that 1 = HCF(2,1) = HCF(15,2) = HCF(62,15) = HCF(77,62) = HCF(139,77) = HCF(772,139) = HCF(911,772) .

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

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

909 = 1 x 909 + 0

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

Notice that 1 = HCF(909,1) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 772, 911, 909 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 772, 911, 909?

Answer: HCF of 772, 911, 909 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 772, 911, 909 using Euclid's Algorithm?

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