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