Question

find the HCF of 510 and 93 in Euclid division algorithm method​

Answer 1

Answer:

a=bq + r

Step-by-step explanation:

since 510 is greater number we apply division lemma

510=93×5+35

since remainder is not=0 we again apply division lemma to 93

93=35×2+23

similarly

again using division lemma

35=23×1+12

again

23=12×1+11

again

12=11×1+1

again

11=1×11+0

now remainder has become 0 therefore it's HCF is 1

Answer 2

Answer:

Step-by-step explanation:

HCF(510,93)

a>b

a=510

b=93

By Euclids Division Lemma

a=bq+r

510=93*5+45

Now,

93=45*2+3

45=3*15+0

We got the remainder '0'

So,at remainder 0 the 'b' what we are getting will be the HCF

Therefore,

                b=3

    i.e. HCF=3

Hope it would be Helpful!

  THANK YOU!