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