Math, asked by sbarathykannan, 10 months ago

How we assume b in euclid lemma algorithm a= bq + r

Answers

Answered by abc685217
0
Euclid's division Lemma states that for any two positive integers 'a' and 'b' there exist two unique whole numbers 'q' and 'r' such that , a = bq + r, where 0≤r
Similar questions