Question

Find hcf of 15 and 10945 by euclid's division algorithm.

Answer 1

1st no. = 10945

2nd no.= 15

since, 10945>15

so, divisor=15 & dividend= 10945

so, using Euclid's division lemma (a = bq+r)

10945 = 15 ×729+ 10

15 = 10 ×1 + 5

10 = 5 ×2 +0

since, remainder=0

The divisor of the last step is the HCF of 10945 & 15

Answer- 5