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