Question

5. Using Euclid's division algorithm, find the
HCF of 255 and 15​

Answer 1

Step-by-step explanation:

As 255>15, using Euclid Algorithm ,

a=bq+r that is 255=15*17+0,

Since the remainder is zero. So HCF of 255 and 15 is 15.