Question

Use euclid algorithm to find hcf of 1190 and 1445 .express the hcf in the form 1190m+1445n

Answer 1

Answer:

Solution :-

1445 = 1190*1 + 255

1190 = 255*4 + 170

255 = 170*1 + 85

170 = 85*2 + 0

So, now the remainder is 0, then HCF is 85

Now,

85 = 255 - 170

(1445 - 1190) - (1190 - 255*4)

⇒ 1445 - 1190 - 1190 + 255*4

⇒ 1445 - 1190*2 + (1445 - 1190)*4

⇒ 1445 - 1190*2 + 1445*4 - 1190*4

⇒ 1445*5 - 1190*6

⇒ 1190*(- 6) + 1445*5

1190m + 1445n , where m = - 6 and n = 5

Step-by-step explanation:

Answer 2

nswer:

Step-by-step explanation:

Given 1190,1445

Euclid division lemma =

a=bq+r

1445=1190*1+235

1190=235*5+15

235=15*15+10

15=10*1+5

10=5*2+0

Hcf =5