Question

State euclid's division algorithm
plz do answer it 1st​

Answer 1

Answer:

Explanation:

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.

Euclid’s division lemma can be used to find the highest common factor of any two positive integers and to show the common properties of numbers.

Read more on Brainly.in - https://brainly.in/question/1144632#readmore

Answer 2

it is a statement which prove a=bx +r .
please mark me brainliest and follow me