I am trying to prove the following statement from Terence Tao's Analysis 1 book.
Definition of multiplication $ab{+\!+} = ab+b$.
Definition of addition $(a{+\!+})+b=(a+b){+\!+}$.
Let $n$ be a natural number, and let $q$ be a positive number. Then there exists natural numbers $m$, $r$ such that $0 \le r \lt q$ and $n=mq+r$.
Now I attempted to prove the statement by inducting on $n$.
So for the base case $n=0$ $$0=mq+r$$ Since $q$ is positive $m$ and $r$ must be $$m=0$$ $$r=0$$ and we have $$0\le r \lt q$$ as desired.
Now assume true for $P(n)$ i.e. $$n=mq+r$$ and $$0\le r \lt q.$$
Now for $n{+\!+}$ (the successor to n) case.
Need to show $$n{+\!+}=mq+r.$$ Then using the induction hypothesis we have on the left hand side$$n{+\!+}=(mq+r){+\!+}=(mq{+\!+})+r=mq+q+r.$$ Then we use cancellation to arrive at $$mq+q+r=mq+r$$ $$q=0.$$ Which is not possible cause we assumed q is positive. So clearly I have done something wrong because the division algorithm is true.