Question

26) Using Euclid's division algorithm, find the HCF of 65 and 169.​

Answer 1

Step-by-step explanation:

13 is HCF of 13 and 169 .

Please mark me as Brainliest

Answer 2

Answer:

Step-by-step explanation:

Ques- Use Euclid's division algorithm to find the HCF of the following number: 65 and 117

Ans. Since 117>65, we apply the division lemma to 117 and 65 to obtain:

117=65×1+52

Since remainder 52



=0, we apply the division lemma to 65 and 52 to obtain:

65=52×1+13

We consider the new divisor 52 and new remainder 13, and apply the division lemma to obtain

52=13×4+0

Since the remainder is zero, the process stops.

Also, the divisor at this stage is 13,

Hence, the HCF of 117 and 65 is 13.