Give the formal statement of Euclid's division algorithm
Answers
Answered by
1
divided= divisor*quotient +remainder
yuvi2167:
tq bro
ur welcome
Answered by
7
Answer:
Given two positive integers a and b there exist unique integer q and r satisfying a=bq+r, 0<_r<b.
Notice:- each time r is less then b. Each q and r is unique
Hope it is hepfull to u then mark it as a brainliest answer
tq dear
Ur welcome
that is for Euclid division lemma
U can also write this ok
what is the difference between the one u answer from that which i
this have proper defination ok
which u did not given
And if u write in the way u given the answer then ur marks will be deducted in exam
Similar questions