Question
Mon August 08, 2011 By:

can you explain how should i verify of prove euclid's lemma?

Expert Reply
Tue August 09, 2011
 The following is the statement and explanantion of euclid's lemma:

Given positive integers for a and b, there exists unique integers q and r satisfying

a=bq+r, 0?r<b.This statement is known as euclid's division algorithm.

As for examples:

The proof of this lemma is not in your course.

Home Work Help