Consider a square matrix of order $m$. At each step you can move one step to the right or one step to the top. How many possibilities are to reach $(m,m)$ from $(0,0)$?
I think it is just counting the Central binomial coefficients.
Am I right? If not what is be the correct answer and why?