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