Prove that $\bigg\lfloor\frac{m}{p^k}\bigg\rfloor-\bigg\lfloor\frac{n}{p^k}\bigg\rfloor-\bigg\lfloor\frac{m-n}{p^k}\bigg\rfloor$ equal to zero or one for all $k,m,n\in \mathbb N$. where $m\geqslant n$ and $p$ is a prime.
What I did:
$\bigg\lfloor\frac{m}{p^k}\bigg\rfloor-\bigg\lfloor\frac{n}{p^k}\bigg\rfloor-\bigg\lfloor\frac{m}{p^k}-\frac{n}{p^k}\bigg\rfloor$
Let $x:=\frac{m}{p^k}$ and let $y:=\frac{n}{p^k}$
we get $\lfloor x\rfloor-\lfloor y\rfloor-\lfloor x-y\rfloor$
What should I do now?
Here's how you can prove it. This problem is easier if you generalize it to $$\lfloor x \rfloor +\lfloor y \rfloor +1 \ge \lfloor x+y \rfloor \ge \lfloor x \rfloor + \lfloor y \rfloor $$
This inequality can be proven if you set $x=n+\alpha, y=m+\beta$ where $0 \le \alpha, \beta \le 1$.
Now, since $[x+y]$ is an integer, this implies $\lfloor x+y \rfloor $ is $\lfloor x \rfloor + \lfloor y \rfloor$ or $\lfloor x \rfloor +\lfloor y \rfloor +1 $.