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