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

HCF of 4785, 5362 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 4785, 5362 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 4785, 5362 is 1.

HCF(4785, 5362) = 1

HCF of 4785, 5362 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 4785, 5362 is 1.

Highest Common Factor of 4785,5362 using Euclid's algorithm

Highest Common Factor of 4785,5362 is 1

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

5362 = 4785 x 1 + 577

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

4785 = 577 x 8 + 169

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

577 = 169 x 3 + 70

We consider the new divisor 169 and the new remainder 70,and apply the division lemma to get

169 = 70 x 2 + 29

We consider the new divisor 70 and the new remainder 29,and apply the division lemma to get

70 = 29 x 2 + 12

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

29 = 12 x 2 + 5

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

12 = 5 x 2 + 2

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

5 = 2 x 2 + 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 4785 and 5362 is 1

Notice that 1 = HCF(2,1) = HCF(5,2) = HCF(12,5) = HCF(29,12) = HCF(70,29) = HCF(169,70) = HCF(577,169) = HCF(4785,577) = HCF(5362,4785) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 4785, 5362 using Euclid's Algorithm?

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