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