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