Question

Find the HCF of the following number by using division method of 59 and 63​

Answer 1

Answer:

HCF IS 1

Step-by-step explanation:

Below detailed show work will make you learn how to find HCF of 63,59 using the Euclidean division algorithm. So, follow the step by step explanation & check the answer for HCF(63,59).

Here 63 is greater than 59

Now, consider the largest number as 'a' from the given number ie., 63 and 59 satisfy Euclid's division lemma statement a = bq + r where 0 ≤ r < b

Step 1: Since 63 > 59, we apply the division lemma to 63 and 59, to get

63 = 59 x 1 + 4

Step 2: Since the reminder 59 ≠ 0, we apply division lemma to 4 and 59, to get

59 = 4 x 14 + 3

Step 3: We consider the new divisor 4 and the new remainder 3, and apply the division lemma to get

4 = 3 x 1 + 1

We consider the new divisor 3 and the new remainder 1, and apply the division lemma to get

3 = 1 x 3 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 63 and 59 is 1

Notice that 1 = HCF(3,1) = HCF(4,3) = HCF(59,4) = HCF(63,59) .

Therefore, HCF of 63,59 using Euclid's division lemma is 1.