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