Excuse me for my brain fart. I have a question regarding the proof of the division algorithm, specifically a question when proving uniqueness.
Recall:
(Division Algorithm)
Let a and b be integers, with b > 0. Then there exist unique integers q and r such that a = b*q + r where 0 <= r < b.
When proving uniqueness:
Uniqueness of q and r.
Suppose there exists integers r, r', q, and q' such that a = b*q + r, 0 <= r < b and a = b*q' + r', 0 <= r' < b. Then b*q + r = b*q' + r'. Assume that r' >= r. From the last equation we have b(q - q') = r' - r ; Therefore b must divide r'-r and 0 <= r' - r <= r' < b. This is only possible if r'- r = 0.
This is where may questioned exists. I am able to see that r' - r is a b multiple, but r' - r = 0. What axioms or properties am I missing?? It deductively makes sense that r' - r must be equal to 0 but if I was required to elaborate more on why this is, this is where my concern lies.
Could someone help me out with the understanding?? Thanks in advance
Recall:
(Division Algorithm)
Let a and b be integers, with b > 0. Then there exist unique integers q and r such that a = b*q + r where 0 <= r < b.
When proving uniqueness:
Uniqueness of q and r.
Suppose there exists integers r, r', q, and q' such that a = b*q + r, 0 <= r < b and a = b*q' + r', 0 <= r' < b. Then b*q + r = b*q' + r'. Assume that r' >= r. From the last equation we have b(q - q') = r' - r ; Therefore b must divide r'-r and 0 <= r' - r <= r' < b. This is only possible if r'- r = 0.
This is where may questioned exists. I am able to see that r' - r is a b multiple, but r' - r = 0. What axioms or properties am I missing?? It deductively makes sense that r' - r must be equal to 0 but if I was required to elaborate more on why this is, this is where my concern lies.
Could someone help me out with the understanding?? Thanks in advance