prove the following algebraically $\left( \begin{array}{c} 2n \\ 2\ \end{array} \right) = 2 \left( \begin{array}{c} n \\ 2\ \end{array} \right) + n^2$ I came across the following proof in my textbook that was used as a end of chapter review. How can I prove the following algebraically? 
$$\left( \begin{array}{c} 2n \\ 2\ \end{array} \right) = 2 \left( \begin{array}{c} n \\ 2\ \end{array} \right) + n^2$$
using $\left( \begin{array}{c} n \\ 2\ \end{array} \right) = \dfrac{n(n-1)}{2}$? 
$$\left( \begin{array}{c} 2n \\ 2\ \end{array} \right) = \frac{2n(2n-1)}{2} = 2n(n-1) = 2 \frac{n(n-1)}{2} + n^2 = 2\left( \begin{array}{c} n \\ 2\ \end{array} \right) + n^2 $$
Is this proof correct? if not how do I fix it?

It is not correct, and it should go like this:
$$\binom{2n}{2}=\frac{2n(2n-1)}{2}=n(2n-1)=2n^2-n=n(n-1)+n^2=2\frac{n(n-1)}{2}+n^2=2\binom{n}{2}+n^2$$
It looks that your work starts well and ends well but there is a bit of a muddle in the middle.
