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