Highest Common Factor of 6090, 9622 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 6090, 9622 i.e. 2 the largest integer that leaves a remainder zero for all numbers.
HCF of 6090, 9622 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 6090, 9622 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 6090, 9622 is 2.
HCF(6090, 9622) = 2
HCF of 6090, 9622 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 6090, 9622 is 2.
Highest Common Factor of 6090,9622 is 2
Step 1: Since 9622 > 6090, we apply the division lemma to 9622 and 6090, to get
9622 = 6090 x 1 + 3532
Step 2: Since the reminder 6090 ≠ 0, we apply division lemma to 3532 and 6090, to get
6090 = 3532 x 1 + 2558
Step 3: We consider the new divisor 3532 and the new remainder 2558, and apply the division lemma to get
3532 = 2558 x 1 + 974
We consider the new divisor 2558 and the new remainder 974,and apply the division lemma to get
2558 = 974 x 2 + 610
We consider the new divisor 974 and the new remainder 610,and apply the division lemma to get
974 = 610 x 1 + 364
We consider the new divisor 610 and the new remainder 364,and apply the division lemma to get
610 = 364 x 1 + 246
We consider the new divisor 364 and the new remainder 246,and apply the division lemma to get
364 = 246 x 1 + 118
We consider the new divisor 246 and the new remainder 118,and apply the division lemma to get
246 = 118 x 2 + 10
We consider the new divisor 118 and the new remainder 10,and apply the division lemma to get
118 = 10 x 11 + 8
We consider the new divisor 10 and the new remainder 8,and apply the division lemma to get
10 = 8 x 1 + 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 6090 and 9622 is 2
Notice that 2 = HCF(8,2) = HCF(10,8) = HCF(118,10) = HCF(246,118) = HCF(364,246) = HCF(610,364) = HCF(974,610) = HCF(2558,974) = HCF(3532,2558) = HCF(6090,3532) = HCF(9622,6090) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 6090, 9622 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 6090, 9622?
Answer: HCF of 6090, 9622 is 2 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 6090, 9622 using Euclid's Algorithm?
Answer: For arbitrary numbers 6090, 9622 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.