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