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

HCF of 4910, 2789 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 4910, 2789 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 4910, 2789 is 1.

HCF(4910, 2789) = 1

HCF of 4910, 2789 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 4910, 2789 is 1.

Highest Common Factor of 4910,2789 using Euclid's algorithm

Highest Common Factor of 4910,2789 is 1

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

4910 = 2789 x 1 + 2121

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

2789 = 2121 x 1 + 668

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

2121 = 668 x 3 + 117

We consider the new divisor 668 and the new remainder 117,and apply the division lemma to get

668 = 117 x 5 + 83

We consider the new divisor 117 and the new remainder 83,and apply the division lemma to get

117 = 83 x 1 + 34

We consider the new divisor 83 and the new remainder 34,and apply the division lemma to get

83 = 34 x 2 + 15

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

34 = 15 x 2 + 4

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

15 = 4 x 3 + 3

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

4 = 3 x 1 + 1

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

3 = 1 x 3 + 0

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

Notice that 1 = HCF(3,1) = HCF(4,3) = HCF(15,4) = HCF(34,15) = HCF(83,34) = HCF(117,83) = HCF(668,117) = HCF(2121,668) = HCF(2789,2121) = HCF(4910,2789) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 4910, 2789 using Euclid's Algorithm?

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