Let $\omega_1$ and $\omega_2$ be two complex numbers such that they don't lie along the same line through origin. Then we define the lattice $\Lambda = \{a\omega_1 + b\omega_2 : a,b\in \mathbb{Z}\}$.
I wish to prove the following claim (part of a big-proof in the text-book):
For $n\in \mathbb{N}$, we have $$ \sum_{\substack{\lambda\in\Lambda\\ n-1<|\lambda|\leq n}} \frac{1}{|\lambda|^r} \leq \frac{1}{n^{r-1}} $$
I understand that we are summing over annulus $n-1<|\lambda|\leq n$ and that the number of such $\lambda$'s will be finite, but why the number of $\lambda$ in that annulus has the order of magnitude $n$?
What I can see is that: $$\sum_{\substack{\lambda\in\Lambda\\ n-1<|\lambda|\leq n}} \frac{1}{|\lambda|^r} \leq \frac{d(n)}{(n-1)^r}$$ where $d(n)$ is the number of lattice points in the annulus. But how exactly do we reach the desired inequalty?