The sum of integers from $1$ to $n$ is the following if we ignore the first half of the terms on the left side below:
$ 1+2+...+n\ge \left\lceil \frac{n}{2} \right \rceil + (\left\lceil \frac{n}{2} \right \rceil +1) + ... +n$
$\left\lceil \frac{n}{2} \right \rceil + (\left\lceil \frac{n}{2} \right \rceil +1) + ... +n \ge \left\lceil \frac{n}{2} \right \rceil +...+\left\lceil \frac{n}{2} \right \rceil$
$\left\lceil \frac{n}{2} \right \rceil +...+\left\lceil \frac{n}{2} \right \rceil = (n-\left\lceil \frac{n}{2} \right \rceil+1)*\left\lceil \frac{n}{2} \right \rceil$
$(n-\left\lceil \frac{n}{2} \right \rceil+1)\left\lceil \frac{n}{2} \right \rceil \ge (\frac{n}{2})(\frac{n}{2})$
Could you please explain how we get:
- $\left\lceil \frac{n}{2} \right \rceil +...+\left\lceil \frac{n}{2} \right \rceil = (n-\left\lceil \frac{n}{2} \right \rceil+1)*\left\lceil \frac{n}{2} \right \rceil$
- $(n-\left\lceil \frac{n}{2} \right \rceil+1)\left\lceil \frac{n}{2} \right \rceil \ge (\frac{n}{2})(\frac{n}{2})$