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