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