Euclid’s division lemma:
Given positive integers a and b, there exist unique integers q and r satisfying a = bq + r where 0≤r<b.
Basically, it can be observed that remainder can never be more than the divisor, and is a non-negative integer (could be zero).