Question

use Euclid's algorithm to find the HCF
of 85 and 51 and then express it in the
form 85x+51Y,where x and y are
integers?​

Answer 1

Answer:

According to euclid's division lemma;

a=bq+r

85=51*1+34

51=34*1+17

34=17*2+0

So, here the last divisor is 17.

Therefore, HCF(85,51)=17

Hope it helps you.......

Pls mark it as brainliest.........

Step-by-step explanation: