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