Highest Common Factor of 4636, 7392, 90156 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 4636, 7392, 90156 i.e. 4 the largest integer that leaves a remainder zero for all numbers.
HCF of 4636, 7392, 90156 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 4636, 7392, 90156 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 4636, 7392, 90156 is 4.
HCF(4636, 7392, 90156) = 4
HCF of 4636, 7392, 90156 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 4636, 7392, 90156 is 4.
Highest Common Factor of 4636,7392,90156 is 4
Step 1: Since 7392 > 4636, we apply the division lemma to 7392 and 4636, to get
7392 = 4636 x 1 + 2756
Step 2: Since the reminder 4636 ≠ 0, we apply division lemma to 2756 and 4636, to get
4636 = 2756 x 1 + 1880
Step 3: We consider the new divisor 2756 and the new remainder 1880, and apply the division lemma to get
2756 = 1880 x 1 + 876
We consider the new divisor 1880 and the new remainder 876,and apply the division lemma to get
1880 = 876 x 2 + 128
We consider the new divisor 876 and the new remainder 128,and apply the division lemma to get
876 = 128 x 6 + 108
We consider the new divisor 128 and the new remainder 108,and apply the division lemma to get
128 = 108 x 1 + 20
We consider the new divisor 108 and the new remainder 20,and apply the division lemma to get
108 = 20 x 5 + 8
We consider the new divisor 20 and the new remainder 8,and apply the division lemma to get
20 = 8 x 2 + 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 4636 and 7392 is 4
Notice that 4 = HCF(8,4) = HCF(20,8) = HCF(108,20) = HCF(128,108) = HCF(876,128) = HCF(1880,876) = HCF(2756,1880) = HCF(4636,2756) = HCF(7392,4636) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 90156 > 4, we apply the division lemma to 90156 and 4, to get
90156 = 4 x 22539 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 4, the HCF of 4 and 90156 is 4
Notice that 4 = HCF(90156,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 4636, 7392, 90156 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 4636, 7392, 90156?
Answer: HCF of 4636, 7392, 90156 is 4 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 4636, 7392, 90156 using Euclid's Algorithm?
Answer: For arbitrary numbers 4636, 7392, 90156 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.