Given two integers $n$ and $k$ such that $n\geq k+1$.
Can we find any relation between $\left\lfloor\dfrac{n}{k}\right\rfloor$ and $\left\lfloor \dfrac{n}{k+1}\right\rfloor$?
At first, I thought that $\left\lfloor \dfrac{n}{k+1}\right\rfloor=\left\lfloor\dfrac{n}{k}\right\rfloor-1,$ but then I found that, for $k=1$, $$\left\lfloor\dfrac{n}{2}\right\rfloor\neq n-1$$. So, I guess that $$\left\lfloor \dfrac{n}{k+1}\right\rfloor\leq\left\lfloor\dfrac{n}{k}\right\rfloor-1.$$ How can we prove this? Is this the best bound?
The floor function satisfies
To apply the last rule to your question, we must consider the difference between the two fractions inside the floor functions you are asking about: $$ \begin{align} a &= \frac n{k+1}\\ b &= \frac nk\\ b-a &= \frac nk-\frac n{k+1}\\ &=\frac n{k(k+1)} \end{align} $$ so applying the rule $\lfloor a\rfloor \leq \lfloor b\rfloor-\lfloor b-a\rfloor$ this gets us $$ \left\lfloor\frac n{k+1}\right\rfloor\leq \left\lfloor\frac n{k}\right\rfloor-m $$ where $$ m=\left\lfloor\frac n{k(k+1)}\right\rfloor $$ depends entirely on the size of $n$ relative to $k(k+1)$. If $n<k(k+1)$ we even have $m=0$ so the only constant you may subtract is in fact just zero, not $1$. So unfortunately we only have the very unsurprising $$ \left\lfloor\frac n{k+1}\right\rfloor\leq \left\lfloor\frac n{k}\right\rfloor $$ which appears to be not helpful at all.