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

HCF of 505, 809, 28 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 505, 809, 28 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 505, 809, 28 is 1.

HCF(505, 809, 28) = 1

HCF of 505, 809, 28 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 505, 809, 28 is 1.

Highest Common Factor of 505,809,28 using Euclid's algorithm

Highest Common Factor of 505,809,28 is 1

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

809 = 505 x 1 + 304

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

505 = 304 x 1 + 201

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

304 = 201 x 1 + 103

We consider the new divisor 201 and the new remainder 103,and apply the division lemma to get

201 = 103 x 1 + 98

We consider the new divisor 103 and the new remainder 98,and apply the division lemma to get

103 = 98 x 1 + 5

We consider the new divisor 98 and the new remainder 5,and apply the division lemma to get

98 = 5 x 19 + 3

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

5 = 3 x 1 + 2

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

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

Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(5,3) = HCF(98,5) = HCF(103,98) = HCF(201,103) = HCF(304,201) = HCF(505,304) = HCF(809,505) .

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

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

28 = 1 x 28 + 0

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

Notice that 1 = HCF(28,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 505, 809, 28 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 505, 809, 28?

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

3. How to find HCF of 505, 809, 28 using Euclid's Algorithm?

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