Question

state eculids division algorithm​

Answer 1

Answer:

Euclid's division lemma: Euclid's division lemma, states that for any two positive integers 'a' and 'b' we can find two whole numbers 'q' and 'r' such that a=b×q+r where 0≤r<b.

Answer 2

Step-by-step explanation:

Euclid Division Algorithm

Given positive integer a&b , there exists unique pair of integers q& r satisfying

a = bq + r ( where 0≤r <b)

HOPE YOU UNDERSTOOD THE ANSWER AND FOLLOW ME AND MARK AS BRAINLIST ANSWER