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