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