Question

what is Euclid's division lemma and division algorithm...

Answer 1

Answer:

Step-by-step explanation:

Euclids division lemma  -------------------------   a=bq+r  ( where, 0</=r<b)

euclids Division algorithm = every no has its own prime factors which are unique.

MARK AS BRAINLIEST