Question

Buse
Euclid's
division
algorithon to
T198&38220​

Answer 1

a=bq+r this is the Euclid division algorithm

Answer 2

Answer:

An Euclid division algorithm said that the dividend (a)=divisor (b)× quotient (q) + remainder (r)

a=>bq+r ( this can be solve according to bodmass rule ).

where remainder ( r ) is

$0 \leqslant r \leqslant b$

its one use is also to find H.C.F. HOPES ITS HELP U MARK IT AS A BRAINLIST ANSWER ....