Given integers $a$, $b$ and $c$, I am trying to find $n \leq b-1$ such that this inequality holds :
$$ \sum\limits_{i=0}^{n} \frac{a}{b - i} \leq c \leq \sum\limits_{i=0}^{n+1} \frac{a}{b - i}$$
That is to say : the largest $n$ up to which the sum is the closest to $c$ .
Since : $$\sum\limits_{i=0}^{n} \frac{a}{b - i} = a \cdot (\sum\limits_{i=0}^{b} \frac{1}{i} - \sum\limits_{i=0}^{b-n-1} \frac{1}{i})$$
And $\sum\limits_{i=0}^{k} \frac{1}{i} = H_k$ where $H_k$ is the $k$-th harmonic number,
We can rewrite the inequality into :
$$a(H_{b} - H_{b-n-1}) \leq c \leq a(H_{b} - H_{b-n-2})$$
How to find a tight lower and upper bound for $n$, such that this inequality holds ?