In the book Algebraic Theory of Quadratic Numbers by Mak Trifkovic, there is an exercise on page 20 as follows:
Find the smallest constant $E\in \mathbb{R}$ for which the following version of the division algorithm holds: for any $\alpha, \beta \in \mathbb{Z}[\omega]$, $\beta \neq 0$, there exist $\gamma, \delta \in \mathbb{Z}[\omega]$ such that $\alpha = \gamma\beta+\delta$ and $N\delta \le E·N\beta$.
Note that, in this book, $\omega = \dfrac{1+\sqrt{-3}}{2}$, and the norm of $x=a+b\omega$ is defined to be $Nx = a^2+ab+b^2$.
I tried to prove this, and here is my attempt:
Since $\alpha = \gamma\beta+\delta$ then $\delta = \alpha -\gamma \beta$. The inequality $N\delta \le E·N\beta$ then can be written as $N(\alpha -\gamma \beta)\le E.N\beta$. Since $N$ is multiplicative then $N(\alpha -\gamma \beta) = N\beta\times N \left(\dfrac{\alpha}{\beta}-\gamma\right)\le E.N\beta$, which is equivalent to $N \left(\dfrac{\alpha}{\beta}-\gamma\right)\le E$.
Then we need to find the smallest $E$ such that for any $\alpha, \beta \in \mathbb{Z}[\omega]$, there exist $\gamma$ such that $N \left(\dfrac{\alpha}{\beta}-\gamma\right)\le E$.
Up to this point I want to use $\gamma$ as an anchor point in the complex plane tessellated by the equilateral triangle form by Eisenstein integers, and I think we can expect $\dfrac{\alpha}{\beta}$ lies near by $\gamma$ so we can induce a value for E (as in the case of integer, $\gamma= \lfloor\dfrac{\alpha}{\beta}\rfloor$). But I can't find anyway to express this in this case. I wonder whether $\dfrac{\alpha}{\beta}$ falls into the triangle $\gamma, \gamma + \omega, \gamma + 1$?
Sorry for my poor English, I can't find any better way to describe my problem with this exercise. Please help me to overcome this. Thanks.