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