## Show that,with the array representation for sorting an n-element heap, the leaves are the nodes indexed by n⌊n/2⌋+1,⌊n/2⌋+2,…,n

The Question of the CLRS $$6.1-7$$ exercise reads as:

Show that, with the array representation for sorting an n-element heap, the leaves are the nodes indexed by $$\lfloor n / 2 \rfloor + 1, \lfloor n / 2 \rfloor + 2, \ldots, n⌊n/2⌋+1,⌊n/2⌋+2,…,n$$.

I looked for the solution here: https://walkccc.github.io/CLRS/Chap06/6.1/

The solution was provided like this:

Let’s take the left child of the node indexed by $$\lfloor n / 2 \rfloor + 1.$$

\begin{aligned} \text{LEFT}(\lfloor n / 2 \rfloor + 1) & = 2(\lfloor n / 2 \rfloor + 1) \ & > 2(n / 2 – 1) + 2 \ & = n – 2 + 2 \ & = n. \end{aligned}

I can’t understand this statement: $$LEFT(⌊𝑛/2⌋+1) > 2(𝑛/2−1)+2$$