Euclidean Division Part 1

Euclidean division (also called Euclid’s division lemma) is the name for the fact that in the integers it is possible to divide with remainder.

Precisely it means that given integers a and b, where b is not 0.

There exists integers q and r, such that a = qb + r, with r greater than or equal to zero and strictly less than |b|.

This intuitive fact is extremely important in number theory and many of the arguments in future videos in this playlist will depend on it.

[jackbauer]

Thank you very much for your much appreciated hard work.