Question

use Euclid division algorithms to find the HCF of . 867and225

Answer 1

Answer:

Step-by-step explanation:

HEYA...........✌✌✌✌✌✌

HERE IS YOUR ANSWER....................

_____________________________

EUCLID DIVISION LEMMA:

a = bq + r

Here,

a = 867(greater no. of both)

b = 225

a = bq + r

867 = 225 × 3 + 192

225 = 192 × 1 + 33

192 = 33 × 5 + 27

33 = 27 × 1 + 6

27 = 6 × 4 + 3

6 = 3 × 2 + 0

HCF ====>>> 3

____________________________

HOPE MY ANSWER WOULD HELP YOU

REGARD MADHU@

Answer 2

Answer:

Step-by-step explanation:

hopes it will help u............................

all the best for ur  exam..............................