Highest Common Factor of 360, 5910 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, 5910 i.e. 30 the largest integer that leaves a remainder zero for all numbers.
HCF of 360, 5910 is 30 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, 5910 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, 5910 is 30.
HCF(360, 5910) = 30
HCF of 360, 5910 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, 5910 is 30.
Highest Common Factor of 360,5910 is 30
Step 1: Since 5910 > 360, we apply the division lemma to 5910 and 360, to get
5910 = 360 x 16 + 150
Step 2: Since the reminder 360 ≠ 0, we apply division lemma to 150 and 360, to get
360 = 150 x 2 + 60
Step 3: We consider the new divisor 150 and the new remainder 60, and apply the division lemma to get
150 = 60 x 2 + 30
We consider the new divisor 60 and the new remainder 30, and apply the division lemma to get
60 = 30 x 2 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 30, the HCF of 360 and 5910 is 30
Notice that 30 = HCF(60,30) = HCF(150,60) = HCF(360,150) = HCF(5910,360) .
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, 5910 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, 5910?
Answer: HCF of 360, 5910 is 30 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 360, 5910 using Euclid's Algorithm?
Answer: For arbitrary numbers 360, 5910 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.