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