I saw this proof but i didn't understand the bold part
log(n!) = log(1) + log(2) + log(3) + ... + log(n)
Deleting the first half of the terms gives
log(n!) >= log(n/2) + log(n/2+1) + log(n/2+2) + ... + log(n)
could any one explain to me this part?
Well, for any $k \ge 1$ we have $\log ( k) \ge 0$.
And as a sum of positive elements is positive, we have $\sum_{k=1}^{\left\lfloor\frac{n}{2}\right\rfloor -1} \log (k) \ge 0 $. So we have $$ \log( n!) = \sum_{k=1}^n \log(k) = \sum_{k=1}^{\left\lfloor\frac{n}{2}\right\rfloor-1} \log(k) + \sum_{k = \left\lfloor\frac{n}{2}\right\rfloor}^n \log (k) \ge \sum_{k = \left\lfloor\frac{n}{2}\right\rfloor}^n \log (k) = \sum_{k=0}^{\left\lceil \frac{n}{2} \right\rceil } \log (\left\lfloor \frac{n}{2} \right\rfloor +k)$$