can you explain how should i verify of prove 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.