Highest Common Factor of 2085, 4786 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 2085, 4786 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 2085, 4786 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 2085, 4786 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 2085, 4786 is 1.
HCF(2085, 4786) = 1
HCF of 2085, 4786 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 2085, 4786 is 1.
Highest Common Factor of 2085,4786 is 1
Step 1: Since 4786 > 2085, we apply the division lemma to 4786 and 2085, to get
4786 = 2085 x 2 + 616
Step 2: Since the reminder 2085 ≠ 0, we apply division lemma to 616 and 2085, to get
2085 = 616 x 3 + 237
Step 3: We consider the new divisor 616 and the new remainder 237, and apply the division lemma to get
616 = 237 x 2 + 142
We consider the new divisor 237 and the new remainder 142,and apply the division lemma to get
237 = 142 x 1 + 95
We consider the new divisor 142 and the new remainder 95,and apply the division lemma to get
142 = 95 x 1 + 47
We consider the new divisor 95 and the new remainder 47,and apply the division lemma to get
95 = 47 x 2 + 1
We consider the new divisor 47 and the new remainder 1,and apply the division lemma to get
47 = 1 x 47 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 2085 and 4786 is 1
Notice that 1 = HCF(47,1) = HCF(95,47) = HCF(142,95) = HCF(237,142) = HCF(616,237) = HCF(2085,616) = HCF(4786,2085) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 2085, 4786 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 2085, 4786?
Answer: HCF of 2085, 4786 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 2085, 4786 using Euclid's Algorithm?
Answer: For arbitrary numbers 2085, 4786 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.