I'm learning Number Theory on my own for competitive maths. The textbook I'm using is the part of the Olympiad syllabus in my country, so the problems are picked and adapted from other textbooks. I'm not quite sure where this particular one came from.
The book presents the proof for the division algorithm and I am asked to prove this case.
Show that if $a, b \in Z $ and $a \gt 0$ then there exists a unique pair of $q, r \in Z$ that satisfies $b = aq + r$ and $2a \le r \lt 3a$
Thanks for the help!