Math, asked by rmsingh324, 1 year ago

Find the HCF of 165 and 13 by Euclid division algorithm

Answers

Answered by Anonymous
1

Hope it will help you. . . . . . . . . . . . . .

Attachments:
Answered by LilyWhite
1

let a = 165 b = 13

a = b.q + r

165 = 13 × 12.6 + 12

let a = 13 b = 12

a = b.q + r

13 = 12 × 1.0 + 10

let a = 12 b = 10

a = b.q + r

12 = 10 × 1.2 + 0

Therefore the HCF is 10

Attachments:
Similar questions