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