Question

Use Euclid's division algorithm to find the HCF of:
15 and 165
45 and 80
13 and 67​

Answer 1

Step-by-step explanation:

according to Euclid division lemma

(165,15)

165=15*1+15

15=15*1+0

since remainder is o so our procedure stops

hcf(15, 165) =15

Answer 2

Answer:

Please refer this image.

And Extremely Sorry if my handwriting is bad.

Hope this will help you.