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