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

HCF of 4769, 8985 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 4769, 8985 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 4769, 8985 is 1.

HCF(4769, 8985) = 1

HCF of 4769, 8985 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 4769, 8985 is 1.

Highest Common Factor of 4769,8985 using Euclid's algorithm

Highest Common Factor of 4769,8985 is 1

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

8985 = 4769 x 1 + 4216

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

4769 = 4216 x 1 + 553

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

4216 = 553 x 7 + 345

We consider the new divisor 553 and the new remainder 345,and apply the division lemma to get

553 = 345 x 1 + 208

We consider the new divisor 345 and the new remainder 208,and apply the division lemma to get

345 = 208 x 1 + 137

We consider the new divisor 208 and the new remainder 137,and apply the division lemma to get

208 = 137 x 1 + 71

We consider the new divisor 137 and the new remainder 71,and apply the division lemma to get

137 = 71 x 1 + 66

We consider the new divisor 71 and the new remainder 66,and apply the division lemma to get

71 = 66 x 1 + 5

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

66 = 5 x 13 + 1

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

5 = 1 x 5 + 0

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

Notice that 1 = HCF(5,1) = HCF(66,5) = HCF(71,66) = HCF(137,71) = HCF(208,137) = HCF(345,208) = HCF(553,345) = HCF(4216,553) = HCF(4769,4216) = HCF(8985,4769) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 4769, 8985 using Euclid's Algorithm?

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