Please Login to access more options.
Problem 38: (Uniqueness Proof Of The Division Algorithm)
Prove that the integers $q$ and $r$ promised in the division algorithm are unique. So suppose that $a=q_1b+r_1$ where $0\leq r_1<b$ and also suppose that $a=q_2b+r_2$ where $0\leq r_2<b$. Prove that $q_1=q_2$ and $r_1=r_2$.
The following pages link to this page.
Here are the old pages.