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