Question

Surely I will mark the answer as brainliest if you explain me the Euclid division Lemma and the Euclid division algorithm very deeply with one example each....really
IF POSSIBLE EXPLAIN IN HINDI OR ENGLISH IS OK.....​

Answer 1

Answer:

given two positive integers a and b their exists a unique integers p and q so a=bq+r, 0<r<b. is called euclid's division lemma.

an algorithum is a series of well defined steps which gives a procedure for solving the type of probelm.

plzzzzz mark me brainlist.

hope it helps you.